Update records of border cells

Abstract

A network node in a cellular communication network maintains a record of border cells of a network slice. A change in an active cell in the network is then determined. The record of border cells of the network slice is then updated based on the change in the active cell in the network.

Description

Technical Field

[0001] This involves updating records of border cells of a network slice, and in particular, involves updating records of border cells of a network slice in response to changes in active cells in the network. Background Art

[0002] The document 3GPP TS 23.501 V15.3.0 defines the architecture of a wireless communication network, which may be referred to as a 5G system or a Next Generation Radio (NR) network.

[0003] This defines a cellular network and also defines the concept of network slicing as a mechanism to provide improved services to users. A network slice comprises a portion of the available network resources. A network slice is identified by a single Network Slice Selection Assistance Information (S-NSSAI) which includes a Slice / Service Type (SST), which refers to the expected network slice behavior in terms of features and services; and may also include a Slice Differentiator (SD), which is optional information supplementing the Slice / Service Type(s) to differentiate between multiple network slices of the same Slice / Service Type.

[0004] In a defined cellular network, the finest granularity of service area restrictions is the Tracking Area (TA), where a Tracking Area contains one or (usually) more than one cell. This means that the minimum coverage of any slice is one Tracking Area (TA). In the management and orchestration system that deploys network slices, based on the received service request, the orchestration & management system must determine, among other tasks, what the coverage requirements associated in the service request are. The result will be a defined set of one or more tracking areas. The network will then be configured to associate the deployed network (NW) slices with the identified tracking areas. The configured (one or more) TAs define the areas to which user equipment or other devices associated with the NW slice are restricted, with respect to mobility aspects for accessing services supported in the NW slice.

[0005] As mentioned above, a tracking area is a logical entity that represents the aggregation of one or many cells. Although cells in some scenarios (such as indoor deployment or narrowband Internet of Things (NB-IoT)) may be dedicated to one NW slice, for most outdoor scenarios, the logical cells and their associated physical radio resources are shared and not dedicated to one NW slice.

[0006] Therefore, the resources of the tracking area (and its associated cells) will be shared by those devices that are granted access to services in all deployed NW slices that require such coverage (i.e., devices with full network coverage services) and potentially by those devices that are not associated with any particular NW slice (i.e., devices that are not authorized to use services on any NW slice).

[0007] The document 3GPP TS 38.300 V15.3.0 lists some key points related to network slicing, namely:

[0008] Resource management between slices

[0009] The Next Generation Radio Access Network (NG-RAN) supports policy enforcement between slices according to service level agreements. It should be possible for a single NG-RAN node to support multiple slices. The NG-RAN should be free to apply the best RRM policy of the service level agreement (SLA) to each supported slice.

[0010] Resource isolation between slices

[0011] NG-RAN supports resource isolation between slices. NG-RAN resource isolation can be achieved with the help of RRM policies and protection mechanisms, which should avoid that the shortage of shared resources in one slice breaks the service level agreement of another slice. It should be possible to fully dedicate NG-RAN resources to a certain slice. How NG-RAN supports resource isolation is implementation-dependent.

[0012] Slice availability

[0013] Some slices may be available only in part of the network. Awareness in the NG-RAN of the slices supported in its neighbor cells may be beneficial for inter-frequency mobility in connected mode.

[0014] Slice-aware granularity

[0015] Slice awareness in NG-RAN is introduced at the Protocol Data Unit (PDU) session level by indicating the S-NSSAI corresponding to the PDU session in all signalling containing the PDU session resource information.

[0016] Mobility

[0017] To achieve mobility slice awareness in case of network slicing, S-NSSAI is introduced as part of the PDU session information transmitted during mobility signaling. This enables slice-aware admission and congestion control.

[0018] In summary, the key aspects in NR for NW slicing include:

[0019] SLA compliance by slice usage;

[0020] Implement RRM strategies and protection mechanisms

[0021] Optimize inter-frequency mobility

[0022] Optimize admission and congestion control.

[0023] By using slice-aware mechanisms, such as mapping slice S-NSSAI to supported (one or more) TAs and their associated cells, and taking into account slice availability, such as partial network coverage, overlapping slice coverage, etc., certain optimizations can be achieved in terms of access, congestion and mobility.

[0024] The optimization mechanisms discussed above fail to recognize that cells cannot all be treated the same. In particular, these mechanisms fail to recognize that the policies and protection mechanisms to be applied in the cells of a network slice can be advantageously differentiated, depending on whether the cell is at the coverage boundary or not.

[0025] The above challenges can be at least partially addressed by identifying cells that form part of the coverage boundary of a network slice. This helps to achieve radio network optimization in areas such as access, congestion, mobility and energy efficiency.

[0026] It should be understood that with respect to changes in radio deployment, there may be many driving factors for adding or removing cells from the network. For example, one of these factors may be the changing demand for network capacity. In one example, in the case of network capacity growth, existing cells in the network may experience an increase in their traffic load. This may result in a reduction in the effective coverage area of ​​the cell. Therefore, in response to the network capacity growth, additional cells may be deployed within the network in order to prevent areas without coverage (which may be referred to as "white spots") from appearing in the network.

[0027] From a radio perspective, two examples of factors that determine the need to add or remove a tracking area from the network, or to revise the number of sites or cells included in a tracking area are:

[0028] a. Tracking area update performance, which may result in high signaling load or low tracking area success rate, and

[0029] b. Paging performance, where it may be that the tracking area is large and this results in dropped pages at the base station level. In these cases, tracking area splitting may be required to improve paging performance.

[0030] The radio optimizer / planner will typically monitor these (and possibly additional) performance factors and request tracking area design modifications when a need for modification is identified. This can occur at any stage in the network life cycle and can also occur in mature networks.

[0031] During the operator's process, radio design or radio optimization, the team will typically trigger a tracking area plan change in the radio deployment. This will be done via interaction with the Operation Support System (OSS) to complete the required reconfiguration. It will also be understood that for energy efficiency reasons, the operator may decide to lock cells to low traffic levels, which may result in a change in the radio coverage solution. Summary of the invention

[0032] Therefore, while border cells can be identified at the time of network slice deployment, there is still the issue of post-deployment time where the radio deployment changes due to, for example, increased capacity requirements when nodes and / or cells are added to or removed from the network.

[0033] An object of the present disclosure is to provide a method, an apparatus, and a computer-readable medium that at least partially address one or more of the above challenges.

[0034] According to a first aspect, there is provided a method for monitoring a cell in a cellular communication network, the method comprising:

[0035] Maintaining a record of border cells of at least one network slice;

[0036] determining a change in active cells in the network; and

[0037] Based on the change in active cells in the network, the record of border cells of the at least one network slice is updated.

[0038] According to another aspect, there is provided a network node for a cellular communication network, the network node comprising a processor and a memory, the memory containing instructions executable by the processor, wherein the memory operates to:

[0039] Maintaining a record of border cells of at least one network slice; and

[0040] wherein the processor is operative to:

[0041] determining a change in active cells in the network; and

[0042] Based on the change of active cells in the network, update the record of border cells of at least one network slice.

[0043] According to another aspect, there is provided a computer program product comprising computer readable code configured to cause a suitably programmed processor to perform the method according to the first aspect.

[0044] According to yet another aspect, there is provided a computer program product comprising a tangible computer-readable medium containing computer-readable instructions for causing a processor to perform a method comprising:

[0045] Maintaining a record of border cells of at least one network slice;

[0046] determining a change in active cells in the network; and

[0047] Based on the change of active cells in the network, update the record of border cells of at least one network slice.

[0048] Thereby, the border cell list of the radio network can be self-maintaining regardless of changes in the radio deployment, and this helps to ensure that the relevant radio algorithms, in particular the mobility algorithms, are correctly optimized.

[0049] Further characteristics of the invention are as claimed in the dependent claims. BRIEF DESCRIPTION OF THE DRAWINGS

[0050] Figure 1 is a schematic diagram of a wireless communication network;

[0051] Figure 2 An implementation of a wireless communication network is illustrated;

[0052] Figure 3 Different implementations of wireless communication networks are illustrated;

[0053] Figure 4 It is a schematic diagram of network nodes;

[0054] Figure 5 is a flow chart illustrating a method performed in a network node;

[0055] Figure 6 illustrates cells, tracking areas, and network slices in a wireless communication network;

