Method and related devices for slice remapping for trajectory awareness

Abstract

Embodiments of the present application relate to methods and apparatuses for trajectory-aware slice remapping. Methods and apparatuses for providing slice remapping based on a trajectory of a mobile device within a mobile telecommunication network are disclosed.

Description

Technical Field

[0001] This disclosure relates to the field of mobile telecommunications networks. Background Technology

[0002] This section introduces aspects that can help facilitate a better understanding of this disclosure. Therefore, the statements in this section should be read in this context and should not be construed as an admission of what is prior art or what is not prior art.

[0003] Network slicing is a key feature of telecommunications networks that use the same or similar underlying hardware and software infrastructure to support different services. In addition, network slices can differ based on: (1) their service requirements, for example, one slice may provide ultra-reliable low-latency communication (URLLC) services while another slice may provide enhanced mobile broadband (eMBB) services, or (2) the “tenants” (i.e., entities or organizations that utilize a particular network slice or segment of the telecommunications infrastructure) that provide such services.

[0004] A network slice (or "slice") is uniquely identified by its Single Network Slice Selection Auxiliary Information (S-NSSAI) in a fifth-generation (5G) network. In next-generation networks (e.g., sixth-generation (6G)), the same identifier, similar identifiers, or different identifiers may be used. The current 3GPP 5G specification allows a user equipment (UE) to connect to and be served by eight network slices simultaneously (i.e., associated with eight S-NSSAIs).

[0005] Furthermore, each physical telecommunications cell in a mobile network (e.g., an associated 5G or 6G access node, sometimes simply referred to as an "access node" or "network access node") can support dozens or even hundreds of slices. For example, in the current 5G specification, a tracking area (TA) consisting of logical packets of one or more cells served by an access node can support up to 1024 network slices, and can be further extended to support more slices with additional slice support information.

[0006] The S-NSSAI can include both a Slice Service Type (SST) field and a Slice Differentiator (SD) field, and has a total length of 32 bits. Alternatively, the S-NSSAI can include only the SST field, in which case the S-NSSAI is 8 bits long and can represent 256 discrete values. The SST field can include so-called normalized and non-normalized values. For example, values ​​0 to 127 are considered to be in the normalized SST range, where a value of 1 can indicate that the slice is suitable for handover to eMBB, and a value of 2 can indicate that the slice is suitable for handover to URLLC, etc. Non-normalized values ​​can be assigned based on specific mobile network operator configurations; that is, they can be operator-defined.

[0007] Conversely, the value of the SD field is also defined by the operator.

[0008] So-called “adjacent” NG radio access network (RAN) nodes within the same TA can exchange messages including slice support information via the so-called “Xn interface” using Xn Set-Up (e.g., when two access nodes first establish a connection) and NG RAN node configuration update procedures (e.g., for updating the configuration of RAN nodes).

[0009] More specifically, during the Xn interface and NG RAN node configuration update process, slice information (including S-NSSAI) is shared among access nodes to ensure, for example, that each neighboring access node is aware of the slice configuration supported (or being updated) by each other access node. This allows neighboring access nodes to coordinate, for example, mobility, handover, and load balancing, while preserving slice-specific requirements (such as service level agreements (SLAs) that may include QoS and latency).

[0010] Related to the TA is the "Registration Area" (RA). The RA is a list of TAs that support the same slice from the UE's perspective. When a UE registers with the core telecommunications network (referred to as the "core network"), the UE can send a registration message to the core network (CN) indicating the slices it may need to access and their corresponding S-NSSAIs. Typically, elements in the core network (e.g., elements configured to respond to registration messages and capable of performing 5G Access and Mobility Management (AMF) functions) can analyze (i.e., compare) the requesting UE's profile and the UE's corresponding subscription data to verify that the UE is entitled to access the complete list of slices it is requesting, and that the slice list is indeed supported by the TA indicated by the registration message (hereinafter referred to as the "current TA"). Subsequently, the responsible element within the core network sends a response message to the UE containing a second list, which includes identifiers of "allowed slices" and their corresponding allowed NSSAIs, which are a list of allowed S-NSSAIs. Therefore, the allowed slice list may differ from the requested slice list because, for example (1) the requested slice may be unavailable due to resource constraints, or (2) the requested slice may not be supported by the current TA that received the registration message from the UE.

[0011] Nevertheless, assuming the list of allowed slices contains at least one slice, one or more elements of the core network can then configure a Registered Area (RA) for the requesting UE. The configured RA contains one or more Transports (TAs) supporting all allowed slices for the UE. Furthermore, slice support information for each TA is exchanged between the access node and the core network (i.e., via NGAP procedures), such as the NG establishment procedure and the RAN configuration update procedure, where the NG is the interface between the access node and the core network. Based on this information, the core network can configure a list of at least one TA for the requesting UE, where slice support is homogeneous for the requesting UE (i.e., allowed slices supporting the UE are included in the configured RA). Once the UE leaves a TA in the RA, it needs to perform a Registered Area Update, during which the core network re-evaluates the slices requested by the UE to configure a new RA (or reconfigure a previous RA) if necessary.

[0012] It should be noted that the core network typically identifies and stores the locations of idle UEs (i.e., those UEs that are not actively sending or receiving data) that have previously completed the registration process (i.e., Registration Management (RM) - Registered status).

[0013] In idle mode, the UE typically remains in low-power idle mode until it is triggered, for example, until it is paged by the network.

[0014] Subsequently, the UE can receive network-originating service request messages from core network components (such as AMF components). Essentially simultaneously, the AMF also sends one or more messages to access nodes that are members of the TAs within the RA. Typically, the AMF can apply different paging strategies. One paging strategy allows the AMF to send messages to a subset of the TAs within the RA. For example, the UE might complete the RA update process last with its TA. This minimizes the number of TAs and their corresponding access nodes involved in the message exchange.

[0015] Therefore, it can be said that there is a trade-off between the size of a given RA and the paging volume required to complete such paging, and the number (frequency) of RA updates that the UE must complete. In other words, typically for an RA containing many TAs, fewer RA updates may be needed, but the RA may require more paging (and corresponding paging-related signaling), while for an RA containing fewer TAs, there are typically more RA updates, but fewer paging-related signaling is required. Furthermore, a smaller RA can reach the UE faster. Such a UE may be preferred for certain services where delay limits or constraints are imposed for efficiency.

[0016] Therefore, a UE that moves from one location to another and needs to support network slices associated with a large coverage area may be configured with an RA at its new location (or intermediate and / or final expected destination) that does not include all TAs previously supported by the slice, but only includes a limited set of TAs.

[0017] To enable data-driven operations and automated network management, the telecommunications industry (3GPP working group) has been exploring the integration of automation and data analytics as key features into networks (i.e., Network Data Analytics Function (NWDAF) and Management Data Analytics Service (MDAS)). These features can also be used for network slicing operations and optimization.

