Patent Application
20180242161
The technology disclosed herein relates generally to the field of communications systems and in particular to method of management of network slices and to a corresponding network element, computer program and computer program product.
The Fifth Generation (5G) communications system is seen as a network platform where billions of devices will be interconnected and connected towards the Internet. In the 5G scope, the number of devices and network elements will be orders of magnitude larger than in current communication systems. Traffic volumes and data rates required by some applications will also be multiplied hundreds or thousands times compared to the corresponding current numbers. However, not all predicted use cases will require the same data rates, resources etc., and the 5G system should be flexible so that, for instance, speed, capacity and coverage may be allocated in logical network slices according to the specific demands of each use case. Consequently, in order to meet new types of use cases, new types of connectivity services will be needed that should be highly scalable in terms of e.g. speed, capacity, reliability and availability. In view of this, a critical enabler for 5G system will be the concept of the so called “network slices” in which network resources will be offered on demand according to a service level agreement (SLA).
The management of network slices will be a challenge. It should, for instance, be possible to handle an SLA upgrade in a network slice. As an example, when a device upgrades its SLA at runtime and requires more bandwidth, some network elements may have to be changed to handle the new situation. Another example on requirements of the management is the need to adapt to internal network changes, such as for instance when one network element in a network slice is going to upgrade or some other network element suddenly has a high capacity.
Today, networks are managed in a centralized manner, i.e. one or few nodes are used for coordinating all network elements. Such centralized management typically requires complex solutions for providing reliability and availability and also suffer from scalability problems.
Systems based on centralized servers are vulnerable to failures, attacks and mismanagement. In the 5G scope, the number of devices and network elements will be orders of magnitude larger than in current systems making such management unsuitable for 5G systems.
The management used in current systems is hence not well suited for future connectivity systems, such as 5G systems, and that viable solutions for handling of network slices are required for these future connectivity systems.
An objective of the present disclosure is to address the above described issues and to provide methods and network elements enabling efficient management of network slices.
The objective is according to an aspect achieved by a method of distributed management of network slices, wherein each network slice comprises one or more network elements and provides one or more devices with network connectivity to services. The method is performed in a network element of a communications system and comprises: receiving, by means of a gossip protocol, information from one or more neighboring network elements; and performing, based on the received information, an action relating to one or more network slices, which network slices provide a first device with wireless connectivity to a service.
The method provides an efficient method of handling network slices, and provides in particular a distributed management of network slices of e.g. 5G systems by introducing peer-to-peer information exchange about network slices. This is in contrast to the centralized management, wherein data has to be moved upwards in the system hierarchy for a decision to be taken, which is then executed downwards in the system hierarchy. This centralized management is expensive in terms of network bandwidth, since each data packet about devices or network elements moving in the system consumes a part of the available total bandwidth. By instead, according to the present method, exchanging information between neighboring network elements increased efficiency is provided.
The objective is according to an aspect achieved by a computer program for a network element for distributed management of network slices. The computer program comprises computer program code, which, when executed on at least one processor on the network element causes the network element to perform the method as above.
The objective is according to an aspect achieved by a computer program product comprising a computer program as above and a computer readable means on which the computer program is stored.
The objective is according to an aspect achieved by a network element of a communications system for distributed management of network slices, wherein each network slice comprises one or more network elements and provides one or more devices with network connectivity to services. The network element is configured to: receive, by means of a gossip protocol, information from one or more neighboring network elements; and perform, based on the received information, an action relating to one or more network slices, which network slices provide a first device with wireless connectivity to a service.
Further features and advantages of the embodiments of the present teachings will become clear upon reading the following description and the accompanying drawings.
In the following description, for purposes of explanation and not limitation, specific details are set forth such as particular architectures, interfaces, techniques, etc. in order to provide a thorough understanding. In other instances, detailed descriptions of well-known devices, circuits, and methods are omitted so as not to obscure the description with unnecessary detail. Same reference numerals refer to same or similar elements throughout the description.
In an aspect of the present teachings, a distributed system for the management of network slices is suggested. Methods for information flow based on a gossip type of protocol, sometimes also denoted epidemic protocol, is provided for enabling efficient management. This distributed system may be used as a complement to a centralized management system.
The network element may, for instance, comprise a network node 2a, 2b providing radio access to devices 3a, 3b. Such network node 2a, 2b may be denoted in different ways depending on standards implemented in the communications system 1. For instance, while a network node handling the radio access to devices 3a, 3b is known as base transceiver station (BTS) in Global System for Mobile Communications (GSM), it is known as evolved Node B or eNB in Long Term Evolution (LTE) systems. The network nodes 2a, 2b, which in the following are denoted radio access nodes 2a, 2b, may implement different wireless access technologies (RATs), such as 3G, 4G, LTE, Bluetooth or Wi-Fi, to mention a few examples.
The network element may comprise a cell provided and controlled by a radio access node 2a, 2b, or the network element may comprise a router, switch, firewall, and/or server, e.g. a server providing a specific network function such as a Call Session Control Function (CSCF) or Home Location Register (HLR) 4. Further examples on network element comprise Base Station Controller (BSC) 5a, 5b, or correspondingly (for LTE) Radio Network Controller (RNC), and Mobile Switching Center (MSC) 6 or correspondingly (for LTE) Mobility Management Entity (MME), or gateway 7 providing connectivity to packet data networks (PDNs) 8 such as e.g. Internet. Examples of such gateways comprise (for LTE) Packet Data Network Gateway (PDN-GW) and (for 2G and 3G systems) Gateway GPRS support node (GGSN). It is noted that there are various other network elements, not mentioned here. It is further noted that although the exemplary communications system 1 shown in
In the present description, a “network slice” may be defined as a manageable logical entity comprising one or more network elements. The network slice is composed of one or several network elements. The network slice may comprise a single network element, and to mention a few particular examples, a network slice may comprise a radio access node 2a, 2b or part of a radio access node 2a, 2b, or comprise a radio access node 2a, 2b or part of a radio access node 2a, 2b, a BSC/RNC 5a, 5b and a MSC/MME 6. The network slice may further comprise network elements in a packet data network 8, e.g. a server 9 or part of a server of the Internet. In low-speed communications networking, a network slice may represent a subdivision of a channel buffer. Sections of the buffer may be divided into network slices that are used for buffering network messages and data.
The network slice provides network connectivity for one or more devices 3a, 3b. The network connectivity may be a wireless connectivity and/or a wired connectivity. The network slice may for instance comprise a single network element, e.g. radio access node 2a, 2b, in which case the network slice provides wireless connectivity to the devices 3a, 3b. In other instances the network slice comprises several network elements 2a, 2b, 3, 4, 5a, 5b, 6, 7, for instance a radio access node 2a, and one or more core network elements such as e.g. a BSC 5a, and an MSC 6, in which case the network slice provides both wireless connectivity as well as wired connectivity.
The term “device” is used for representing different types of terminals that use network connectivity to provide certain functionality. The device may, for instance, comprise a mobile phone, a smart phone, a vehicle with cellular network connection, a sensor with network connectivity, etc. The device consumes one or more network slices: a device having a high SLA may require several network slices while a device having low requirements may need only part of a network slice, i.e. several such low requirement devices may share one network slice.
The present teachings offer a method for management of network slices, wherein the network elements of the network slice may negotiate a knowledge summary from/within neighboring network elements or from/within network slices. A summary or profile may, for instance, be exchanged between neighboring network elements. The amount of details and completeness of the summary may, with use of the mentioned gossip type protocol, be negotiated between the network elements about their capabilities.
The present teachings suggest use of a peer-to-peer management approach by allowing network elements and network slices to communicate over an epidemic protocol. Such protocols are highly tolerant to many failures scenarios, easy to deploy and efficient. The randomized point-to-point message exchange is an approach that makes the idea robust event in case of overload or in case nodes and/or network elements are dynamically added or removed. A result is that if, and when a network element, for instance a network element such as a MSC 6 or any other higher network element fails, then using this approach, the lower network elements, e.g. radio access nodes 2a, 2b (BTSs), will still be able to handle events such as handover, or load-balancing without requiring an arbiter.
Today's network slicing is in essence equal to allocating network resources in a dumb pipe approach, i.e., in this context, the network simply transfers data to/from a device from/to e.g. Internet according to an end-to-end principle. The present method adds contextual knowledge and (smart) data about the devices and network elements within each network slice. The “smart” data can then be “traded” between the neighboring network elements, enabling distributed management to be implemented. A network element (or network slice) gathering information may take at least some decisions locally; for instance, a radio access node 2a, 2b may exchange information with its neighboring radio access nodes and make a decision on whether it may take over or assist in serving a particular device 3a, 3b in order for the device to obtain its agreed upon SLA.
The method according to the present teachings is also useful when devices 3a, 3b are moving or being allocated dynamically to different network elements. This behavior of different network elements joining or leaving the network slice is easily handled according to the present teachings, e.g. by implementing a Gossip type of protocol. In short, the described method allows for transporting contextual info about devices between network elements in a dynamic context as well as in a static one.
A few examples on information that may be negotiated and/or exchanged between network elements comprise:
An example of a standardized data exchange between network elements is a handover process for a device 3. Briefly and simplified: in the handover of the device 3a, 3b an ongoing call (or other service) gets transferred from one cell to another cell as the device 3a, 3b moves through the coverage area of a cellular network. The signal strength of the currently serving base station 2, as well as the signal strengths of the surrounding base stations, together with the availability of channels, comprises information needed to decide on execution of the handover. The device 3a, 3b, exemplified by a mobile station in
In GSM, handover decisions are generally initiated at the BTS 2a, 2b but handled at the BSC 5a, 5b level unless there is a requirement to change MSC 6 in which case, the MSC 6 will handle the request. This is because the BTS 2 does not know about the capabilities of neighboring BTSs, i.e., if necessary resources (free channels) are available. All the communication is hierarchical with the BTS being the root of the tree. This is disadvantageous, as described in the background section, but is overcome by the present teachings. In particular, by implementing the present teachings, a decentralized management is provided, wherein the network elements may exchange information and negotiate on a handover directly, instead of involving e.g. the BSC and possibly also MSC.
This information spreading is illustrated in
In this way, Gossip protocol has some interesting characteristic, which is taken advantage of according to the present teachings for enabling a distributed management. The protocol is simple e.g. in that every network element just needs to randomly pick up neighbor network element to pull or push information. It is further very reliable and robust, e.g. since there is no single master in this setup, and no single point of failure. Further, since every network element 2a, 2b, 4, 5a, 5b, 6, 7 selects a neighbor network element randomly,information is spreading in the communications system 1 randomly.
There is no need to pre-setup the communications system 1, and no static routing is required, so it is highly suitable for dynamic communication systems where the network elements 2a, 2b, 4, 5a, 5b, 6, 7 are constantly joining and leaving a network slice.
Still further, the use of gossip based protocols is, as realized by the inventors behind the present teachings, suitable for very large-scale communication systems. Since there is no single master required in the network, this protocol can almost scale infinitely.
In general, the gossip algorithm is very efficient and robust, but since it is nondeterministic how information is going to spread in the communication system, the latency to transfer information to a specific network element in the communications system 1 might be quite high. When combining the decentralized management method suggested herein with a centralized management, also latency sensitive services may still benefit from the present teachings, e.g. in that the network elements will receive information, which it may take advantage of in different way (e.g. facilitating handover preparations).
Given the nature of Gossip protocol described above, it is very suitable for instance for the following cases in 5G network slices in order to, for instance, exchange information about a moving device e.g. for handover purposes, in order to exchange information in a heterogeneous network e.g. information such as device profile of network access providing for instance a pattern of downlink and uplink traffic, protocol used, retransmission rate etc., in order to exchange data that is not latency sensitive, to guarantee that the communications system will eventually reach a desirable outcome (safety) e.g. spreading device behavior for enabling traffic optimization and providing an improved user experience.
As an example on the use of gossip protocol according to the present teachings, a first radio access node 2a controlling a small cell may require less information than a second radio access nodes 2b controlling a larger cell. A first radio access node 2a may be seen as having only “a small” portion of the network slice. The second radio access node 2b with high capacity may require more information and/or negotiate on resources from neighboring network elements, e.g. from the first radio access node 2a as it has more capabilities and a bigger portion of the network slice. Neighboring radio access nodes can then use gossiping to negotiate and agree about the contextual amount of data to exchange.
For example, based on a device signature (or analytics profile), the neighboring radio access node that currently handles a network slice by means of which the device is served can decide if adding a specific device 3 will still guarantee meeting the SLA. This is in contrast to centralized network management that requires a single centralized node to allocate network resource and decide on allocation of such resources.
A network node, e.g. the first radio access node 2a, builds an analytics profile (or signature) of a device 3 and during a handover a part or all of this information is carried over to the next network node, e.g. the second radio access node 2b, based on the negotiation. This signature can be built based on an aggregation of the device's behavior. As a particular example, in video streaming there is a key frame which appears at certain intervals which may be constant or varying. The pattern of the key frames may be provided as information on the device's behavior.
In the
In
There can be several reasons for such internal network change:
So in a summery, in 5G-network slice context, the source and destination (device 3a, 3b, and Remote Service, respectively) are the same, but internal network changes may be frequent and different network slices may be used. It is noted that 5G network is a heterogeneous network, which brings more complexity to the network slice setup.
In the following some specific use cases are described in some more detail for illustrating how the present teachings may be applied.
Spreading of Information, e.g. of Suspicious Devices
Network security is always a key concern for operators. In 5G contexts, it is more challenging to maintain a reliable network due to the complexity of network. Using gossip protocol to spread information about suspicious device is a perfect fit. A simple agent (e.g. server agent) can be deployed on a network element and be configured to monitor all connected devices and generate alarm when detecting any suspicious behavior, such as for instance a high retransmission rate. Then instead of reporting this information to upstream network element, the network element may use the gossip protocol to spread information to the entire communications system. Since the gossip protocol is a reliable way to spread information, the information is able to spread wider in the communications system.
Further, the gossip protocol supports both pull and push mechanisms, so even if an infected network element is not responding due to an attack (e.g. a denial-of-service attack), it is possible for neighboring network elements to detect this. A first network element may send (pull) a request for information from a second network element, and if the second network element is not responding to the pull request then the first network element may use the gossip protocol to spread information about the second network element not responding, and it might also receive such information from other network elements.
Spreading Device Behavior for Traffic Optimization and Providing Improved User Experience
Traffic behavior detection algorithm can be deployed on the network element in order to identify the traffic patterns of the devices. For example, if a device is streaming video in the network slice, which the network element is part of, then there will be repeated key frame and non-key frame in different packets. Key frame is a frame in which a complete image is stored in the data stream and the key frame has a big size. In order to save bandwidth, stream servers usually only produces key frames in every few frames. Other frames are non-key frames that are incremental changes between frames. The network element can hence detect such traffic pattern and use this to generate optimized bandwidth scheduling and reservation. This will also provide an improved user experience, by the network element being able to predict a key frame packet and prioritize it. All these information can be spread to neighboring network elements with the gossip protocol, so that when the device moves to neighboring network elements, the same optimization and prioritization can continue. A benefit gained from the gossip protocol in this use case is scalability. The number of devices in the communications system is huge and possible services provided by the communications system are very different. Using the gossip protocol, each network element can spread information without need of a centralized management node.
Network Status Aggregation
Aggregation provides a summary of some global network property. It allows local access to global information. For example, in a sensor network comprising e.g. temperature devices, if a network element requires to know about the average temperature of the whole sensor network, each two random devices can calculate and store the average of their temperatures, i.e. temperature devices A and B have measured temperature as 6 degrees and 10 degrees respectively. Using the gossip protocol, each one sends its temperature to the other and changes their average value to the average of the two, i.e. 8 degrees. Continuing this approach, after a while all the network elements know about the average of the temperature in the whole sensor network.
The various features and embodiments that have been described may be combined in different ways, examples of which are given in the following, with reference first to
A method 20 of distributed management of network slices is provided. A network slice is composed of one or more network elements and is involved in the providing of network connectivity to services for one or more devices. That is, each network slice comprises one or more network elements 2a, 2b, 4, 5a, 5b, 6, 7 and provides one or more devices 3a, 3b with network connectivity to services. Examples of services comprise applications provided by packet data networks, such as e.g. Internet, the service of wireless communication, sensor networks, network for managing and remote control of vehicles, etc. In short, the service may be any type of service requiring network connectivity.
The method 20 is performed in a network element 2a, 2b, 4, 5a, 5b, 6, 7 of a communications system 1 and comprises:
The method 20 brings about several advantages, e.g. improved user experience in that devices 3a, 3b may stay connected, although a network element currently involved in providing network connectivity might be down. By using the gossip protocol among network elements (or network slices), the non-functioning network element may rapidly be replaced by another one and the currently ongoing service be uninterrupted. Further, the method 20 provides scalability even to billions of network elements. By the distributed management enabled by the method 20, network slices can be changed quickly and be adapted to the needs of a device, the device e.g. changing SLA during ongoing session. Further still, the method 20 provides increased robustness, e.g. by not having a single master node, and no single point of failure. For instance, since the network slices may be quickly changed to adapt to current situation, a non-functioning network element of a network slice may quickly, in particular during ongoing session, changed to another network element. Using the gossip protocol, information such as available capacity may be exchanged between network elements. Available capacity may, for instance, comprise available processing capacity and/or communications resources.
In an embodiment, the method 20 comprises:
The sending of information to neighboring network elements 2a, 2b, 4, 5a, 5b, 6, 7 and the receiving of information from neighboring network elements 2a, 2b, 4, 5a, 5b, 6, 7 are performed by means of the gossip protocol.
In a variation of the above embodiment, the method 20 comprises, prior to the sending of information, receiving 21 from a network element 2a, 2b, 4, 5a, 5b, 6, 7 a list of potential neighboring network elements 2a, 2b, 4, 5a, 5b, 6, 7.
In various embodiments, the information comprises information related to service requirements of the first device 3a and/or information related to capacity of neighboring network elements 2a, 2b, 4, 5a, 5b, 6, 7, and wherein the step of performing 23 the action comprises:
In various embodiments, the information comprises information related to an improper behavior of the first device 3a, and wherein the step of performing 23 the action comprises blocking the first device 3a from the network connectivity by:
In various embodiments, the information comprises information on a status parameter in the communications system 1, and wherein the step of performing 23 the action comprises aggregating the corresponding status parameter for the one or more network slices and sending the aggregate to one or more neighboring network elements 2a, 2b, 4, 5a, 5b, 6, 7.
In various embodiments, the method 20 comprises:
In various embodiments, the method comprises dynamically discovering network elements 2a, 2b, 4, 5a, 5b, 6, 7. Such dynamic discovery may be performed by receiving information from a network element and/or by sending information to a network element 2a, 2b, 4, 5a, 5b, 6, 7 and receiving in response a message from the network element 2a, 2b, 4, 5a, 5b, 6, 7. The network element 2a, 2b, 4, 5a, 5b, 6, 7 may hence receive information from one or more network elements, in particular neighboring network elements and thereby discover these network elements. The may also, or as an alternative, send information to other network elements, e.g. broadcasting the information which may then be received by other (in particular neighboring) network elements. If the sending network element receives a response then it becomes aware of the existence of the (neighboring) network elements that sent the response.
In various embodiments the gossip protocol comprises a dissemination protocol disseminating information to any network element 2a, 2b, 4, 5a, 5b, 6, 7 of the communications system 1 and/or an aggregation protocol providing a summary of the communications system 1 and/or the one or more network slices.
In various embodiments the network element 2a, 2b comprises an access node of a radio access network. The network element 2a, 2b may for instance comprise a BTS or an eNB of a radio access network. As another example, the radio access network may comprise a WLAN and the network element 2a, 2b may hence comprise an access point (AP) of the WLAN.
The 2a, 2b, 4, 5a, 5b 6, 7 comprises a processor 30 comprising any combination of one or more of a central processing unit (CPU), multiprocessor, microcontroller, digital signal processor (DSP), application specific integrated circuit etc. capable of executing software instructions stored in a memory 31 which can thus be a computer program product 31. The processor 30 can be configured to execute any of the various embodiments of the method for instance as described in relation to
The memory 31 can be any combination of read and write memory (RAM) and read only memory (ROM), Flash memory, magnetic tape, Compact Disc (CD)-ROM, digital versatile disc (DVD), Blu-ray disc etc. The memory 31 may also comprise persistent storage, which, for example, can be any single one or combination of magnetic memory, optical memory, solid state memory or even remotely mounted memory.
The network element 2a, 2b, 4, 5a, 5b 6, 7 also comprises an input/output device 33 (indicated by I/O in
The network element 2a, 2b, 4, 5a, 5b 6, 7 comprises a gossip protocol, for instance in form of a gossip protocol software module 35. The network element 2a, 2b, 4, 5a, 5b 6, 7 may comprise computer program code for using under layer gossip protocol software module for sending different information to other network elements, i.e. applications using gossip protocol. The gossip protocol software module 35 may comprise a feature such as member discovery.
The network element 2a, 2b, 4, 5a, 5b 6, 7 may also comprise additional processing circuitry, schematically indicated at reference numeral 34, for implementing the various embodiments according to the present teachings.
The present teachings provide computer programs 32 for the network element 2a, 2b, 4, 5a, 5b 6, 7. The computer program 32 comprises computer program code, which, when executed on at least one processor 30 of the network element 2a, 2b, 4, 5a, 5b 6, 7 causes the network element 2a, 2b, 4, 5a, 5b 6, 7 to perform the method 20 according to any of the described embodiments thereof.
The present disclosure also encompasses computer program products 31 comprising a computer program 32 for implementing the embodiments of the method as described, and a computer readable means on which the computer program 32 is stored. The computer program product 31 may, as mentioned earlier, be any combination of random access memory (RAM) or read only memory (ROM), Flash memory, magnetic tape, Compact Disc (CD)-ROM, digital versatile disc (DVD), Blu-ray disc etc.
A network element 2a, 2b, 4, 5a, 5b 6, 7 of a communications system 1 for distributed management of network slices is provided, wherein each network slice comprises one or more network elements 2a, 2b, 4, 5a, 5b, 6, 7 and provides one or more devices 3a, 3b with network connectivity to services. The network element 2a, 2b, 4, 5a, 5b, 6, 7 is configured to:
The network element 2a, 2b, 4, 5a, 5b 6, 7 may be configured to perform the above steps e.g. by comprising one or more processors 30 and memory 31, the memory 31 containing instructions executable by the processor 30, whereby the network element 2a, 2b, 4, 5a, 5b 6, 7 is operative to perform the steps. In case of several processors 30 (not illustrated) they may be configured to perform all steps of the method 20 or only some of the steps.
In an embodiment, the network element 2a, 2b, 4, 5a, 5b, 6, 7 is configured to:
In a variation of the above embodiment, the network element 2a, 2b, 4, 5a, 5b, 6, 7 is configured to, prior to the sending of information, receive from a network element 2a, 2b, 4, 5a, 5b, 6, 7 a list of potential neighboring network elements 2a, 2b, 4, 5a, 5b, 6, 7.
In various embodiments, the information comprises information related to service requirements of the first device 3a and/or information related to capacity of neighboring network elements 2a, 2b, 4, 5a, 5b, 6, 7, and wherein the network element 2a, 2b, 4, 5a, 5b, 6, 7 is configured to perform the action:
In various embodiments, the information comprises information related to an improper behavior of the first device 3a, and wherein network element 2a, 2b, 4, 5a, 5b, 6, 7 is configured to perform the action of blocking the first device 3a from the network connectivity by:
In various embodiments, the information comprises information on a status parameter in the communications system 1, and wherein the network element 2a, 2b, 4, 5a, 5b, 6, 7 is configured to perform the action of aggregating the corresponding status parameter for the one or more network slices and sending the aggregate to one or more neighboring network elements 2a, 2b, 4, 5a, 5b, 6, 7.
In various embodiments, the network element 2a, 2b, 4, 5a, 5b, 6, 7 is configured to:
In various embodiments, the network element 2a, 2b, 4, 5a, 5b, 6, 7 is configured to dynamically discover network elements 2a, 2b, 4, 5a, 5b, 6, 7 by:
In various embodiments the gossip protocol comprises a dissemination protocol disseminating information to any network element 2a, 2b, 4, 5a, 5b, 6, 7 of the communications system 1 and/or an aggregation protocol providing a summary of the communications system 1 and/or the one or more network slices.
In various embodiments the network element 2a, 2b comprises an access node of a radio access network.
In an aspect, means are provided, e.g. function modules or units, that can be implemented using software instructions such as computer program executing in a processor and/or using hardware, such as application specific integrated circuits, field programmable gate arrays, discrete logical components etc., or any combination thereof.
A network element 2a, 2b, 4, 5a, 5b 6, 7 is provided for distributed management of network slices, wherein each network slice comprises one or more network elements and provides one or more devices with network connectivity to services. The network element 2a, 2b, 4, 5a, 5b 6, 7 comprises a first unit 42 for receiving, by means of a gossip protocol, information from one or more neighboring network elements. Such first unit 42 may for instance comprise processing circuitry adapted for such exchange (e.g. a unit such as e.g. unit 35 described with reference to
The network element 2a, 2b, 4, 5a, 5b 6, 7 comprises a second unit 43 for performing, based on the received information, an action relating to one or more network slices, which network slices provide a first device with wireless connectivity to a service. Such second unit 43 may for instance comprise processing circuitry adapted for performing such action (e.g. a unit such as unit 34 described with reference to
The network element 2a, 2b, 4, 5a, 5b 6, 7 may comprise still further units. For instance, the network element may comprise a third unit 41 for receiving from a network element a list of potential neighboring network elements. Such third unit 41 may for instance comprise processing circuitry for receiving and/or communication interface (e.g. units 33, 34 and/or 35 described with reference to
In summary, the present disclosure describes methods and network elements for, among other things, improving service coverage for network elements, and in particular 5G network elements. The present teachings bring about several advantages, such as:
The invention has mainly been described herein with reference to a few embodiments. However, as is appreciated by a person skilled in the art, other embodiments than the particular ones disclosed herein are equally possible within the scope of the invention, as defined by the appended patent claims.
| Filing Document | Filing Date | Country | Kind |
|---|---|---|---|
| PCT/SE2015/050852 | 8/5/2015 | WO | 00 |