[0056] Figure 7 further illustrating cells, tracking areas, and network slices in a wireless communication network; and

[0057] Figure 8 is a flow chart illustrating a method of monitoring cells in a cellular communication network.

[0058] Fig. 9 Shows the implementation Figure 8 A possible embodiment of the method.

[0059] Fig.10 The addition of a new cell to the network is illustrated, which is not a border cell.

[0060] Fig.11 The addition of a new cell to the network is illustrated, which is a border cell.

[0061] Fig.12 The removal of a cell from the network is illustrated, which is a border cell.

[0062] Fig.13 The illustration shows the removal of a cell from the network, which is not a border cell.

[0063] Fig.14 The operation of a network node is illustrated.

[0064] Fig.15 A first use of the method is illustrated.

[0065] Fig.16 A second use of the method is illustrated.

[0066] Fig.17 A third use of the method is illustrated. DETAILED DESCRIPTION

[0067] Figure 1 is a schematic diagram of a wireless communication network 10 .

[0068] The network 10 may be, for example, a network known as a 5G network or a Next Generation Radio (NR) network, the architecture of which is defined in document 3GPP TS 23.501 V15.3.0.

[0069] Generally speaking, the network 10 includes a core network 12 and a radio access network 14 .

[0070] The radio access network 14 includes physical radio nodes that include transceivers capable of communicating with wireless devices within its coverage area. The wireless devices may be user equipment (UE) devices, such as smartphones or tablets, or they may be devices that automatically connect to the network, such as tracking devices, and they may be mobile or may be fixed, for example in the form of telemetry devices. When the term user equipment (UE) is used herein, it may refer to any wireless device capable of communicating with the network.

[0071] Figure 2 An implementation of a wireless communication network 10 is illustrated, and in particular, components of the network 10 for management and control of network slicing are shown. Specifically, Figure 2 The network 10 is shown to include a network (NW) slice orchestration and management node 20. The NW slice orchestration and management node 20 deploys resources with the help of a cloud orchestration node 22. Specifically, the cloud orchestration node 22 can orchestrate network resources and network slice services.

[0072] Figure 2The network 10 is also shown as including a radio domain management node 24, through which network resources allocated for network slices are configured.

[0073] The radio access network of the network 10 includes a plurality of physical radio nodes 26 , each of which provides service to one or more associated cells 28 .

[0074] In a Long Term Evolution (LTE) physical network function (PNF) deployment, the physical radio node 26 is referred to as an eNodeB. In this case, the physical radio node 26 is pre-configured with various policies and control mechanisms, such as those related to admission, congestion control, mobility, and energy efficiency. In the network shown here, network slicing is used, and the physical radio node 26 is pre-configured with policies and control mechanisms to be applied to the network slice.

[0075] In a next generation radio (NR) deployment, the network 10 typically includes multiple radio control nodes 30 hosting radio control functions (RCFs), and the radio control nodes are pre-configured with policies and control mechanisms, such as those related to admission, congestion control, mobility, and energy efficiency, and these policies and control mechanisms may include policies and control mechanisms specifically applied to network slices.

[0076] Figure 3 An alternative implementation of a wireless communication network 10 is illustrated, and components of the network 10 used for management and control of network slices in this implementation are shown. Specifically, Figure 3 The network 10 is shown to include a network management node 40. The network management node 40 supervises a radio domain management node 42, through which network resources allocated for network slices are configured.

[0077] The radio access network of the network 10 includes a plurality of physical radio nodes 44 , each providing service to one or more associated cells 46 .

[0078] In a Long Term Evolution (LTE) physical network function (PNF) deployment, the physical radio node 44 is referred to as an eNodeB. In this case, the physical radio node 44 is pre-configured with various policies and control mechanisms, such as those related to admission, congestion control, mobility, and energy efficiency. In the network shown here, network slicing is used, and the physical radio node 44 is pre-configured with policies and control mechanisms to be applied to the network slice.

[0079] In a next generation radio (NR) deployment, the network 10 typically includes multiple radio control nodes 48 hosting radio control functions (RCFs), and the radio control nodes are pre-configured with policies and control mechanisms, such as those related to admission, congestion control, mobility, and energy efficiency, and these policies and control mechanisms may include policies and control mechanisms specifically applied to network slices.

[0080] In reference Figure 2 or Figure 3 In any of the described implementations, to deploy a NW slice, the required virtualized resources are first allocated and connected. Then, all resources (physical and virtual) are configured to satisfy the service requirements associated with the specified service request that triggers the NW slice deployment. From a radio perspective, this means that the required radio coverage is allocated and the associated radio resources are configured.

[0081] An algorithm is described herein for determining which policies to apply to a network slice, and to UE devices served by cells forming part of the network slice.

[0082] The algorithm can be deployed in any suitable node of the network. Figure 2 In the network shown, the algorithm may be deployed in the NW slice orchestration and management node 20, or in the radio domain management node 24, or in each physical radio edge node 26, or in the or each radio control node 30. Similarly, in Figure 3 In the network shown, the algorithm may be deployed in the network management node 40, in the radio domain management node 42, in each physical radio edge node 44 or in each radio control node 48. Algorithm-related configurations at system level or cell level will be controlled from and stored in the radio domain management nodes 24, 42.

[0083] Figure 4 The general form of any of these nodes in which the algorithm may be deployed is illustrated.

[0084] In particular, the relevant network node 50 comprises one or more interfaces 52, which may be used to communicate with other network nodes and / or, in the case where the network node 50 is a physical radio node, with UEs served by the node.

[0085] The network node 50 further comprises a processor 54 for executing the algorithm.

[0086] The network node 50 also includes a memory 56 for storing data and for storing program instructions to cause the processor to execute the algorithm.

[0087] Figure 5is a flow chart illustrating a method performed in a network node, for example when a network is first deployed or when a new network slice is defined.

[0088] exist Figure 5 In step 60 of the method shown, the network node stores information defining at least one network slice.

[0089] For example, the stored information may include information defining the slice type for each defined network slice.

[0090] In addition, the stored information may include information identifying cells that define at least a portion of the boundaries of the coverage area of ​​the network slice.

[0091] Figure 6 The diagram shows a portion of a network in which the method is deployed. Specifically, the network 70 includes a plurality of cells, each of which is served by a physical radio node. Figure 5 The cell is divided into tracking areas (TAs). Figure 6 , three tracking areas 72, 74, 76 are shown. Tracking area 72 includes cells 72a, 72b, ..., 72j; tracking area 74 includes cells 74a, 74b, ..., 74j; and tracking area 76 includes cells 76a, 76b, ..., 76i.

[0092] In this illustrated embodiment, three network slices are defined: A first network slice covers tracking areas 72, 74; a second network slice covers tracking areas 74, 76; and a third network slice covers tracking areas 72, 76.

[0093] Information about each slice is stored in the relevant network node(s). The information may, for example, indicate the cells and / or tracking areas that make up the slice. Furthermore, the information stored about the slice may include an indication of the slice type. For example, some slices may be configured in such a way that they provide high bandwidth (e.g. for streaming mobile entertainment services), while other slices may be defined in such a way that they provide ultra-reliable connections.

[0094] In addition, the preliminary algorithm can be enabled or disabled. Figure 5 As described in more detail below, Figure 5 The approach distinguishes between cells that define the network slice boundaries and cells that are not part of the network slice boundaries.

[0095] In order to identify the cells that define the boundaries, the neighbor list of the cells in the network slice can be used. Specifically, in this one embodiment, for multiple individual cells in the coverage area of ​​the network slice, the neighbor cell list of the individual cell is compared with the complete list of cells in the coverage area of ​​the network slice. If one or more cells appearing in the neighbor cell list do not appear in the list of cells in the coverage area of ​​the network slice, it can be determined that the cell defines at least a portion of the boundaries of the coverage area of ​​the network slice. In some embodiments, the following steps are performed for each individual cell in the coverage area of ​​the network slice: (a) comparing the neighbor cell list of the individual cell with the complete list of cells in the coverage area of ​​the network slice, and (b) if one or more cells appearing in the neighbor cell list do not appear in the list of cells in the coverage area of ​​the network slice, it is determined that the individual cell defines at least a portion of the boundaries of the coverage area of ​​the network slice.

[0096] This reference Figure 7 Specifically, Figure 7 The case where the network slice under consideration is a network slice consisting of tracking areas 72, 74 is shown.