[0018] In addition, the industry has also explored artificial intelligence / machine learning (AI / ML). AI / ML processes (e.g., algorithms) can provide powerful tools to help telecom operators improve their network management and user experience by providing insights based on the autonomous analysis and processing of collected data.

[0019] To date, the integration of AI / ML has focused on the current NG RAN architecture and interfaces to enable AI support for 5G networks. The following information can be configured and is available for reporting by NG RAN nodes: -Predicted resource status information; -UE performance feedback; -Measured UE trajectory; - Energy cost (EC).

[0020] The industry has explored various solutions to achieve service continuity for mobile UEs through a process called slice remapping (hereinafter referred to as "remapping").

[0021] Existing remapping processes involve statically allocating slices using operation, administration, and maintenance (OAM) and network management system (NMS) characteristics embedded in one or more elements of the core network at each access node (such as the AMF). However, in static allocation, slice allocation is not dynamically adjusted in real time to account for changing network conditions or user requirements.

[0022] Remapping can be performed between the AMF and access nodes at a low granularity level (e.g., slice level), a high granularity level (e.g., Protocol Data Unit (PDU) level), or even a medium granularity level (e.g., at the UE level). More specifically, the granularity of the applied remapping strategy performed by the AMF and one or more access nodes (i.e., the degree to which remapping is controlled) can be as follows: Each slice (low-granularity level): Node-specific establishment / update procedures are used between core network elements (which can be configured by OAM (e.g., AMF)) and access nodes, as illustrated by the following exchange of electronic messages / instructions:

[0023] For example, "S-NSSAI 1" is the first original slice, S-NSSAI 2 is the second original slice, and traffic (data) initially directed to the first original slice can be remapped to slice 10 or 11, while traffic (data) initially directed to the second original slice can be remapped to slice 12 or 13. Therefore, for example, if the slice associated with the first original slice S-NSSAI 1 becomes overloaded, traffic can be dynamically remapped to slice 10 or 11, as specified in the remapped list above. This helps support load balancing and service continuity, ensuring that user services provided by access nodes continue during network congestion or slice outages.

[0024] For each UE (medium granularity level): for a given slice, even with signaling for the PDU sessions involved, the selection of possible remapped slices is a general strategy for the UE, as illustrated by the following exchange of electronic messages / commands:

[0025] For the first UE (UE-1), any PDU sessions associated with the first original slice S-NSAI 1 can be remapped to a slice identified by slice S-NSAI 10 or S-NSAI 11, and for the second UE (UE-2), any PDU sessions associated with the first original slice S-NSAI 1 can be remapped to a slice identified by slice S-NSAI 12 or S-NSAI 13. In summary, traffic initially mapped to S-NSAI 1 for both the first and second UEs can be redirected to one or more slices in the remapping list. The exact slice used (e.g., S-NSAI 10 or 11 for UE 1) can be selected based on additional factors such as load balancing, QoS requirements, or network congestion.

[0026] Therefore, at the UE level, it can be said that the network (i.e., the core network components) applies a general strategy to determine which slices are available for remapping, regardless of the specific PDU session involved.

[0027] For example, even if a PDU session (e.g., a video streaming session) signals its requirements (e.g., bandwidth or latency), the slices that can be used for remapping can be determined based on the overall policy of the entire UE. Therefore, slice remapping is managed by UE-specific policies, rather than being dynamically customized for individual PDU sessions.

[0028] Therefore, by exchanging such messages (or “mappings”), the core network can determine how to dynamically remap UE services (data) to alternative slices based on current core network conditions, service requirements, or policies. This enables the core network to apply and implement per-UE slice remapping policies to deliver and support specific customized services to each UE.

[0029] Each PDU session (high-level granularity): Slices are associated using the same principles as those used during the PDU session setup process, which can be illustrated by exchanging the following emails / instructions:

[0030] (a) For the first UE-1, PDU session 1 associated with the first original slice S-NSAI 1 can be remapped to a slice in a list containing slices S-NSAI 10 and S-NSAI 11; (b) For the first UE-1, PDU session 2 associated with the first original slice S-NSAI 1 can be remapped to a slice in a list containing slices S-NSAI 12 and S-NSAI 13; and (c) For the second UE-2, PDU session 3 associated with the original slice S-NSAI 1 can be remapped to a slice in a list containing slices S-NSAI 14 and S-NSAI 15.

[0031] Therefore, at the PDU session level, network elements perform and apply the slice remapping process previously used during the initial PDU session establishment process. More specifically, typically when a PDU session is established, a logical connection is established between the UE and the network element to establish one or more data streams for a specific service or application. PDU sessions can be associated with slices based on factors such as QoS requirements, service type, and network policies, to name just a few.

[0032] The “per PDU session” process enables the network to make fine-tuning adjustments during each PDU session based on the specific requirements or characteristics of a given session.

[0033] In another example, the remapping configuration can be set by OAM.

[0034] While the slice remapping process just described can be used, the 5G telecom industry has not yet adopted a standardized slice remapping process for the RAN, although there have been recent discussions about adopting one or more of the aforementioned processes. Nevertheless, for example, the 5G telecom industry has specified core network slice replacement due to network congestion.

[0035] When a UE moves from one location to another, remapping may be required. When a UE moves, it must electronically and commutatively “switch” from one mobile telecommunications cell area (hereinafter referred to as “cell”) to another cell in order to maintain active connectivity, continuity, or data sessions (e.g., when a UE is watching streaming video while moving from one cell to another).

[0036] 3GPP has released several proposals or concepts related to this type of UE movement. The proposal known as “Subsequent Cell Change” attempts to simplify continuous handover (HO) (introduced by 3GPP Release 18, hereinafter referred to as “Release 18”; ​​see Subsequent L1 / L2 Triggered Mobility (LTM) and Subsequent Conditional Primary / Secondary Cell Group (PSCell) Addition or Change (CPAC)).

[0037] Now for reference Figure 1A The diagram depicts a simplified illustration of UE 10 moving from the current or source cell 20a (hereinafter referred to as "source cell") and RA1 to the second or next cell 20b, and from RA2 to the final next cell 20n and RA3 (hereinafter collectively referred to as "n").

[0038] Although current slices 1 through 4 are supported by RA1 (see...) Figure 1B However, slice 2 is not supported by RA2, and slice 1 is not supported by RA3. Therefore, although existing research proposes remapping the current slice to another slice to ensure service / slice continuity of HO between two adjacent cells, the existing process does not address subsequent cell changes in a signaling-efficient manner.

[0039] Therefore, it is desirable to address and provide solutions to this remapping challenge. In particular, methods and related devices are provided to reduce or minimize signaling (e.g., non-access stratum (NAS) overhead) while also mitigating the risk of service disruption due to slice remapping. Summary of the Invention

[0040] This disclosure describes exemplary methods and related apparatus for considering the trajectories of one or more UEs during a remapping process. Therefore, such methods and apparatus may be referred to as trajectory-aware slice remapping methods and related apparatus.

[0041] For example, in one embodiment, a network device includes: at least one processor; and at least one memory storing instructions that, when executed by the at least one processor, cause the network device to: receive from a first neighboring access node an anticipated amount of authorized resources for a cell of the first neighboring access node for a first network slice within a first time period; receive from a second neighboring access node a handover request for a user equipment (UE) communicating with the second neighboring access node using a second network slice to move to communicate with the network device; receive from the second neighboring access node information indicating an anticipated trajectory of the UE toward the cell of the first neighboring access node; and, based on the anticipated trajectory and the anticipated amount of authorized resources for the first network slice received from the first neighboring access node, determine to remap the services of the UE from the second network slice to the first network slice.

[0042] Furthermore, the at least one processor can also execute stored instructions from the at least one memory to cause the network device to send a projected request for resources of the cell of the first neighboring access node for the first network slice during a second time period.

[0043] In an embodiment, the first time period may be equal to the second time period.

[0044] Furthermore, the at least one processor can also execute stored instructions from the at least one memory to cause the network device to: receive information from the second neighboring access node including one or more trajectories, each trajectories corresponding to one or more UEs served by the second neighboring access node that are using the second network slice and have an expected handover to the network device; use the received information to identify a subset of the one or more UEs that have a further expected handover to the cell of the first neighboring access node during the second time period; determine the expected amount of resources of the first network slice required in the cell of the first neighboring access node corresponding to the identified subset of UEs; and generate the expected resource request for the second time period based on the determined expected resource amount, and send the generated request to the first neighboring access node.

[0045] This disclosure also provides embodiments for more than one neighboring access node that can send information about UE trajectories to a network device (i.e., in addition to the second neighboring access node). In this case, at least one processor of the network device can also execute stored instructions from at least one memory to cause the network device to: receive information from each of one or more additional neighboring access nodes, the information including the trajectory of each of a plurality of UEs served by at least one of the one or more additional neighboring access nodes and having traffic associated with the second network slice and expected to be switched to the network device; based on the trajectories of an identified subset of the plurality of UEs, use the received information to identify a subset of the plurality of UEs expected to be further switched to the cell of the first neighboring access node during the second time period, and for the subset, the second network slice is expected to be switched to the cell of the first neighboring access node. The network device is remapped to the first network slice; a first expected resource amount of the first network slice required in the cell of the first neighboring access node is determined, the first expected resource amount corresponding to the services expected to be remapped for the subset identified by the UE during the second time period; based on the trajectory of the UE toward the cell of the first neighboring access node during the second time period, a second expected resource amount of the first network slice required in the cell of the first neighboring access node is determined, the second expected resource amount corresponding to the services expected to be remapped for the UE currently served by the network device; and the expected resource request is generated based at least on the estimated first and second expected resource amounts and the second time period.

[0046] In addition, one or more additional adjacent access nodes may include a second adjacent access node, and the UE may include one of a plurality of UEs.

[0047] In addition to performing remapping (or as part of it), at least one processor of the network device may also execute stored instructions from at least one memory to cause the network device to determine the expected trajectory of the UE toward the cell associated with the first neighboring access node. In embodiments, for example, an artificial intelligence (AI) model or a machine learning (ML) model may be used to determine the expected trajectory of the UE. When more than one UE is involved, at least one processor may also execute stored instructions from at least one memory to cause the network device to re-determine the expected trajectory of one or more UEs using the artificial intelligence (AI) model or the machine learning (ML) model.

[0048] Continuing, as part of the remapping process, at least one processor of the network device may also execute stored instructions from at least one memory to cause the network device to remap services from the UE from the second network slice to the first network slice.

[0049] Furthermore, the at least one processor of the network device can also execute stored instructions from the at least one memory to cause the network device to determine, based on at least one of the following, to remap the service from the UE from the second network slice to the first network slice: determining that the network device does not support the second network slice and is capable of remapping the service associated with the second network slice to at least the first network slice; determining, based on the expected trajectory of the UE, that the UE will communicate with the cell of the first adjacent access node and that the cell of the first adjacent access node supports the first network slice; and determining that the expected amount of licensed resources of the first network slice received from the first adjacent access node for the cell of the first adjacent access node will be able to accommodate the service of the UE.

[0050] In the above discussion, we mentioned (i) a network device, (ii) a first neighboring access node, (iii) a second neighboring access node, and (iv) an additional neighboring access node. In embodiments, each of these elements may include a 5G access node or a 6G access node.

[0051] To recap briefly, we noted above that the network device receives information including one or more trajectories of one or more UEs. Furthermore, in the embodiments, for each of the one or more UEs, the received information may include at least one of the following: an identifier of a Protocol Data Unit (PDU) session and a network slice identifier, a traffic or throughput indication, a maximum bit rate or guaranteed bit rate indication, and a list of cells or access nodes including the corresponding trajectory of the corresponding UE among the one or more UEs.

[0052] In addition to disclosing novel remapping processes and apparatus, this disclosure also provides a process that allows a network apparatus to share information (such as the intended UE trajectory) with other apparatuses (e.g., network access nodes).

[0053] For example, in one such embodiment, a network device includes: at least one processor; and at least one memory storing instructions, which, when executed by the at least one processor, cause the network device to: receive from one or more second neighboring access nodes information indicating the expected trajectory of each of a plurality of UEs served by at least one of the one or more second neighboring access nodes, wherein the expected trajectory of each of the plurality of UEs includes the network device; use the received information to identify one or more subsets of the plurality of UEs, each subset including one or more UEs of the plurality of UEs expected to communicate with at least a cell of a first neighboring access node using a corresponding network slice; and based on at least one subset of the one or more subsets, determine the expected resource load of a first network slice at least for the cell of the first neighboring access node, and send the determined expected resource load to the first neighboring access node.

[0054] Additionally, the at least one processor of the network device may also execute stored instructions from the at least one memory to cause the network device to: receive from the first neighboring access node a request for the expected resource load of at least the cell of the first neighboring access node for the first network slice, wherein the determined expected resource load sent is a response to the received request.

[0055] Based on the received information, at least one processor of such a network device can also execute stored instructions from at least one memory to enable the network device to determine the expected trajectory of each of a plurality of UEs served by at least one of one or more second adjacent access nodes based on the received information.

[0056] In some embodiments, artificial intelligence (AI) models or machine learning (ML) models may be used to determine the expected trajectory.

[0057] Similar to other embodiments, in this embodiment, at least one of the network device, the first adjacent access node, the second adjacent access node, or the additional access node may include, for example, a 5G access node or a 6G access node. Attached Figure Description

[0058] This disclosure is illustrated by way of example and is not limited to the accompanying drawings, wherein the same reference numerals indicate similar elements, and wherein: Figure 1A A simplified illustration depicts a UE moving from the source cell to the next cell.

[0059] Figure 1B Depicting by Figure 1A The network slices supported by RA are shown in the diagram.