[0097] First, by way of illustration, consider cell 72f. The neighbor list of cell 72f includes cells 72b, 72d, 72g, 72i, 74e, and 74i. All of these cells in the neighbor cell list of cell 72f appear in the list of cells in the coverage area of ​​the network slice, and therefore it can be determined that cell 72f does not define part of the boundaries of the coverage area of ​​the network slice.

[0098] Then, by way of further illustration, consider cell 74i. The neighbor list of cell 74i includes cells 72f, 72i, 74e, 74g, 74j, and 76f. Because cell 76f, which appears in the neighbor cell list, does not appear in the list of cells in the coverage area of ​​the network slice, it can be determined that cell 74i defines at least a portion of the boundaries of the coverage area of ​​the network slice.

[0099] Thus, by considering all cells in tracking areas 72, 74, it can be determined that the cells defining the boundaries of the network slice consisting of tracking areas 72, 74 will be cells 72a, 72b, 72c, 72e, 72h, 72i, 72j, 74a, 74b, 74c, 74f, 74h, 74i and 74j.

[0100] It will also be noted that while cells such as cells 72a, 72c and 72e are at the boundaries of a network slice consisting of tracking areas 72, 74, the same cells are also at the boundaries of a network slice consisting of tracking areas 72, 76, and it will also be noted that these network slices can be of different types.

[0101] In contrast, it was noted above that cell 72f does not define part of the boundaries of the coverage area of ​​the network slice composed of tracking areas 72, 74. However, cell 72f does define part of the boundaries of the coverage area of ​​the network slice composed of tracking areas 72, 76.

[0102] Thus, for each defined network slice, such as Figure 5 As shown in step 62 of the method, information identifying multiple cells defining at least a portion of the boundaries of the coverage area of ​​the network slice is stored. The information may be stored in a control node serving multiple cells, and / or may be stored in a radio node serving only one cell. In this case, as described above, the cells may be identified as boundary cells of one or more network slices, and non-border cells of one or more other network slices.

[0103] The stored information can be used to identify, for each network slice, cells that are boundary cells and cells that are non-boundary cells. Equivalently, the stored information can be used to identify, for each cell, a network slice in which the cell is a boundary cell and a network slice in which the cell is a non-boundary cell.

[0104] The policy applied to the relevant network slice is then pre-configured, for example, by a control node of the network and stored for use in each cell.

[0105] As mentioned above, the preliminary algorithm provides Figure 5 As described in more detail below, Figure 5 The approach distinguishes between cells that define the network slice boundaries and cells that are not part of the network slice boundaries.

[0106] It should therefore be understood that following instantiation of multiple cells of the network 70, a preliminary algorithm will distinguish between cells that define network slice boundaries and cells that are not part of the network slice boundaries.

[0107] However, over time, it is possible that the radio coverage provided by the network 70 will be modified. For example, changing demands on network capacity may require modifications to the radio coverage provided by the network 70. In one example, the demand on network capacity may increase, and existing cells of the network 70 may experience an increase in traffic load as a result of this. An increase in cell traffic load may contribute to a reduction in the effective coverage area of ​​the cell. In some examples, an increase in traffic load on a cell may result in areas of no coverage (also referred to as "white spots") within the network. In order to address the reduction in the effective coverage area of ​​cells of the network 70, the operator of the network 70 may deploy additional cells within the network 70, for example by deploying additional radio nodes. Thus, one or more additional cells may be deployed to produce an increase in network capacity.

[0108] In another example, the demand for network capacity may decrease, and existing cells of the network 70 may be removed from the network 70. For example, the operator of the network 70 may decide to "lock in" cells that are determined to have low traffic levels, for example, at a certain time of the day or week. Removing cells in this way may have the advantage that it reduces energy consumption in the network 70.

[0109] Thus, it should be appreciated that cells may be added to or removed from the network 70 in response to changing traffic requirements of the network 70 .

[0110] After adding cells to the network 70 (or removing cells from the network 70), the stored information that can be used to identify cells that are boundary cells and cells that are non-boundary cells for each network slice may no longer be accurate. It will be understood that after adding cells to the network 70 or removing cells from the network 70, the boundary cells of one or more network slices of the network 70 may change. Thus, the stored information based on the network slices defined when the cells of the network 70 are instantiated may no longer accurately identify the boundary cells (and cells that are non-boundary cells) of the network slices within the network 70.

[0111] The stored information (as described above) may include a record of the border cells of the network slice. Figure 7 As described above, for a network slice consisting of tracking areas 72 and 74, the stored information may include records of border cells 72a, 72b, 72c, 72e, 72h, 72i, 72j, 74a, 74b, 74c, 74e, 74f, 74h, 74i and 74j.

[0112] Currently, this method (as referenced above) Figure 5The method described above is not able to evaluate changes in the cell coverage of the network 70 and, following such evaluation, is not able to update the stored information so that the stored information accurately reflects the updated state of the network 70. In other words, the method (described above) is currently unaware of changes in the cell coverage of the network 70.

[0113] It would therefore be beneficial if it were possible to provide a method that could update border cell records for a network slice based on changes in active cells in the network.

[0114] Figure 8 is a flow chart illustrating a method of monitoring cells in a cellular communication network.

[0115] exist Figure 8 Step 82 of the method shown in the figure maintains a record of the border cells of the network slice. This record can be performed, for example, by executing Figure 5 or by executing Figure 8 Obtained by the method shown in .

[0116] exist Figure 8 In step 84 of the illustrated method, a change in active cells in the network is determined.

[0117] For example, a notification may be received that a cell has been added to or removed from a cellular communication network. A list of active cells may be maintained in the cellular communication network and the cell may then be added to or removed from the list of active cells. The notification may be received following an unplanned event occurring in the network, such as a failure of a base station or part thereof, or following a planned event, such as maintenance work where a base station (or single cell) has been shut down or a new base station (or cell) has been added to the network to improve network coverage.

[0118] exist Figure 8 Step 86 of the method shown, updates the record of border cells of the network slice based on the change of active cells in the network.

[0119] It should be understood that Figure 8 The method may be performed in any suitable network node (eg, the network node 50, or the radio management node 24, or the radio management node 42 as described above).

[0120] For example, the processor 54 of the network node 50 may be configured to maintain a record of border cells of at least one network slice, determine changes in active cells in the network, and update the record of border cells of at least one network slice based on the changes in active cells in the network.

[0121] Preferably, in order to determine whether the added cell is a border cell of the network slice, the method may include comparing the neighbors of the added cell with a list of cells in the coverage area of ​​the at least one network slice. Then, if one or more cells appearing between the neighbors do not appear in the list of cells in the coverage area of ​​the at least one network slice, it is determined that the added cell defines at least a portion of the boundary of the coverage area of ​​the at least one network slice (i.e., the added cell is a border cell of the network slice).

[0122] Operations corresponding to the above operations may be performed with respect to the cell removed from the network.If not all neighbors of the removed cell belong to the identified slice, the removed cell is a border cell.

[0123] This information can then be used to update the record of border cells of at least one network slice.

[0124] The method, in its various embodiments, may be implemented in a network node comprising a processor and a memory, wherein the memory contains instructions executable by the processor such that the network node is operable to perform the operations of the method.

[0125] Fig. 9 Shows the implementation Figure 8 A possible embodiment of the method.

[0126] The self-healing algorithm 90 maintains a record of the border cells of the network slices within the network (e.g., the above-mentioned network 70). In other words, a record of the border cells of the network slices that have been deployed within the network (and have a defined radio configuration and a defined coverage area) is maintained by the self-healing algorithm 90.

[0127] In this embodiment, the self-healing algorithm 90 has been deployed in the radio domain management node 92, and thus, a record of the border cells of the network slice has been created in the radio domain management node 92 and maintained by the radio domain management node 92. One advantage of deploying the self-healing algorithm 90 in the radio domain management node 92 is that a multi-domain view of the slice coverage area and its associated border cells is provided.

[0128] However, it should be understood that the deployment of the self-healing algorithm 90 may depend on the radio deployment. For example, in an LTE PNF deployment, the self-healing algorithm 90 may be deployed in each base station eNodeB. In another example, in an NR deployment, the self-healing algorithm 90 may be deployed in each radio control node that hosts the RCF function. These nodes may be physical or virtual. The self-healing algorithm 90 may also be deployed in a network manager, which also provides a multi-domain view of the slice coverage area and its associated border cells.

[0129] However, regardless of the configuration of the deployment of the self-healing algorithm 90, the configuration will be controlled by the radio domain management node 92 and maintained therein.

[0130] Thus, if Figure 8 As shown in step 82 of the method, a record of the border cells of the network slice is maintained.

[0131] The record of border cells of network slices may include a list of border cells for each network slice included in the network.

[0132] In the illustrated embodiment, the self-healing algorithm 90 is subscribed to a cell management function 94. Thus, after an active cell in the network 70 changes, the cell management function 94 will notify the self-healing algorithm 90. For example, such a change may be the addition of a cell to the network. Alternatively, such a change may be the removal of a cell from the network.

[0133] Thus, as in Figure 8 As shown in step 84 of the method, a change in an active cell in the network is determined.

[0134] Upon receiving this notification from the cell management function 94 , the self-healing algorithm 90 may then determine a list of potentially affected network slices based on the determined changes in active cells in the network 70 .

[0135] After determining the list of potentially affected network slices, the self-healing algorithm 90 can cause the above-mentioned predetermined algorithm to be executed (for each potentially affected network slice). As a result of executing the predetermined algorithm, the self-healing algorithm 90 can then determine the recorded changes of the border cells of the network slices in the network 70.

[0136] Finally, the self-healing algorithm 90 can update the record 96 of the border cells of the network slice based on the changes in the cells active in the network. For example, the record can be updated using the determined changes in the record of the border cells of the network slice in the network 70.

[0137] Thus, as in Figure 8 As shown in step 86 of the method, based on the change of active cells in the network, the record of the border cells of the network slice is updated.

[0138] Fig.10 The addition of a new cell 100, which is not a border cell, to the network 70 is illustrated. A new cell 110 is added to the tracking area 72.

[0139] As described above, the self-healing algorithm 90 maintains a record of the border cells of the network slices within the network 70.

[0140] Thus, if Figure 8 As shown in step 82 of the method, a record of the border cells of the network slice is maintained.

[0141] After the cell 100 is added to the network 70 , the cell management function 94 will inform the self-healing algorithm 90 that a cell has been added to the network 70 .

[0142] Thus, as in Figure 8 As shown in step 84 of the method, a change in active cells in the network is determined.

[0143] After such determination by the self-healing algorithm 90 that a cell has been added to the network 70, the self-healing algorithm 90 will identify the neighbors of the newly added cell 100. For example, as part of its normal operation, the cell 100 may make measurements of nearby cells and may identify the neighbors of the cell 100 based on these measurements. Alternatively or additionally, if in performing Figure 8 When the method is used, if the neighbor cell list of cell 100 already exists, the pre-existing neighbor cell list can be used.

[0144] In this embodiment, the neighbors of cell 100 will be identified as cells 72c, 72d, 72e, and 72g.

[0145] After this, the self-healing algorithm 90 will then identify which of the identified neighbors of the cell 100 are border cells of at least one network slice.

[0146] For example, a record of border cells of a network slice may be used to identify which identified neighbors of the cell 100 are border cells of at least one network slice.

[0147] Specifically, the previously obtained records of cells that are border cells of at least one network slice are compared with the neighbor list of the newly added cell 100. The cells that appear on both lists are neighbors of the cell 100 that are also border cells of at least one network slice.

[0148] Thus, in this example, cell 72c would be identified as a border cell of a network slice consisting of tracking areas 72, 74, and a border cell of a network slice consisting of tracking areas 72, 76. Similarly, cell 72e would be identified as a border cell of a network slice consisting of tracking areas 72, 74, and a border cell of a network slice consisting of tracking areas 72, 74 and 72, 76.

[0149] Thereafter, the self-healing algorithm 90 will identify the at least one network slice.

[0150] Thus, a network slice consisting of tracking areas 72 , 74 and a network slice consisting of tracking areas 72 , 76 will be identified by the self-healing algorithm 90 .

[0151] After identifying at least one network slice, the self-healing algorithm 90 will identify the border cells of the at least one network slice.

[0152] In order to identify the border cells of the at least one network slice, a neighbor list of cells in the at least one network slice may be used. Specifically, in this embodiment, for a plurality of individual cells in the coverage area of ​​the at least one network slice, a neighbor cell list of the individual cell is compared with a complete list of cells in the coverage area of ​​the at least one network slice. If one or more cells appearing in the neighbor cell list do not appear in the cell list in the coverage area of ​​the at least one network slice, it may be determined that the cell defines at least a portion of the boundary of the coverage area of ​​the at least one network slice. In some embodiments, the following steps are performed for each individual cell in the coverage area of ​​the at least one network slice: (a) comparing the neighbor cell list of the individual cell with the complete list of cells in the coverage area of ​​the at least one network slice, and (b) if one or more cells appearing in the neighbor cell list do not appear in the cell list in the coverage area of ​​the at least one network slice, it is determined that the individual cell defines at least a portion of the boundary of the coverage area of ​​the at least one network slice. Based on the determination of each individual cell in the coverage area of ​​the at least one network slice, the border cells of the at least one network slice may be identified.

[0153] Thus, a distinction is made between cells that define the network slice boundaries and cells that are not part of the network slice boundaries.

[0154] In this embodiment, the cells defining the boundaries of the network slice consisting of tracking areas 72, 74 will be identified as cells 72a, 72b, 72c, 72e, 72h, 72i, 72j, 74a, 74b, 74c, 74f, 74h, 74i and 74j.

[0155] The cells defining the boundaries of the network slice consisting of tracking areas 72, 76 will be identified as cells 72a, 72c, 72e, 72h, 76a, 76c, 76d, 76g, 76h, 76i, 76f, 72i, 72f and 72b.

[0156] Finally, the self-healing algorithm 90 updates the record of the border cells of the network slice based on the changes in the cells active in the network. In the illustrated embodiment, the cells defining the boundaries of the network slice consisting of tracking areas 72, 74 will be cells 72a, 72b, 72c, 72e, 72h, 72i, 72j, 74a, 74b, 74c, 74f, 74h, 74i and 74j, which has not changed despite the addition of cell 100 to network 70. Similarly, the cells defining the boundaries of the network slice consisting of tracking areas 72, 76 have not changed. Thus, after cell 100 is added to network 70, the self-healing algorithm 90 will maintain a record of the border cells of the network slice consisting of tracking areas 72, 74 and 72, 76.

[0157] Thus, as in Figure 8 As shown in step 86 of the method, based on the change of active cells in the network, the record of the border cells of the network slice is updated.

[0158] It should be appreciated that in the illustrated embodiment, although cells (which are not border cells) are added to the network, the records of the border cells are not changed.

[0159] Fig.11 The addition of a new cell 110, which is a border cell, to the network 70 is illustrated. The new cell 110 is added to the tracking area 72.

[0160] As described above, the self-healing algorithm 90 maintains a record of the border cells of the network slices within the network 70.

[0161] Thus, if Figure 8 As shown in step 82 of the method, a record of the border cells of the network slice is maintained.

[0162] After the cell 110 is added to the network 70 , the cell management function 94 will inform the self-healing algorithm 90 that a cell has been added to the network 70 .

[0163] Thus, as in Figure 8 As shown in step 84 of the method, a change in an active cell in the network is determined.

[0164] After determining by the self-healing algorithm 90 that a cell has been added to the network 70, the self-healing algorithm 90 will identify the neighbors of the newly added cell 110. For example, as part of its normal operation, the cell 110 may make measurements of nearby cells and may identify the neighbors of the cell 110 based on these measurements. Alternatively or additionally, if in performing Figure 8 If the neighbor cell list of cell 110 already exists when the method is used, the pre-existing neighbor cell list can be used.

[0165] In this embodiment, the neighbors of cell 110 would be identified as cells 72d, 72f, 74b, and 74e.

[0166] After this, the self-healing algorithm 90 will then identify which of the identified neighbors of the cell 110 are border cells of at least one network slice.

[0167] For example, a record of border cells of a network slice may be used to identify which identified neighbors of cell 110 are border cells of at least one network slice.

[0168] Specifically, the previously obtained record of cells that are border cells of at least one network slice is compared with the neighbor list of the newly added cell 110. The cells that appear on both lists are neighbors of the cell 110 that are also border cells of at least one network slice.