[0060] Figure 2 The message flow exchanged between a source cell and a next cell according to embodiments of the present disclosure is described.

[0061] Figure 3 The disclosure also describes message flows exchanged between a source cell and a next cell according to exemplary embodiments thereof.

[0062] Figure 4 A simplified configuration of the UE's processor and memory is shown.

[0063] Figure 5 A simplified configuration of the processor and memory of the network device is shown.

[0064] Specific embodiments of this disclosure are illustrated herein with reference to various accompanying drawings and sketches. Descriptions and illustrations have been prepared to enhance understanding. Therefore, it should be understood that the networks depicted in the drawings do not represent actual networks, devices, or apparatuses, but are merely illustrative to explain the features of the disclosed methods and apparatus.

[0065] The aim is to provide both illustration and description in a simple and clear manner so as to effectively enable those skilled in the art to make, use, and best practice the exemplary embodiments described herein, based on what is known in the art. Those skilled in the art will understand that various modifications and changes may be made to the specific embodiments described herein without departing from the spirit and scope of this disclosure. Therefore, the text and drawings should be considered illustrative and exemplary rather than restrictive or all-encompassing, and modifications to the specific embodiments described herein are intended to be included within the scope of this disclosure. Detailed Implementation

[0066] The following detailed description describes exemplary embodiments and is not intended to limit it to the explicitly disclosed combinations. Therefore, unless otherwise stated, the embodiments disclosed herein may be combined to form additional combinations not shown for the sake of brevity.

[0067] As used herein and in the appended claims, the terms “comprising,” “including,” or variations thereof are intended to refer to non-exclusive inclusion, such that a process, method, article, apparatus, or device that includes a list of elements includes not only those elements in the list but may also include other elements not expressly listed or inherent to such process, method, article, or apparatus.

[0068] As used herein, the term “a” or “one” is defined as one or more. As used herein, the term “multiple” is defined as two or more. As used herein, the term “another” is defined as at least a second or more.

[0069] As used herein, the terms “include” and / or “have” are defined as including (i.e., open-ended language).

[0070] In the accompanying drawings, similar reference numerals are used consistently throughout the drawings to denote similar features.

[0071] Unless otherwise stated, the term "or" is used in this document in the sense of substitution and combination.

[0072] The terms “illustrative” and “exemplary” are used to indicate examples in this disclosure, not to indicate a level of quality.

[0073] As used herein, the term “user equipment” or “UE” means an apparatus that includes electronic components (e.g., modems) that function as radio frequency transceivers to wirelessly (i) transmit signals, messages and data to one or more elements (e.g., devices, apparatuses) of a mobile telecommunications network using an air interface, and (ii) receive signals, messages and data from one or more elements of the network using an air interface.

[0074] As used herein, where applicable, the use of the letters “a” and “n” in a phrase indicates the first and last element or step in a group of elements or steps, such as units 20a to 20n.

[0075] As used herein, the term “element” means: (a) an electronic hardware circuit implementation (e.g., an implementation in analog and / or digital circuitry) capable of performing one or more functions (such as network functions (NF) or user interface functions); and / or (b) a combination of electronic circuitry and a computer program product comprising software and / or firmware instructions stored on one or more electronic memories, the software and / or firmware instructions working together to cause an apparatus or device to perform one or more NF, UE, or method steps described herein; and / or (c) an electronic circuitry, such as, for example, an electronic microprocessor, a portion of a microprocessor, a processor, a portion of a processor, an electronic integrated circuit, or an electronic application processor (collectively referred to herein as a “processor”), which executes stored instructions (e.g., software or firmware) retrieved from at least one electronic memory, the instructions, when executed by the processor, causing the apparatus or element itself to perform one or more features, NF, UE, or method steps.

[0076] As used herein, the names “first,” “second,” “third,” and other relational terms (if any) are used only to distinguish one network or UE function, feature, or step from another, and do not necessarily require or imply any actual such relationship, order, or importance between these functions, features, or steps.

[0077] As used herein, the phrase "electronic memory" (referred to herein as "memory") means a non-transitory electronic storage medium (e.g., a volatile or non-volatile memory device). Examples of non-transitory electronic storage media include (but are not limited to): random access memory (RAM); programmable read-only memory (PROM); erasable programmable read-only memory (EPROM); flash EPROM; magnetic computer-readable media (e.g., floppy disk, hard disk, magnetic tape, any other magnetic medium); optical computer-readable media (e.g., compressed optical disc read-only memory (CD-ROM); digital versatile optical disc (DVD); Blu-ray disc (BD), etc., or combinations thereof), or any other non-transitory medium from which an electronic processor can retrieve stored instructions that, when executed, cause a device to perform one or more functions, features, or steps of a method or process.

[0078] Now for reference Figure 2 The diagram illustrates an exemplary message flow between cells 200a to 200n, which are part of the telecommunications core network 200. To illustrate the disclosed method, we refer to cell 200n as the "first neighboring access node" because it is a neighboring node of cell 200b. Furthermore, we refer to cell 200a (which is currently used as the source cell for UE 100) as the "second neighboring access node" of cell 200b.

[0079] Figure 2 The diagram also shows cells 300a to 300n and one or more associated additional neighboring access nodes, which will be discussed later.

[0080] In an embodiment, for example, the access nodes associated with each cell 200a to 200n and 300a to 300n may each include 5G or 6G access nodes.

[0081] For the reader's information, we can also refer to each access node within a given cell as a "network device." In this case, it should be understood that a given network device can be, for example, a 5G or 6G access node. For example, the access node is referred to as 6G node B (6GNB) in the diagram.

[0082] It should be understood that, although in Figure 2Only one UE 100 is shown, but in reality, cells 200a to 200n and cells 300a to 300n can support multiple UEs. Furthermore, although only three cells 200a, 200b, and 200n are shown, this is merely illustrative, and it should be understood that more than three cells may be involved in the telecommunications core network 200 and the disclosed methods. Additionally, it should be understood that messages may include one or more electronic signals, which may include instructions and data. Furthermore, the telecommunications core network 200 (hereinafter referred to as the "core network") may be, for example, a 5G core network or a 6G core network.

[0083] During steps 1a to 3a, cells 200a to 200n (e.g., network devices within each cell) have previously determined how to remap a particular network slice to one or more network slices supported by each cell.