[0169] Thus, in this example, cell 72b would be identified as a border cell of a network slice consisting of tracking areas 72, 74, and would be identified as a border cell of a network slice consisting of tracking areas 72, 76. Cell 74b would be identified as a border cell of a network slice consisting of tracking areas 72, 74, and would be identified as a border cell of a network slice consisting of tracking areas 74, 76. Cell 72f would be identified as a border cell of a network slice consisting of tracking areas 72, 76. Cell 74e would be identified as a border cell of a network slice consisting of tracking areas 72, 76.

[0170] Thereafter, the self-healing algorithm 90 will identify the at least one network slice.

[0171] Thus, in this example, the network slice consisting of tracking areas 72 , 74 , the network slice consisting of tracking areas 72 , 76 , and the network slice consisting of tracking areas 74 , 76 will all be identified by the self-healing algorithm 90 .

[0172] After identifying at least one network slice, the self-healing algorithm 90 will identify the border cells of the at least one network slice.

[0173] In order to identify the border cells of the at least one network slice, a neighbor list of cells in the at least one network slice may be used. Specifically, in this embodiment, for a plurality of individual cells in the coverage area of ​​the at least one network slice, a neighbor cell list of the individual cell is compared with a complete list of cells in the coverage area of ​​the at least one network slice. If one or more cells appearing in the neighbor cell list do not appear in the cell list in the coverage area of ​​the at least one network slice, it may be determined that the cell defines at least a portion of the boundary of the coverage area of ​​the at least one network slice. In some embodiments, the following steps are performed for each individual cell in the coverage area of ​​the at least one network slice: (a) comparing the neighbor cell list of the individual cell with the complete list of cells in the coverage area of ​​the at least one network slice, and (b) if one or more cells appearing in the neighbor cell list do not appear in the cell list in the coverage area of ​​the at least one network slice, it is determined that the individual cell defines at least a portion of the boundary of the coverage area of ​​the at least one network slice. Based on the determination of each individual cell in the coverage area of ​​the at least one network slice, the border cells of the at least one network slice may be identified.

[0174] Thus, a distinction is made between cells that define the network slice boundaries and cells that are not part of the network slice boundaries.

[0175] In this embodiment, the cells defining the boundaries of the network slice consisting of tracking areas 72, 74 will be identified as cells 72a, 72b, 72c, 72e, 72h, 72i, 72j, 74a, 74b, 74c, 74f, 74h, 74i and 74j.

[0176] The cells defining the boundaries of the network slice consisting of tracking areas 72, 76 will be identified as cells 72a, 72c, 72e, 72h, 76a, 76c, 76d, 76g, 76h, 76i, 76f, 72i, 72b and 110. Cell 110 is identified as a border cell of the network slice because it has neighbors that are not in the network slice, namely cells 74b and 74e.

[0177] The cells defining the boundaries of the network slice consisting of tracking areas 74, 76 will be identified as cells 74a, 74b, 74e, 74i, 76e, 76b, 76a, 76c, 76d, 76g, 76h, 76i, 74h, 74f and 74c.

[0178] Finally, the self-healing algorithm 90 updates a record 96 of the border cells of the network slice based on the changes in cells active in the network. In the illustrated embodiment, the cells defining the boundaries of the network slice consisting of tracking areas 72, 74 would be cells 72a, 72b, 72c, 72e, 72h, 72i, 72j, 74a, 74b, 74c, 74f, 74h, 74i, and 74j, which has not changed despite the addition of cell 110 to network 70. Thus, after cell 110 is added to network 70, the self-healing algorithm 90 will maintain this record of the border cells of the network slice consisting of tracking areas 72, 74.

[0179] Although cell 110 is added to network 70, the cells defining the boundaries of the network slice consisting of tracking areas 74, 76 are also unchanged. Thus, after cell 110 is added to network 70, self-healing algorithm 90 will maintain this record of the border cells of the network slice consisting of tracking areas 74, 76.

[0180] However, the cells defining the boundaries of the network slice consisting of tracking areas 72, 76 are cells 72a, 72c, 72e, 72h, 76a, 76c, 76d, 76g, 76h, 76i, 76f, 72i, 72b, and 110. Previously, the cells defining the boundaries of the network slice consisting of tracking areas 72, 76 were cells 72a, 72c, 72e, 72h, 76a, 76c, 76d, 76g, 76h, 76i, 76f, 72i, 72b, and 110. Thus, based on the addition of cell 110 to network 70, self-healing algorithm 90 will update record 96 of the border cells of the network slice consisting of tracking areas 72, 76.

[0181] Thus, as in Figure 8 As shown in step 86 of the method, based on the change of active cells in the network, the record of the border cells of the network slice is updated.

[0182] It will be appreciated that in this illustrated embodiment, after a cell (which is not a border cell) is added to the network, the record of the border cells has changed. Specifically, the record of the border cells of the network slice consisting of tracking areas 72, 76 has changed, while the record of the border cells of the network slice consisting of tracking areas 72, 74 and 74, 76 has been maintained.

[0183] Fig.12 The removal of cell 72j from the network 70 is illustrated, which is a border cell.

[0184] As described above, the self-healing algorithm 90 maintains a record of the border cells of the network slices within the network 70.

[0185] Thus, if Figure 8As shown in step 82 of the method, a record of the border cells of the network slice is maintained.

[0186] After deciding to remove cell 72j, the cell management function 94 will inform the self-healing algorithm 90 that a cell will be or has been removed from the network 70.

[0187] Thus, as in Figure 8 As shown in step 84 of the method, a change in an active cell in the network is determined.

[0188] After the self-healing algorithm 90 has thus determined that a cell is to be or has been removed from the network 70, the self-healing algorithm 90 will identify cells that are or were neighbors of the removed cell 72j. For example, measurements that have previously been made by cell 72j of nearby cells (which may have been made as part of normal operation of the cell) may be used, and the neighbors of cell 72j may be identified based on these measurements. For example, if in performing Figure 8 When the method is used, if a neighbor cell list of cell 72j exists, this pre-existing neighbor cell list can be used.

[0189] In this embodiment, the neighbors of cell 72j would be identified as cells 72g, 72h, 72i, 76b, 76c, and 76e.

[0190] After this, the self-healing algorithm 90 will then identify which of the identified neighbors of the cell 72j are border cells of at least one network slice.

[0191] For example, a record of border cells of a network slice can be used to identify which identified neighbors of cell 72j are border cells of at least one network slice.

[0192] Specifically, the previously obtained record of cells that are border cells of at least one network slice is compared with the neighbor list of the removed cell 72j. The cells that appear on both lists are neighbors of the cell 72j, which are also border cells of at least one network slice.

[0193] Thus, in this example, cell 72h will be identified as a border cell of the network slice consisting of tracking areas 72, 74, and will be identified as a border cell of the network slice consisting of tracking areas 72, 76. Cell 72i will be identified as a border cell of the network slice consisting of tracking areas 72, 74, and will be identified as a border cell of the network slice consisting of tracking areas 72, 76. Cell 76b will be identified as a border cell of the network slice consisting of tracking areas 72, 76. Cell 76c will be identified as a border cell of the network slice consisting of tracking areas 74, 76, and will be identified as a border cell of the network slice consisting of tracking areas 72, 76. Cell 76e will be identified as a border cell of the network slice consisting of tracking areas 74, 76, and will be identified as a border cell of the network slice consisting of tracking areas 72, 76.

[0194] Thereafter, the self-healing algorithm 90 will identify the at least one network slice.

[0195] Thus, a network slice consisting of tracking areas 72 , 74 , a network slice consisting of tracking areas 72 , 76 , and a network slice consisting of tracking areas 74 , 76 will be identified by the self-healing algorithm 90 .

[0196] After identifying at least one network slice, the self-healing algorithm 90 will identify the border cells of the at least one network slice.

[0197] In order to identify the border cells of the at least one network slice, a neighbor list of cells in the at least one network slice may be used. Specifically, in this embodiment, for a plurality of individual cells in the coverage area of ​​the at least one network slice, a neighbor cell list of the individual cell is compared with a complete list of cells in the coverage area of ​​the at least one network slice. If one or more cells appearing in the neighbor cell list do not appear in the cell list in the coverage area of ​​the at least one network slice, it may be determined that the cell defines at least a portion of the boundary of the coverage area of ​​the at least one network slice. In some embodiments, the following steps are performed for each individual cell in the coverage area of ​​the at least one network slice: (a) comparing the neighbor cell list of the individual cell with the complete list of cells in the coverage area of ​​the at least one network slice, and (b) if one or more cells appearing in the neighbor cell list do not appear in the cell list in the coverage area of ​​the at least one network slice, it is determined that the individual cell defines at least a portion of the boundary of the coverage area of ​​the at least one network slice. Based on the determination of each individual cell in the coverage area of ​​the at least one network slice, the border cells of the at least one network slice may be identified.

[0198] Thus, a distinction is made between cells that define the boundaries of a network slice and cells that do not define the boundaries of a network slice.

[0199] In this embodiment, the cells defining the boundaries of the network slice consisting of tracking areas 72, 74 will be identified as cells 72a, 72b, 72c, 72e, 72g, 72h, 72i, 74a, 74b, 74c, 74f, 74h, 74i and 74j.

[0200] The cells defining the boundaries of the network slice consisting of tracking areas 72, 76 will be identified as cells 72a, 72c, 72e, 72h, 76a, 76c, 76d, 76g, 76h, 76i, 76f, 72i, 72f and 72b.

[0201] The cells defining the boundaries of the network slice consisting of tracking areas 74, 76 will be identified as cells 74a, 74b, 74e, 74i, 76e, 76b, 76a, 76c, 76d, 76g, 76h, 76i, 74h, 74f and 74c.

[0202] Finally, the self-healing algorithm 90 updates a record 96 of the border cells of the network slice based on the changes in the cells active in the network. In this illustrated embodiment, the cells defining the boundaries of the network slice consisting of tracking areas 72, 76 and the cells defining the boundaries of the network slice consisting of tracking areas 74, 76 have not changed, despite the removal of cell 72j from the network 70. Thus, the self-healing algorithm 90 will maintain a record of the border cells of the network slice consisting of tracking areas 72, 76; and will maintain a record of the border cells of the network slice consisting of tracking areas 74, 76 after the removal of cell 72j from the network 70.

[0203] However, as described above, the cells defining the boundaries of the network slice consisting of tracking areas 72, 74 are cells 72a, 72b, 72c, 72e, 72g, 72h, 72i, 74a, 74b, 74c, 74e, 74f, 74h, 74i, and 74j. Previously, the cells defining the boundaries of the network slice consisting of tracking areas 72, 76 were cells 72a, 72b, 72c, 72e, 72h, 72i, 72j, 74a, 74b, 74c, 74e, 74f, 74h, 74i, and 74j. Thus, the removed cell 72j is no longer a border cell of the network slice, while the cell 72g, which was not a border cell previously, has become a border cell. In response, after removing cell 72j from the network 70, the self-healing algorithm 90 will update the record of the border cells of the network slice consisting of tracking areas 72, 74.

[0204] Thus, as in Figure 8As shown in step 86 of the method, based on the change of active cells in the network, the record 96 of the border cells of the network slice is updated.

[0205] It should be understood that in this illustrated embodiment, after a cell (which is not a border cell) is removed from the network, the record of the border cells has changed. Specifically, the record of the border cells of the network slice consisting of tracking areas 72, 74 has changed, while the record of the border cells of the network slice consisting of tracking areas 72, 76 and 74, 76 has been maintained.

[0206] Fig.13 Illustrated is the removal of cell 72d from network 70, which is not a border cell.

[0207] As described above, the self-healing algorithm 90 maintains a record of the border cells of the network slices within the network 70.

[0208] Thus, if Figure 8 As shown in step 82 of the method, a record of the border cells of the network slice is maintained.

[0209] After deciding to remove the cell 72d, the cell management function 94 will inform the self-healing algorithm 90 that a cell will be or has been removed from the network 70.

[0210] Thus, as in Figure 8 As shown in step 84 of the method, a change in active cells in the network is determined.

[0211] After the self-healing algorithm 90 has thus determined that a cell will be or has been removed from the network 70, the self-healing algorithm 90 will identify the neighbors of the removed cell 72d. For example, measurements that have previously been made by the cell 72d of nearby cells (which may have been made as part of the normal operation of the cell) may be used, and the neighbors of the cell 72d may be identified based on these measurements. For example, if in performing Figure 8 When the method is used, if a neighbor cell list of cell 72d exists, this pre-existing neighbor cell list can be used.

[0212] In this embodiment, the neighbors of cell 72d would be identified as cells 72a, 72b, 72c, 72e, 72f, and 72g.

[0213] After this, the self-healing algorithm 90 will then identify which of the identified neighbors of the cell 72d are border cells of at least one network slice.

[0214] For example, a record of border cells of a network slice can be used to identify which identified neighbors of cell 72d are border cells of at least one network slice.

[0215] Specifically, the previously obtained record of cells that are border cells of at least one network slice is compared with the neighbor list of the removed cell 72d. The cells that appear on both lists are neighbors of the cell 72d, which are also border cells of at least one network slice.

[0216] Thus, in this example, cells 72a, 72b, 72c, and 72e will be identified as removed cells or neighboring cells that are also border cells of the network slice consisting of tracking areas 72, 74, and will also be identified as a border cell of the network slice consisting of tracking areas 72, 76. Cell 72f will be identified as a neighbor of a removed cell that is also a border cell of the network slice consisting of tracking areas 72, 76.

[0217] Thereafter, the self-healing algorithm 90 will identify the at least one network slice.

[0218] Thus, a network slice consisting of tracking areas 72 , 74 and a network slice consisting of tracking areas 72 , 76 will be identified by the self-healing algorithm 90 .

[0219] After identifying at least one network slice, the self-healing algorithm 90 will identify the border cells of the at least one network slice.

[0220] In order to identify the border cells of the at least one network slice, a neighbor list of cells in the at least one network slice may be used. Specifically, in this embodiment, for a plurality of individual cells in the coverage area of ​​the at least one network slice, a neighbor cell list of the individual cell is compared with a complete list of cells in the coverage area of ​​the at least one network slice. If one or more cells appearing in the neighbor cell list do not appear in the cell list in the coverage area of ​​the at least one network slice, it may be determined that the cell defines at least a portion of the boundary of the coverage area of ​​the at least one network slice. In some embodiments, the following steps are performed for each individual cell in the coverage area of ​​the at least one network slice: (a) comparing the neighbor cell list of the individual cell with the complete list of cells in the coverage area of ​​the at least one network slice, and (b) if one or more cells appearing in the neighbor cell list do not appear in the cell list in the coverage area of ​​the at least one network slice, it is determined that the individual cell defines at least a portion of the boundary of the coverage area of ​​the at least one network slice. Based on the determination of each individual cell in the coverage area of ​​the at least one network slice, the border cells of the at least one network slice may be identified.

[0221] Thus, a distinction is made between cells that define the boundaries of a network slice and cells that do not define the boundaries of a network slice.

[0222] In this embodiment, the cells defining the boundaries of the network slice consisting of tracking areas 72, 74 will be identified as cells 72a, 72b, 72c, 72e, 72h, 72i, 72j, 74a, 74b, 74c, 74f, 74h, 74i and 74j.

[0223] The cells defining the boundaries of the network slice consisting of tracking areas 72, 76 will be identified as cells 72a, 72c, 72e, 72h, 76a, 76c, 76d, 76g, 76h, 76i, 76f, 72i, 72f and 72b.

[0224] Finally, the self-healing algorithm 90 updates the record of the border cells of the network slice based on the changes in the active cells in the network. In this illustrated embodiment, the cells defining the boundaries of the network slice consisting of tracking areas 72, 74 and the cells defining the boundaries of the network slice consisting of tracking areas 72, 76 have not changed, although cell 72d has been removed from the network 70. Thus, the self-healing algorithm 90 will maintain a record of the border cells of the network slice consisting of tracking areas 72, 74; and after removing cell 72d from the network 70, it will maintain a record of the border cells of the network slice consisting of tracking areas 72, 76.

[0225] Thus, as in Figure 8 As shown in step 86 of the method, based on the change of active cells in the network, the record 96 of the border cells of the network slice is updated.

[0226] It should be appreciated that in this illustrated embodiment, although a cell (which is not a border cell) is removed from the network, the record of the border cell is not changed.