[0084] Each network device (e.g., a 5G or 6G access node) associated with cells 200a to 200n may include at least one electronic processor and at least one electronic memory for storing instructions that, when executed by the at least one processor, cause each network device to perform one or more functions, features, or steps set forth herein. (For the reader's reference) Figure 5 This document illustrates a simplified configuration of an access node or network device including at least one processor 602 and at least one memory 603. For the sake of brevity and to avoid repetition, it should be understood that when the discussion herein indicates that a network device has performed a function, feature, or step, it should be understood that at least the processor 602 of the corresponding network device executes electronic instructions from its at least one memory 603, which have caused the device to perform those features, functions, and steps.

[0085] Furthermore, UE 100 may also include at least one electronic processor and at least one electronic memory for storing instructions that, when executed by the at least one processor, cause UE 100 (i.e., the apparatus) to perform certain functions, features, and steps described herein. For the reader's reference Figure 4 A simplified configuration of the processor 504 and memory 505 of UE 100 is shown. For the sake of brevity and to avoid repetition, it should be understood that when the discussion herein indicates that UE 100 has performed a function, feature, or step, it should be understood that at least the processor 504 of the corresponding UE executes electronic instructions from at least one of its memories 505, which have enabled the UE to perform those features, functions, and steps.

[0086] Continuing, in step 4a, the network device associated with cell 200b can receive information from the second neighboring access node 200a (i.e., at least the source node of UE 100) including one or more trajectories corresponding to one or more UEs (including UE 100) served by the second neighboring access node 200a. Furthermore, the one or more UEs have services associated with a second network slice supported by cell 200a, which are expected to be switched to cell 200b (e.g., switched to network devices within cell 200b).

[0087] More specifically, the information received by the network device in cell 200b from the second adjacent access node in cell 200a may include at least one or more of the following: (i) the identifier of the Protocol Data Unit (PDU) session of each of one or more UEs (including UE 100) and its associated network slice identifier; (ii) the traffic or throughput indication associated with each PDU session of one or more UEs; (iii) the maximum bit rate or guaranteed bit rate associated with the flow of the PDU session of one or more UEs; and (iv) a list of cells (or access nodes) including the corresponding trajectory of each of one or more UEs, wherein the cell list is associated with one or more access nodes.

[0088] Upon receiving such information, during step 5a, the network device associated with cell 200b (hereinafter referred to as the "network device", unless otherwise stated) may use the received information to identify a subset of one or more UEs that is expected to further switch to cell 200n of the first adjacent access node within a time period based on the trajectory of the identified subset of one or more UEs, and for that subset, the current second network slice (or multiple slices) supporting one or more UEs is expected to be remapped to the slice supported by the network device of cell 200b.

[0089] To distinguish the different network slices involved in the above steps, we can refer to one or more current slices supported by cell 200a as "second network slices" and the slices supported by cell 200n as "first network slices".

[0090] In an embodiment, the network device may determine a time period during which one or more UEs (including UE 100) are expected to be further switched to cell 200n and a second network slice (currently supported by cell 200a) is expected to be remapped to a first network slice supported by at least cell 200n. In an embodiment, the determination of the time period may be accomplished by artificial intelligence-based and machine learning-based instructions in the network device's memory.

[0091] After identifying a subset of one or more UEs that are expected to switch to cell 200b and then to cell 200n within the aforementioned time period based on their trajectories, the network device in cell 200b can then determine the expected amount of resources required in the cell of the first neighboring access node corresponding to the identified subset of UEs before switching the subset of UEs.

[0092] In this embodiment, the network device of cell 200b can perform two determinations for this purpose.

[0093] In its first determination, the network device in cell 200b considers a UE that is expected to switch from cell 200a to cell 200n. In its second determination, the network device considers a UE that it currently supports but can also switch to cell 200n.

[0094] Therefore, during step 5a, the first determination may involve estimating the expected amount of resources associated with the first network slice that may be needed in cell 200n (i.e., by the first neighboring access node associated with cell 200n) during the time period, the expected amount of resources corresponding to the services expected to be remapped (e.g., services expected to be remapped from the current slice (e.g., the second network slice or multiple slices) to the first network slice) of the identified subset of UEs, and the second determination may involve estimating a second expected amount of resources associated with the first network slice that may be needed in cell 200n (by the first neighboring access node) during the time period, the second expected amount of resources corresponding to the services expected to be remapped (services expected to be remapped to the first network slice) of UEs currently served or supported by the network device, the estimation being based on their trajectories toward cell 200n of the first neighboring access node during the time period.

[0095] Once the network device has completed the two determinations, it can generate a message including the expected resource request based on at least an estimated first and second expected resource amount during step 6a, and send the message to the first neighboring access node.

[0096] We pause here to rewind slightly and discuss one or more additional access nodes associated with cells 300a to 300n.

[0097] In this embodiment, the second neighboring access node associated with cell 200a may or may not be one of the additional neighboring access nodes associated with cells 300a to 300n. In this discussion, we immediately assume that the second neighboring access node is separate from the additional neighboring access nodes associated with cells 300a to 300n. However, the opposite may occur. In other words, one or more additional neighboring access nodes associated with cells 300a to 300n may include the second neighboring access node of cell 200a. Accordingly, UE 100 may also be included among multiple UEs served by additional neighboring access nodes associated with cells 300a to 300n that now include the second neighboring access node.

[0098] In this scenario, during step 4a, a network device within cell 200b can receive one or more messages via at least channel 301 from each of one or more additional neighboring access nodes associated with cells 300a to 300n, which includes a second neighboring access node within cell 200a. This information includes a trajectory of each of a plurality of UEs served by at least one of the one or more additional neighboring access nodes (including the second neighboring access node). Furthermore, the plurality of UEs have services associated with a second network slice supported by cell 200b, which is expected to be switched to cell 200b (e.g., to a network device within cell 200b).

[0099] Similar to the previous one, the information received by the network device within cell 200b may include one or more of the following: (i) the identifier of the PDU session of each of the multiple UEs and its associated network slice identifier, (ii) the service or throughput identifier associated with each PDU session of the multiple UEs, (iii) the maximum bit rate or guaranteed bit rate indication associated with the flow of the PDU session (PUE) of the multiple UEs, and (iv) a list of cells (or access nodes) including the corresponding trajectory of each of the multiple UEs, wherein the list of cells is associated with one or more access nodes.

[0100] Upon receiving such information, during step 5a, the network device in cell 200b can use the received information to identify a subset of multiple UEs in cell 200n that are expected to further switch to the first adjacent access node during the aforementioned time period, based on the trajectory of the identified subset of multiple UEs, and for this subset, it is expected to remap a second network slice (or multiple slices) supporting multiple UEs to a network slice (e.g., the first network slice) supported by at least the network device.

[0101] A subset of multiple UEs served by additional access nodes (including second adjacent access nodes) associated with cells 300a to 300n has been identified. These additional access nodes are expected to switch to cell 200b based on their trajectories during a first time period, and then eventually to cell 200n. The network device can then determine the amount of resources required in the cell of the first adjacent access node associated with cell 200n before switching this subset of candidate UEs.

[0102] In this embodiment, for this purpose, the network device associated with cell 200b can again perform the above two determinations based on a subset of newly identified UEs. Therefore, during step 5a, the network device can determine the expected amount of resources associated with the first network slice that may be needed in cell 200n (by the first neighboring access node), which corresponds to the services expected to be remapped (remapped from the current network slice (e.g., a second network slice or multiple second network slices) to the first network slice) for the newly identified subset of UEs during that time period. The second determination may involve estimating a second expected amount of resources associated with the first network slice needed in cell 200n by the first neighboring access node, which corresponds to the services expected to be remapped (remapped to the first network slice) for UEs currently served or supported by the network device during the aforementioned time period, based on their trajectory toward cell 200n towards the first neighboring access node.

[0103] Similarly, once the network device has completed the two determinations, it can generate a projected resource request based at least on the estimated first and second projected resource quantities during the time period in step 6a.

[0104] At this point, the network apparatus within cell 200b has determined one or more of the following: (i) the expected trajectory of a single UE (UE 100) toward cell 200n associated with a first neighboring access node; or (ii) the expected trajectory of one or more UEs when a source node associated with cell 200a is serving more than one UE; or (iii) the expected trajectory of multiple UEs when UE 100 and its second neighboring access node associated with cell 200a are considered to be among additional neighboring access nodes associated with cells 300a to 300n. Regardless of how the estimation is performed, in embodiments, in all three scenarios, the instructions stored in at least one memory of the network apparatus may include artificial intelligence-based and machine learning-based instructions. Therefore, in all three scenarios, at least one processor of the network device can execute artificial intelligence-based and machine learning-based instructions to estimate the expected trajectory of: (i) UE 100 toward cell 200n associated with the first adjacent access node, (ii) one or more UEs toward cell 200n associated with the first adjacent access node, or (iii) multiple UEs toward cell 200n associated with the first adjacent access node.

[0105] After completing one of the above methods and scenarios, during step 6a, the network device may send a message to cell 200n of the first adjacent access node, the message including a projected request for resources associated with the first network slice generated within the previously mentioned time period.

[0106] Subsequently, during step 7a, the network device associated with cell 200b may receive a message from cell 200n (and its associated first neighboring access node) that includes the estimated amount of authorized resources for cell 200n for the first neighboring access node in the first network slice at another, possibly different, time period. To distinguish this previously mentioned time period, we refer to this time period as the "first time period" and the previously mentioned time period as the "second time period".

[0107] In some example embodiments, step 6a and / or step 7a may not include time information, such as the time period explained above.

[0108] Furthermore, such messages may include whether cell 200n can handle the remapping of traffic supported by cell 200n from a second network slice to a first network slice. In one embodiment, the message may include an indication that the proposed remapping of the second network slice (currently supported by cell 200a) to the first network slice (currently supported by cell 200n) can continue. In another embodiment, the message may include an indication of the percentage of requested traffic that can be remapped. In yet another embodiment, the message may include an indication of the acceptable value of the requested traffic.

[0109] In an embodiment, for example, the determination of the two time periods can be accomplished by AI and ML processes.

[0110] It is worth noting that the time periods do not need to be the same, because the first neighboring access node associated with cell 200n may be affected by services from other UEs and neighboring access nodes that do not affect cells 200a and 200b. Nevertheless, in another embodiment, the first time period and the second time period can be the same length (i.e., the time periods are of equal length).

[0111] Subsequently, in step 8a, the network device may store the expected amount of authorized resources received during the first time period for the first network slice in its electronic memory.

[0112] At some point during step 9a, a network device in cell 200b may receive one or more messages from a second neighboring access node, including: a request to at least switch communication with a UE 100 communicating with the second neighboring access node associated with cell 200a, the UE 100 having services associated with the second network slice (“Switching Request”) to move to communicate with the network device; and information indicating the expected trajectory of the UE 100 toward cell 200n of the first neighboring access node (“Indicated Trajectory”). Therefore, in response, in step 10a, the network device may then determine, based on the Indicated Trajectory and the expected amount of authorized resources for the first network slice previously received and stored from cell 200n of the first neighboring access node, whether to remap services from the UE 100 associated with the second network slice to the first network slice. If it is determined that such a remapping may occur, the network device may actually remap services from the UE 100 associated with the second network slice to the first network slice.

[0113] More specifically, during step 10a, the network device may first determine, based on the following, whether to remap services from UE 100 (i.e., each UE expected to be switched over) associated with the second network slice to the first network slice: (a) determining that the network device within cells 200b and / or 200n does not support the second network slice but can still remap services associated with the second network slice to at least the first network slice; (b) determining that, based on the trajectory of the UE (i.e., each UE expected to be switched over, including UE 100), the UE will communicate with cell 200n of the first adjacent access node, and cell 200n of the first adjacent access node (i.e., cell 200n) supports the first network slice; and (c) determining that the expected amount of authorized resources received from cell 200n of the first adjacent access node (and for cell 200n of the first adjacent access node) for the first network slice will indeed accommodate the services of UE 100 (again, each UE expected to be switched over) currently associated with the second network slice when remapped to the first network slice by the network device.

[0114] In practice, steps 9a and 10a can be repeated for each of one or more UEs associated with the second network slice and served by cell 200a, these UEs are expected to be handed over to cell 200b and eventually to cell 200n and are expected to be associated with the first network slice supported by at least cell 200n. Additionally, steps 9a and 10a can be repeated for each of a plurality of UEs associated with the second network slice and served by additional neighboring access nodes associated with cells 300a to 300n, these additional neighboring access nodes are expected to be handed over to cell 200b and eventually to cell 200n and are expected to be associated with the first network slice supported by at least cell 200n.

[0115] Now for reference Figure 3 The diagram illustrates the message flow between cells 200a and 200n according to an embodiment of the present disclosure. Exemplarily, the access node is referred to as 6G Node B (6GNB) in the diagram.

[0116] During step 4b, a network device (e.g., a 5G or 6G access node) associated with cell 200b can receive one or more messages from one or more second neighboring access nodes (e.g., 5G or 6G access nodes) associated with cell 200a. These messages include information indicating the expected trajectory of each of a plurality of UEs (including UE 100) served by at least one of the one or more second neighboring access nodes associated with cell 200a (only one access node is shown for simplicity). In this embodiment, the expected trajectory of each of the plurality of UEs (including UE 100) includes the network device associated with cell 200b (hereinafter referred to as the "network device" unless otherwise stated).

[0117] In addition, the one or more UEs have services associated with one or more network slices supported by cell 200a, which are expected to be switched to cell 200b (e.g., switched to network devices within cell 200b).

[0118] As described above, during step 4b, the network device can determine (i.e., estimate) the trajectory of each of a plurality of UEs served by at least one of one or more second neighboring access nodes associated with cell 200a or another node. In one embodiment, at least one memory of the network device associated with cell 200b may include artificial intelligence-based and machine learning-based instructions that, when executed by its processor, cause the network device to estimate the expected trajectory of each of the plurality of UEs served by at least one of one or more second neighboring access nodes based on such AI and ML models.

[0119] The trajectory information received by the network device from the second adjacent access node may include at least one or more of the following: (i) the identifier of the PDU session of each of the one or more UEs (including UE 100) and its network slice identifier; (ii) the service or throughput indication associated with each PDU session of the one or more UEs; (iii) the maximum bit rate or guaranteed bit rate indication associated with the flow of the PDU session of the one or more UEs; and (iv) a list of cells (or access nodes) including the corresponding trajectory of each of the one or more UEs, wherein the cell list is associated with one or more access nodes.

[0120] Upon receiving such information, during step 5b, the network device associated with cell 200b may use the received information to identify one or more subsets of a plurality of UEs, each subset including one or more UEs that are intended to communicate with at least one cell 200n of a first adjacent access node (e.g., a 5G or 6G access node) using a corresponding network slice based on the received trajectory.

[0121] Subsequently, the network device associated with cell 200b may further complete the determination (e.g., estimation, prediction) of the load for each slice. More specifically, during step 5b, the network device may determine the expected telecommunications resource load for the first network slice of at least one cell 200n for the first adjacent access node, and send the determined expected resource load to the first adjacent access node for each corresponding slice in one or more slices supporting each UE in the identified subset of UEs.

[0122] We pause here to connect step 5b with... Figure 2 The comparison is performed in step 5a. Figure 2 In this context, we focus on traffic that can be remapped from one slice (the second network slice) to another slice (the first network slice). In contrast, for example, here, the network device estimates the load (e.g., traffic) of each corresponding slice for multiple UEs that currently support a switch to cell 200b and are expected to further switch to cell 200n.

[0123] When making such an estimate, the network device can store it in its memory.

[0124] Subsequently, in step 6b, the network device associated with cell 200b may receive a message from cell 200n associated with the one or more first neighboring access nodes, including a request for the one or more estimated or predicted loads, wherein the request may include a request to transmit or send such loads to cell 200n for the one or more network slices (first network slices). In other words, if a cell (e.g., cell 200n) requests information about the expected load for a given slice, the network device associated with cell 200b will provide such information in step 7b by transmitting or otherwise sending one or more of the estimated or predicted loads to the requesting cell (e.g., cell 200n) of the one or more first neighboring access nodes for each requested slice (i.e., one or more slices). It should be understood that the transmission of one or more estimated or predicted loads is in response to a request from a cell (e.g., cell 200n) of the one or more first neighboring access nodes.

[0125] While the foregoing description and accompanying drawings depict certain exemplary embodiments in the context of certain example combinations of elements, functions, or steps, it should be understood that different combinations of elements, functions, and / or steps may be provided by alternative embodiments without departing from the scope of the appended claims. In this regard, for example, combinations of elements, functions, and / or steps different from those explicitly described above are also contemplated as being set forth in some of the appended claims. Although specific terms may be used herein, they are used only in a general and descriptive sense and not for limiting purposes.

[0126] The following claims language is incorporated herein by reference in an expanded form (i.e., from widest to narrowest), wherein each possible combination indicated by reference in the plurality of dependent claims is described as a unique, independent embodiment.

[0127] The benefits, other advantages, and solutions to challenges have been described above with respect to specific embodiments of this disclosure. However, the benefits, advantages, solutions to challenges, and any elements(s), functions, and / or steps that may cause or result in such benefits, advantages, or solutions, or make such benefits, advantages, or solutions more apparent, should not be construed as key, essential, or necessary features or elements of any or all claims.

[0128] Furthermore, the various implementations of this disclosure can be described with reference to the following terms, and their features can be combined in any reasonable manner.

[0129] Clause 1. A network apparatus comprising: at least one processor; and at least one memory storing instructions, which, when executed by the at least one processor, cause the network apparatus to: receive from a first neighboring access node an estimated amount of licensed resources for a cell of the first neighboring access node for a first network slice during a first time period; receive from a second neighboring access node a handover request for a user equipment (UE) communicating with the second neighboring access node using a second network slice to move to communicating with the network apparatus; receive from the second neighboring access node information indicating an expected trajectory of the UE toward the cell of the first neighboring access node; and, based on the expected trajectory and the estimated amount of licensed resources for the first network slice received from the first neighboring access node, determine to remap the services of the UE from the second network slice to the first network slice.

[0130] Clause 2. The network apparatus according to Clause 1, wherein the at least one processor further executes the stored instructions from the at least one memory to cause the network apparatus to send a projected request for resources of the cell of the first neighboring access node for the first slice within a second time period.

[0131] Clause 3. The network device according to Clause 2, wherein the first time period is equal to the second time period.

[0132] Clause 4. The network apparatus according to Clause 2, wherein the at least one processor further executes the stored instructions from the at least one memory to cause the network apparatus to: receive from the second neighboring access node information including one or more trajectories, the one or more trajectories respectively corresponding to one or more UEs served by the second neighboring access node using the second network slice and having an expected handover to the network apparatus; use the received information to identify a subset of the one or more UEs having a further expected handover to the cell of the first neighboring access node during the second time period; determine the expected amount of resources of the first network slice required in the cell of the first neighboring access node corresponding to the identified subset of UEs; and generate the expected resource request for the second time period based on the determined expected resource amount, and send the generated request to the first neighboring access node.

[0133] Clause 5. The network apparatus according to Clause 2, wherein the at least one processor further executes the stored instructions from the at least one memory to cause the network apparatus to: receive information from each of one or more additional neighboring access nodes, the information including a trajectory of each of a plurality of UEs served by at least one of the one or more additional neighboring access nodes and having traffic associated with the second slice and expected to be handed over to the network apparatus; based on the trajectories of the identified subset of the plurality of UEs, use the received information to identify a subset of the plurality of UEs expected to be further handed over to the cell of the first neighboring access node during the second time period, and for the subset, the first The second slice is expected to be remapped to the first slice by the network device; a first expected resource amount of the first slice required in the cell of the first adjacent access node is determined, the first expected resource amount corresponding to the services expected to be remapped for the subset identified by the UE during the second time period; based on the trajectory of the UE toward the cell of the first adjacent access node during the second time period, a second expected resource amount of the first slice required in the cell of the first adjacent access node is determined, the second expected resource amount corresponding to the services expected to be remapped for the UE currently served by the network device; and the expected resource request is generated based at least on the first expected resource amount, the second expected resource amount, and the second time period.

[0134] Clause 6. The network apparatus according to Clause 5, wherein the one or more additional adjacent access nodes include the second adjacent access node.

[0135] Clause 7. The network apparatus according to Clause 5, wherein the UE includes one of the plurality of UEs.

[0136] Clause 8. The network apparatus according to Clause 1, wherein the at least one processor further executes the stored instructions from the at least one memory to cause the network apparatus to determine the expected trajectory of the UE toward the cell associated with the first adjacent access node.

[0137] Clause 9. The network apparatus pursuant to Clause 8, wherein the expected trajectory of the UE is determined using an artificial intelligence (AI) model or a machine learning (ML) model.

[0138] Clause 10. The network apparatus according to Clause 4, wherein the at least one processor further executes the stored instructions from the at least one memory to cause the network apparatus to determine the expected trajectory of the one or more UEs.

[0139] Clause 11. The network apparatus pursuant to Clause 10, wherein the expected trajectory of one or more UEs is determined using an artificial intelligence (AI) model or a machine learning (ML) model.

[0140] Clause 12. The network apparatus according to Clause 1, wherein the at least one processor further executes the stored instructions from the at least one memory to cause the network apparatus to remap the service from the UE from the second network slice to the first network slice.

[0141] Clause 13. The network apparatus according to Clause 1, wherein at least one of the network apparatus, the first adjacent access node, or the second adjacent access node includes a 5G access node or a 6G access node.

[0142] Clause 14. The network apparatus according to Clause 5, wherein the one or more additional adjacent access nodes include 5G access nodes or 6G access nodes.

[0143] Clause 15. The network apparatus according to Clause 4, wherein for each of the one or more UEs, the information received, including the one or more trajectories, further includes at least one of the following: an identifier of a Protocol Data Unit (PDU) session and a network slice identifier; a traffic or throughput indication; a maximum bit rate or guaranteed bit rate indication; a list of cells or access nodes, including the corresponding trajectory of the respective UE among the one or more UEs.

[0144] Clause 16. The network apparatus according to Clause 1, wherein the at least one processor further executes the stored instructions from the at least one memory to cause the network apparatus to determine, based on at least one of the following, to remap the service from the UE from the second network slice to the first network slice: determining that the network apparatus does not support the second network slice and is capable of remapping the service associated with the second network slice to at least the first network slice; determining, based on the expected trajectory of the UE, that the UE will communicate with the cell of the first adjacent access node and that the cell of the first adjacent access node supports the first network slice; and determining that the expected amount of authorized resources of the first network slice received from the first adjacent access node for the cell of the first adjacent access node will accommodate the service of the UE.

[0145] Clause 17. A network apparatus comprising: at least one processor; and at least one memory storing instructions that, when executed by the at least one processor, cause the network apparatus to: receive from one or more second neighboring access nodes information indicating an expected trajectory of each of a plurality of UEs served by at least one of the one or more second neighboring access nodes, wherein the expected trajectory of each of the plurality of UEs includes the network apparatus; use the received information to identify one or more subsets of the plurality of UEs, each subset including one or more UEs of the plurality of UEs expected to communicate with at least a cell of a first neighboring access node using a corresponding network slice; and based on at least one subset of the one or more subsets, determine an expected resource load of a first network slice at least for the cell of the first neighboring access node, and transmit the determined expected resource load to the first neighboring access node.

[0146] Clause 18. The network apparatus according to Clause 17, wherein the at least one processor further executes the stored instructions from the at least one memory to cause the network apparatus to: receive from the first neighboring access node a request for the expected resource load of at least the cell for the first neighboring access node for the first network slice, wherein the determined expected resource load sent is a response to the received request.

[0147] Clause 19. The network apparatus according to Clause 17, wherein the at least one processor further executes the stored instructions from the at least one memory to cause the network apparatus to determine, based on the received information, the expected trajectory of each of the plurality of UEs served by the at least one of the one or more second neighboring access nodes.

[0148] Clause 20. The network device described in Clause 19, wherein the expected trajectory is determined using an artificial intelligence (AI) model or a machine learning (ML) model.

[0149] Clause 21. The network apparatus according to Clause 17, wherein at least one of the network apparatus, the first adjacent access node, or the second adjacent access node includes a 5G access node or a 6G access node.

Claims

1. A network device, comprising: At least one processor; as well as At least one memory stores instructions that, when executed by the at least one processor, cause the network device to: Receive the estimated authorized resource amount for the cell of the first neighboring access node for the first network slice within the first time period from the first neighboring access node; Receive a handover request from the second adjacent access node for a user equipment (UE) communicating with the second adjacent access node using a second network slice to move to communicating with the network device; Receive information from the second adjacent access node indicating the expected trajectory of the UE toward the cell of the first adjacent access node; as well as Based on the expected trajectory and the expected authorized resource amount for the first network slice received from the first adjacent access node, it is determined that the UE's services will be remapped from the second network slice to the first network slice.

2. The network apparatus of claim 1, wherein the at least one processor further executes the stored instructions from the at least one memory to cause the network apparatus to send to the first neighboring access node a projected request for resources of the cell of the first neighboring access node for the first slice during a second time period.

3. The network device according to claim 2, wherein the first time period is equal to the second time period.

4. The network device of claim 2, wherein the at least one processor further executes the stored instructions from the at least one memory to cause the network device to: Receive information from the second adjacent access node including one or more trajectories, each of which corresponds to one or more UEs served by the second adjacent access node, using the second network slice and having an expected handover to the network device; The received information is used to identify a subset of one or more UEs that have a further anticipated handover to the cell of the first adjacent access node during the second time period; Determine the expected amount of resources required for the first network slice in the cell of the first neighboring access node corresponding to the subset identified by the UE; as well as Based on the determined expected resource quantity, the expected resource request for the second time period is generated, and the generated request is sent to the first adjacent access node.

5. The network device of claim 2, wherein the at least one processor further executes the stored instructions from the at least one memory to cause the network device to: Information is received from each of one or more additional adjacent access nodes, the information including the trajectory of each of a plurality of UEs that are served by at least one of the one or more additional adjacent access nodes and have services associated with the second slice and are expected to be switched to the network device; Based on the trajectories of the identified subsets of the plurality of UEs, the received information is used to identify a subset of the plurality of UEs that are expected to be further switched to the cell of the first adjacent access node during the second time period, and for the subset, the second slice is expected to be remapped to the first slice by the network device. Determine a first expected amount of resources required for the first slice in the cell of the first adjacent access node, the first expected amount of resources corresponding to the services that are expected to be remapped for the subset identified by the UE during the second time period; Based on the trajectory of the UE toward the cell of the first adjacent access node during the second time period, a second expected resource amount of the first slice required in the cell of the first adjacent access node is determined, the second expected resource amount corresponding to the service that is expected to be remapped for the UE currently served by the network device; as well as The projected resource request is generated based at least on the first projected resource quantity, the second projected resource quantity, and the second time period.

6. The network apparatus of claim 5, wherein the one or more additional adjacent access nodes include the second adjacent access node.

7. The network apparatus of claim 5, wherein the UE includes one of the plurality of UEs.

8. The network apparatus of claim 1, wherein the at least one processor further executes the stored instructions from the at least one memory to cause the network apparatus to determine the expected trajectory of the UE toward the cell associated with the first adjacent access node.

9. The network device of claim 8, wherein the expected trajectory of the UE is determined using an artificial intelligence (AI) model or a machine learning (ML) model.

10. The network apparatus of claim 4, wherein the at least one processor further executes the stored instructions from the at least one memory to cause the network apparatus to determine the expected trajectory of the one or more UEs.

Images