[0227] Thus, in Figures 10 to 13 In the illustrated embodiment, the record of border cells is self-maintaining despite changes in network coverage. Figure 8 The result of the method is a real-time record of border cells that reflects all changes to the radio coverage of the network during the lifetime of a network slice (or other restricted coverage area) in the network, regardless of the reasons for these changes (e.g., changing network capacity, energy efficiency requirements).

[0228] Thus, a method is provided that is capable of updating border cell records of a network slice based on changes in active cells in the network.

[0229] Fig.14A network node 140 is illustrated, which stores, for at least one cell, a policy 142 for a network slice in which the cell is a boundary cell, and a policy 144 for a network slice in which the cell is not a boundary cell. The policies 142, 144 may include policies and control mechanisms specific to NW slices. These policies may involve issues such as admission control, congestion control, mobility, and energy efficiency.

[0230] Then, if Figure 5 As shown in step 64 of the method, the operation of the cell is adjusted according to whether the cell defines at least a portion of the boundaries of the coverage area of ​​the network slice.

[0231] As described above, the network node 140 may be a radio node that provides services to a particular cell. In this case, the policies 142, 144 may relate to the operation of the network node and the cell, or to the services provided to the UE device as the serving cell.

[0232] Additionally, or alternatively, the network node 140 may be a control node for controlling one or more radio nodes. In this case, the policies 142, 144 may relate to the operation of the radio nodes and / or the services provided to UE devices whose serving cell is one of the cells covered by those radio nodes.

[0233] One way in which the information covering the boundary cells can be used is to never turn off the border cells for energy efficiency. Thus, the operation of the cell, and therefore the operation of the network node in the form of a radio node serving the cell, can be controlled by the radio node itself or by an appropriate control node. It can be determined whether the cell served by the radio node is a boundary cell of one or more network slices. If the cell is not a boundary cell of any network slice, the radio node can be powered off to save energy if one or more criteria are met. This is a known feature of radio nodes. However, if the cell is a boundary cell of one or more network slices, the radio node can remain powered on even if one or more criteria are met. Thus, in order to improve the overall network operation, the boundary cells are treated differently.

[0234] One way to use the information of coverage boundary cells is to adjust the services provided to UE devices. The services provided in non-boundary cells can be the same as in the existing network, while the services provided in boundary cells can be adapted to optimize throughput and protect the service level agreement of the services associated with the NW slice.

[0235] An example of this involves admission control.

[0236] In a first scenario, a first UE, UE111, does not use network slicing and is connected to a cell outside the coverage area of ​​network slice NWS1, while a second UE, UE112, uses network slice NWS1 and is connected to a cell within the coverage area of ​​network slice NWS1. Both UEs, UE111 and UE112, are requesting admission to cell C11, which is within the coverage area of ​​network slice NWS1 but is not a boundary cell of network slice NWS1. In this scenario, when only one of the two UEs is admitted to cell C11 (e.g., because of cell loading), existing strategies are applied to determine which of the two UEs will be admitted to cell C11. Reference Fig.14 , the strategy applied is 144, which is applied to the network slice where the cell is not a boundary cell.

[0237] In the second scenario, the first UE, UE121, does not use network slicing and is connected to a cell outside the coverage area of ​​network slice NWS1, while the second UE, UE122, uses network slice NWS1 and is connected to a cell within the coverage area of ​​network slice NWS1. Both UEs, UE121 and UE122, are requesting admission to cell C12, which is in the coverage area of ​​network slice NWS1 and is a boundary cell of network slice NWS1. In this scenario, when only one of the two UEs is admitted to cell C12 (for example, because of cell loading), an adjusted policy is applied to determine which of the two UEs will be admitted to cell C11. Reference Fig.14 , the strategy applied is 142, which is applied to the network slice where the cell is a boundary cell.

[0238] The adjusted policy 142 may be such that it gives more preference to the UE 122 that is requesting admission to the bounded cell than to the UE 112 that had requested admission to the non-bounded cell in the first scenario.

[0239] Another example of service regulation in boundary cells involves handover.

[0240] In this case, in the first case, if Fig.15 As shown, the first UE, UE211, is using services associated with network slice NWS2 and is connected to cell C21 within the coverage area of ​​network slice NWS2. The second UE, UE212, is not associated with any network slice but is also connected to cell C21. Cell C21 is within the coverage area of ​​network slice NWS2 but is not a boundary cell of network slice NWS2. If both UE211 and UE212 are located near the cell edge of cell C21 and the load in the cell increases, existing strategies are applied to determine which of the two UEs will switch from cell C21. Reference Fig.14, the strategy applied is 144, which is applied to the network slice where the cell is not a boundary cell.

[0241] In the second case, if Fig.16 As shown, the first UE, UE221, is using services associated with network slice NWS2 and is connected to cell C22 within the coverage area of ​​network slice NWS2. The second UE, UE222, is not associated with any network slice, but is also connected to cell C22. Cell C22 is within the coverage area of ​​network slice NWS2, but it is a boundary cell of network slice NWS2. If UE221 and UE222 are both located near the cell edge of cell C22 and the load in the cell increases, an adjusted strategy is applied to determine which of the two UEs will switch from cell C22. Reference Fig.14 , the strategy applied is 142, which is applied to the network slice where the cell is a boundary cell.

[0242] The adjusted policy 142 may be such that it gives more preference to allowing UE UE221 to remain connected to its current serving cell because it is a boundary cell, compared to allowing UE UE212 to remain connected to its serving cell (which is a non-boundary cell) in the first scenario. This helps to avoid situations where the UE's service level agreement is violated because the UE is handed over.

[0243] A third example of service regulation in a boundary cell involves handover. Fig.17 As shown, two UEs, UE311 and UE312, are served by the same cell C31. The first UE, UE311, is using services associated with network slice NWS3, and cell C31 is within the coverage area of ​​network slice NWS2. Specifically, cell C31 is a boundary cell of network slice NWS3. The second UE, UE312, may not be associated with any network slice. However, if UE312 is using services associated with a different network slice NWS4, and cell C31 is within the coverage area of ​​network slice NWS4 and is a non-boundary cell of network slice NWS4, the same scenario applies.

[0244] If the load conditions in cell C31 require handover, both UE311 and UE312 are potential handover candidates, and for the purposes of this example it is assumed that the target cell is in each case a cell outside the coverage area of ​​network slice NWS3. A regulated policy is applied to determine which of the two UEs will be handed over from cell C31. Fig.14, is the policy 144 applied to UE312 applied to the network slice where the cell is not a boundary cell, regardless of whether UE312 is associated with any network slice, or whether UE312 is using a service associated with network slice NWS4, and cell C31 is a non-boundary cell of network slice NWS4. Again refer to Fig.14 , is the policy 142 applied to UE 311 applied to the network slice where the cell is a boundary cell. Typically, the result will be that UE 311 will not be handed over to a cell outside the coverage area of ​​the network slice, while UE 312 can be handed over.

[0245] Thus, in these examples, determining which cells form part of the coverage boundary of a network slice enables policies such as admission, congestion and mobility policies and control mechanisms to be optimized in a specialized manner for that cell type in order to ensure service level agreement (SLA) compliance for all slices and their associated services within the desired coverage area.

[0246] Furthermore, in the case where the record of the border cells of the network slice has been updated after a change of active cells in the network, these above-mentioned optimizations will be based on a near real-time record of the border cells of the network. Thus, the optimization will be based on the record of the border cells of the network slice, where the record is more accurate. An additional advantage is that the SLA coverage aspects of the service (over the lifecycle of the service) will have an increased probability of being achieved at the network slice border. Additionally, since the record of the border cells of the network slice is updated as a result of a change of active cells in the network, the network itself is configured in a flexible and optimal way for all the services it supports. This is in line with the self-learning requirements of 5G.

[0247] It should be understood that although the present disclosure focuses on one particular cell radio aspect, namely network slicing, the methods described herein can be applied to any logical entity within an operator network that uses any radio access technology to represent a restricted radio coverage area. For example, the logical entities "NRCellCU", "NRCellDU" and "NRSectorCarrier" defined in 3GPP TS 28.541 may also include records representing restricted coverage areas (which are established when the NW slice is instantiated), and the records may subsequently be maintained using methods substantially similar to those described above. Therefore, when network slicing is mentioned herein, the term "network slice" should be interpreted as covering any logical entity representing a restricted radio coverage area.

[0248] The methods of the present disclosure may be implemented in hardware, or as a software module running on one or more processors. These methods may also be performed according to the instructions of a computer program, and the present disclosure also provides a computer-readable medium having stored thereon a program for performing any of the methods described herein. The computer program embodying the present disclosure may be stored on a computer-readable medium, and in particular a tangible computer-readable medium, or it may be in the form of a signal (such as a downloadable data signal provided from an Internet website), for example, or it may be in any other form.

[0249] In some embodiments, the network node can be viewed as including: a maintenance module for maintaining a record of border cells of a network slice; a determination module for determining changes in active cells in the network; and an update module for updating the record of border cells of the network slice based on the changes in active cells in the network.

[0250] It should be noted that the examples mentioned above illustrate rather than limit the present disclosure, and that those skilled in the art will be able to design many alternative embodiments without departing from the scope of the appended claims. The word "comprising" does not exclude the presence of elements or steps different from those listed in the claims, "a" or "an" does not exclude a plurality, and a single processor or other unit may fulfill the functions of several units set forth in the claims. Any reference signs in the claims should not be construed as limiting their scope as such.

Claims

1. A method for monitoring a cell in a cellular communication network, the method comprising: Maintaining a record of border cells of at least one network slice; determining a change in an active cell in the network; and Based on the change in the cells active in the network, the record of the border cells of the at least one network slice is updated.

2. The method of claim 1, wherein: The step of determining a change of active cells in the network comprises receiving a notification that a cell has been added to or removed from the network.

3. The method according to claim 1 or 2, comprising: If it is determined that a cell has been added to the network, then: Identify the neighbors of the added cell; Identifying which of the identified neighbors of the added cell are border cells of at least one network slice; Identifying the at least one network slice; and If not all neighbors of the added cell belong to the identified slice, determining that the added cell is a border cell of the at least one network slice; and based on the determination, Perform an update operation.

4. The method according to claim 1 or 2, comprising: If it is determined that a cell has been added to the network, then: Identify the neighbors of the added cell; comparing the identified neighbors of the added cell with a list of cells in the coverage area of ​​the at least one network slice; If one or more cells present among the identified neighbors do not appear in the list of cells in the coverage area of ​​the at least one network slice, determining that the added cell defines at least a portion of the boundaries of the coverage area of ​​the at least one network slice; and based on the determination, Perform an update operation.

5. The method according to claim 1 or 2, comprising: If it is determined that a cell has been added to the network, then: Identify the neighbors of the added cell; Identifying which of the identified neighbors of the added cell are border cells of at least one network slice; Identifying the at least one network slice; and Identify a border cell of the at least one network slice, wherein the step of identifying the border cell of the at least one network slice comprises, for a plurality of cells in a coverage area of ​​the at least one network slice: comparing the neighbor cell list of the added cell with the list of cells in the coverage area of ​​the at least one network slice; If one or more cells appearing in the neighbor cell list do not appear in the list of cells in the coverage area of ​​the at least one network slice, determine that the added cell defines at least a portion of the boundaries of the coverage area of ​​the at least one network slice; and based on the determination, Perform an update operation.

6. The method according to claim 1 or 2, comprising: If it is determined that the cell has been removed from the network, then: Identify the neighbors of the removed cell; Identifying which of the identified neighbors of the removed cell are border cells of at least one network slice; Identifying the at least one network slice; and If not all neighbors of the removed cell belong to the identified slice, determining that the removed cell is a border cell of the at least one network slice; and based on the determination, Perform an update operation.

7. The method of claim 3, comprising: If it is determined that the cell has been removed from the network, then: Identify the neighbors of the removed cell; comparing the identified neighbors of the added cell with a list of cells in the coverage area of ​​the at least one network slice; If one or more cells present among the identified neighbors do not appear in the list of cells in the coverage area of ​​the at least one network slice, determining that the removed cell defines at least a portion of the boundaries of the coverage area of ​​the at least one network slice; and based on the determination, Perform an update operation.

8. The method according to claim 1 or 2, comprising: If it is determined that the cell has been removed from the network, then: Identify the neighbors of the removed cell; Identifying which of the identified neighbors of the removed cell are border cells of at least one network slice; Identifying the at least one network slice; and Identify a border cell of the at least one network slice, wherein the step of identifying the border cell of the at least one network slice comprises, for a plurality of cells in a coverage area of ​​the at least one network slice: comparing a list of neighbor cells of the removed cell with a list of cells in the coverage area of ​​the at least one network slice; If one or more cells appearing in the neighbor cell list do not appear in the list of cells in the coverage area of ​​the at least one network slice, determine that the removed cell defines at least a portion of the boundaries of the coverage area of ​​the at least one network slice; and based on the determination, Perform an update operation.

9. A network node for a cellular communication network, the network node comprising a processor and a memory, the memory containing instructions executable by the processor, wherein the memory operates to: Maintaining a record of border cells of at least one network slice; and in, The processor operates to: determining a change in an active cell in the network; as well as Based on the change in the cells active in the network, the record of border cells of at least one network slice is updated.

10. The network node according to claim 9, wherein: The processor is operative to determine a change in the cell that is active in the network by receiving a notification that a cell has been added to or removed from the network.

11. The network node according to claim 9 or 10, wherein: The processor operates to: If it is determined that a cell has been added to the network, then: Identify the neighbors of the added cell; Identifying which of the identified neighbors of the added cell are border cells of at least one network slice; Identifying the at least one network slice; and If not all neighbors of the added cell belong to the identified slice, determining that the added cell is a border cell of the at least one network slice; and based on the determination, Perform an update operation.

12. The network node of claim 9 or 10, wherein the processor is operative to: If it is determined that a cell has been added to the network: Identify the neighbors of the added cell; comparing the identified neighbors of the added cell with a list of cells in the coverage area of ​​the at least one network slice; If one or more cells present among the identified neighbors do not appear in the list of cells in the coverage area of ​​the at least one network slice, determining that the added cell defines at least a portion of the boundaries of the coverage area of ​​the at least one network slice; and based on the determination, Perform an update operation.

13. The network node of claim 9 or 10, wherein the processor is operative to: If it is determined that a cell has been added to the network: Identifying neighbors of the cell; Identifying which of the identified neighbors of the cell are border cells of at least one network slice; Identifying the at least one network slice; and identifying border cells of the at least one network slice by comparing a list of neighbor cells of the cell with a list of cells in a coverage area of ​​the at least one network slice; as well as if one or more cells appearing in the neighbor cell list do not appear in the list of cells in the coverage area of ​​the at least one network slice, determining that the cell defines at least a portion of the boundaries of the coverage area of ​​the at least one network slice; and based on the determination, Perform an update operation.

14. The network node of claim 9 or 10, wherein the processor is operative to: If it is determined that the cell has been removed from the network, then: Identify the neighbors of the removed cell; Identifying which of the identified neighbors of the removed cell are border cells of at least one network slice; Identifying the at least one network slice; and If not all neighbors of the removed cell belong to the identified slice, determining that the removed cell is a border cell of the at least one network slice; and based on the determination, Perform an update operation.

15. The network node of claim 11, wherein the processor is operative to: If it is determined that the cell has been removed from the network: Identify the neighbors of the removed cell; comparing the identified neighbors of the added cell with a list of cells in the coverage area of ​​the at least one network slice; If one or more cells present among the identified neighbors do not appear in the list of cells in the coverage area of ​​the at least one network slice, determining that the removed cell defines at least a portion of the boundaries of the coverage area of ​​the at least one network slice; and based on the determination, Perform an update operation.

16. The network node of claim 9 or 10, wherein the processor is operative to: If it is determined that the cell has been removed from the network, then: Identifying neighbors of the cell; Identifying which of the identified neighbors of the cell are border cells of at least one network slice; Identifying the at least one network slice; and identifying border cells of the at least one network slice by comparing a list of neighbor cells of the cell with a list of cells in a coverage area of ​​the at least one network slice; as well as if one or more cells appearing in the neighbor cell list do not appear in the list of cells in the coverage area of ​​the at least one network slice, determining that the cell defines at least a portion of the boundaries of the coverage area of ​​the at least one network slice; and based on the determination, Perform an update operation.

17. A tangible computer readable medium having stored thereon computer readable code which, when executed, causes a suitably programmed processor to perform the method of any one of claims 1 to 8.

Images