CN117223351A - Method for network slice admission control - Google Patents
Method for network slice admission control Download PDFInfo
- Publication number
- CN117223351A CN117223351A CN202180097480.6A CN202180097480A CN117223351A CN 117223351 A CN117223351 A CN 117223351A CN 202180097480 A CN202180097480 A CN 202180097480A CN 117223351 A CN117223351 A CN 117223351A
- Authority
- CN
- China
- Prior art keywords
- network slice
- wireless
- registration
- temporary information
- wireless terminal
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 85
- 238000004891 communication Methods 0.000 claims abstract description 49
- 230000004044 response Effects 0.000 claims abstract description 44
- 230000006870 function Effects 0.000 claims description 69
- 238000004590 computer program Methods 0.000 claims description 4
- 238000007726 management method Methods 0.000 description 24
- 238000010586 diagram Methods 0.000 description 14
- 230000008569 process Effects 0.000 description 11
- 238000012986 modification Methods 0.000 description 5
- 230000004048 modification Effects 0.000 description 5
- 238000012545 processing Methods 0.000 description 5
- 238000013500 data storage Methods 0.000 description 4
- 230000003287 optical effect Effects 0.000 description 4
- 238000013523 data management Methods 0.000 description 3
- 238000013461 design Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 3
- 238000013475 authorization Methods 0.000 description 2
- 239000002245 particle Substances 0.000 description 2
- 230000003139 buffering effect Effects 0.000 description 1
- 230000007423 decrease Effects 0.000 description 1
- 230000003247 decreasing effect Effects 0.000 description 1
- 238000012217 deletion Methods 0.000 description 1
- 230000037430 deletion Effects 0.000 description 1
- 230000008520 organization Effects 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
- 238000012795 verification Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W60/00—Affiliation to network, e.g. registration; Terminating affiliation with the network, e.g. de-registration
- H04W60/06—De-registration or detaching
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W60/00—Affiliation to network, e.g. registration; Terminating affiliation with the network, e.g. de-registration
- H04W60/04—Affiliation to network, e.g. registration; Terminating affiliation with the network, e.g. de-registration using triggered events
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W48/00—Access restriction; Network selection; Access point selection
- H04W48/18—Selecting a network or a communication service
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W88/00—Devices specially adapted for wireless communication networks, e.g. terminals, base stations or access point devices
- H04W88/14—Backbone network devices
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
A wireless communication method for use in a network slice admission control function is disclosed. The method comprises the following steps: receiving a registration request associated with a wireless terminal and a network slice from a first access and mobility management function, wherein the registration request includes a wireless terminal identifier, a network slice identifier, and an indication to increase a number of wireless terminals registered with the network slice; and sending a registration response to the first access and mobility management function, the registration response indicating a first registration of the wireless terminal with the network slice, wherein the registration response includes first temporary information associated with the first registration.
Description
Technical Field
The present application relates generally to wireless communications.
Background
Network slicing is a logical network that provides specific network capabilities and network characteristics and is a key tool for network operators to provide specific network capabilities for their own services or third party services. The number of User Equipments (UEs) registered to each network slice may be limited to a predefined maximum value. Thus, it is required that the network operator controls the number of UEs registered in the network slice not to exceed a pre-configured maximum value. Information associated with controlling the number of UEs registered with the network slice is also useful for satisfying service layer agreements with third party applications.
Disclosure of Invention
The present application relates to methods, systems and apparatus for network slice admission control, and in particular to methods, systems and apparatus for updating the number of UEs registered with a network slice.
The present disclosure relates to a wireless communication method for use in a network slice admission control function.
The method comprises the following steps:
receiving a registration request associated with a wireless terminal and a network slice from a first access and mobility management function, wherein the registration request includes a wireless terminal identifier, a network slice identifier, and an indication to increase a number of wireless terminals registered with the network slice, and
a registration response is sent to the first access and mobility management function, the registration response indicating a first registration of the wireless terminal with the network slice, wherein the registration response includes first temporary information associated with the first registration.
Various embodiments may preferably implement the following features:
preferably, the wireless communication method further comprises:
receiving a deregistration request associated with a wireless terminal and a network slice from a second access and mobility management function, wherein the deregistration request includes second temporary information, a wireless terminal identifier and an indication to reduce the number of wireless terminals registered with the network slice, and
Based on the first temporary information and the second temporary information, at least one of a list of wireless terminals registered with the network slice or a number of wireless terminals is updated.
Preferably, the first temporary information and the second temporary information are the same, and updating at least one of a list of wireless terminals registered with the network slice or a number of wireless terminals based on the first temporary information and the second temporary information includes at least one of:
reducing the number of wireless terminals registered with a network slice, or
The wireless terminal is deleted from the list of wireless terminals registered with the network slice.
Preferably, the first temporary information and the second temporary information are different, and updating at least one of a list of wireless terminals registered with the network slice or a number of wireless terminals based on the first temporary information and the second temporary information includes at least one of:
ignoring the logout request, or
At least one of a list of wireless terminals registered with the network slice or a number of wireless terminals is maintained.
Preferably, the wireless terminal registers with the network slice via the second registration or is in a list of wireless terminals registered with the network slice before receiving the registration request.
Preferably, the third temporary information associated with the second registration is different from the first temporary information.
Preferably, the number of wireless terminals registered with the network slice is less than a maximum threshold.
Preferably, the wireless terminal is not registered with the network slice or is not in the list of wireless terminals registered with the network slice.
Preferably, the first temporary information is a timestamp or identifier associated with the first registration.
The present disclosure relates to a wireless communication method for use in a first access and mobility management function. The method comprises the following steps:
transmitting a registration request associated with the wireless terminal and the network slice to the network slice admission control function, wherein the registration request includes a wireless terminal identifier, a network slice identifier, and an indication to increase the number of wireless terminals registered with the network slice, and
receiving a registration response from the network slice admission control function, the registration response indicating a first registration of the wireless terminal with the network slice,
wherein the registration response includes first temporary information associated with the first registration.
Various embodiments may preferably implement the following features:
preferably, the wireless communication method further comprises: a cancellation request associated with the wireless terminal and the network slice is sent to the network slice admission control function, wherein the cancellation request includes first temporary information, a wireless terminal identifier, and an indication to reduce the number of wireless terminals registered with the network slice.
Preferably, the wireless communication method further comprises: and sending context information of the wireless terminal to a second access and mobility management function, wherein the context information comprises first temporary information.
Preferably, the first temporary information is a timestamp or identifier associated with the first registration.
The present disclosure relates to wireless communication methods for use in access and mobility management functions. The method comprises the following steps: a cancellation request associated with the wireless terminal and the network slice is sent to the network slice admission control function, wherein the cancellation request includes temporary information associated with registration of the wireless terminal with the network slice, a wireless terminal identifier, and an indication to reduce the number of wireless terminals registered with the network slice.
Various embodiments may preferably implement the following features:
preferably, the temporary information is a timestamp or identifier associated with the registration.
The present disclosure relates to a wireless device including a network slice admission control function. The wireless device includes a communication unit configured to:
receiving a registration request associated with a wireless terminal and a network slice from a first access and mobility management function, wherein the registration request includes a wireless terminal identifier, a network slice identifier, and an indication to increase a number of wireless terminals registered with the network slice, and
A registration response is sent to the first access and mobility management function, the registration response indicating a first registration of the wireless terminal with the network slice, wherein the registration response includes first temporary information associated with the first registration.
Various embodiments may preferably implement the following features:
preferably, the wireless device further comprises a processor configured to perform any of the aforementioned wireless communication methods.
The present disclosure relates to a wireless device including a first access and mobility management function. The wireless device includes a communication unit configured to:
transmitting a registration request associated with the wireless terminal and the network slice to the network slice admission control function, wherein the registration request includes a wireless terminal identifier, a network slice identifier, and an indication to increase the number of wireless terminals registered with the network slice, and
receiving a registration response from the network slice admission control function, the registration response indicating a first registration of the wireless terminal with the network slice,
wherein the registration response includes first temporary information associated with the first registration.
Various embodiments may preferably implement the following features:
Preferably, the wireless device further comprises a processor configured to perform any of the aforementioned wireless communication methods.
The present disclosure relates to a wireless device including access and mobility management functions. The wireless device includes a communication unit configured to:
a cancellation request associated with the wireless terminal and the network slice is sent to the network slice admission control function, wherein the cancellation request includes temporary information associated with registration of the wireless terminal with the network slice, a wireless terminal identifier, and an indication to reduce the number of wireless terminals registered with the network slice.
Various embodiments may preferably implement the following features:
preferably, the wireless device further comprises a processor configured to perform any of the aforementioned wireless communication methods.
The present disclosure relates to a computer program product comprising computer readable program medium code stored thereon, which code, when executed by a processor, causes the processor to implement a wireless communication method as recited in any of the preceding methods.
The exemplary embodiments disclosed herein are intended to provide features that will become apparent by reference to the following description taken in conjunction with the accompanying drawings. According to various embodiments, exemplary systems, methods, devices, and computer program products are disclosed herein. However, it should be understood that these embodiments are presented by way of example and not limitation, and that various modifications of the disclosed embodiments may be made while remaining within the scope of the disclosure, as would be apparent to one of ordinary skill in the art having read the present disclosure.
Thus, the disclosure is not limited to the exemplary embodiments and applications described and illustrated herein. Furthermore, the particular order and/or hierarchical architecture of steps in the methods disclosed herein is merely an exemplary method. Based on design preferences, the specific order or hierarchy of steps in the disclosed methods or processes may be rearranged while remaining within the scope of the present disclosure. Thus, it will be understood by those of ordinary skill in the art that the methods and techniques disclosed herein present various steps or acts in a sample order and that the present disclosure is not limited to the particular order or hierarchy presented, unless specifically stated otherwise.
Drawings
The above and other aspects and embodiments thereof are described in more detail in the accompanying drawings, description and claims.
Fig. 1 shows a schematic diagram of a network architecture according to an embodiment of the present disclosure.
Fig. 2 shows a schematic diagram of a process according to an embodiment of the present disclosure.
Fig. 3 shows a schematic diagram of a process according to an embodiment of the present disclosure.
Fig. 4 shows a schematic diagram of a process according to an embodiment of the present disclosure.
Fig. 5 shows a schematic diagram of a process according to an embodiment of the present disclosure.
Fig. 6 shows a flow chart of a method according to an embodiment of the present disclosure.
Fig. 7 shows a flow chart of a method according to an embodiment of the present disclosure.
Fig. 8 shows a flow chart of a method according to an embodiment of the present disclosure.
Fig. 9 shows an example of a schematic diagram of a wireless terminal according to an embodiment of the disclosure.
Fig. 10 shows an example of a schematic diagram of a wireless network node according to an embodiment of the disclosure.
Detailed Description
Fig. 1 shows a schematic diagram of a network architecture according to an embodiment of the present disclosure. The network architecture shown in fig. 1 includes the following network functions:
ue: user equipment
Ran: wireless access network (node)
Amf (Access and Mobility Management function, access and mobility management functions):
the AMF includes the following functionality: registration management, connection management, reachability management, and mobility management. The AMF also performs access authentication, access authorization, and the like. The AMF is a non-access stratum (NAS) security termination and relays SM NAS between the UE and the SMF.
SMF (Session Management Function )
The SMF includes the following functionalities: session establishment, modification and release, UE internet protocol (internet protocol, IP) address allocation and management (including optional authorization functions), selection and control of User Plane (UP) functions, downlink data notification, etc.
UPF (User plane function, user plane Functions)
The UPF includes the following functionality: acting as anchor point for intra/inter radio access technology (radio access technology, RAT) mobility, packet routing and forwarding, traffic usage reporting, quality of service (quality of service, qoS) handling of the user plane, and downlink packet buffering and downlink data notification triggering, etc.
UDM (User Data Management )
The UDM provides UE subscription information to the AMF. The UDM also maintains service AMF information when the UE is currently registered. Thus, when a UE subscription is updated, the UDM may update the UE subscription to the AMF.
In an embodiment, a network slice admission control function (Network Slice Admission Control Function, nsafc) is defined to monitor and control the number of registered UEs per network slice of network slices subject to network function Network Slice Admission Control (NSAC). The nsacp is configured with a maximum number of UEs per network slice that are allowed to be served by the NSAC for each network slice. The nsaf controls (i.e., increases or decreases) the current number of UEs registered in the network slice such that the number of UEs registered in the network slice does not exceed the maximum number of UEs allowed to register with this network slice.
The nsacp also maintains a list of UE Identifiers (IDs) registered with the NSAC-dominated network slices. When the number of UEs registered with a network slice needs to be increased in response to registration of a UE ID, nsacp first checks whether this UE ID is already in the list of UEs registered with this network slice. If this UE ID is not in the list of UEs registered with this network slice, the nsacp checks if the maximum number of UEs per network slice for the network slice is reached.
For example, during a UE registration procedure and/or a UE deregistration procedure, when the UE registration status of a network slice subject to NSAC changes, the AMF triggers a request for admission control of a maximum number of UEs per network slice to the nsacp.
In an embodiment, the nsaacf returns an admission control result to the AMF. The nsaf also returns temporary information associated with successful registration to the AMF if the request is accepted. When the AMF needs to delete the UE from the list of UE IDs in the nsacp, the AMF is required to provide the nsacp with the UE IDs and associated temporary information. Then, the nsacp can verify whether the delete request message is authorized based on the temporary information received from the AMF and the temporary information stored in itself.
Example 1:
fig. 2 shows a schematic diagram of a process according to an embodiment of the present disclosure. This embodiment shows how admission control is performed during a (UE) registration procedure.
More specifically, the UE initiates a registration request (message) to the AMF. The registration request may include one or more requested S-NSSAIs (step 201).
In step 202, if one or more of the requested S-nsais is subject to NSAC, the AMF triggers a number availability check and update procedure/service for the UE per network slice (for each one or more S-nsais subject to NSAC) via sending a slice availability check and update request message to the nsaf to update the number of UEs registered with the network slice corresponding to the requested S-nsai. In an embodiment, the slice availability check and update request message includes, for example, a UE identifier, S-nsai, and an indication to add a UE ID in a list of UE IDs maintained in nsacp (i.e., an indication to increase the number of UEs registered with the requested network slice).
In step 203, the nsaac performs NSAC by checking a list of UE IDs registered with the network slice and/or the current number of UEs registered in the network slice. If the UE ID is already in the list of UE IDs registered with the network slice, the number of UEs registered with the network slice (corresponding to S-nsai) will not increase because the UE has been counted in the number of UEs registered with the network slice. If the UE ID is not in the list of UEs registered with the network slice and the maximum number of UEs per network slice for the network slice is reached (or has been reached), the nsacp returns a result parameter indicating that the maximum number of UEs registered with the network slice is reached. If the UE ID is not in the list of UE IDs registered with the network slice and the maximum number of UEs registered with the network slice is not reached (or has not been reached), the nsacp adds the UE ID to the list of UE IDs registered with the network slice and/or increases the number of UEs registered with the network slice.
If admission control is successful (i.e., when a UE ID has been and/or is added to the list of UE IDs registered with the network slice, and/or the number of UEs registered with the network slice increases), the nsacp allocates and stores temporary information associated with the UE ID. This temporary information is used for nsaacf verification of messages associated with the deletion of the UE ID from the UE ID list. When a message associated with deleting a UE ID from the UE ID list is transmitted, the AMF is required to provide temporary information corresponding to the UE ID. If the temporary information provided by the AMF is the same as the temporary information stored in the NSACF, the NSACF deletes the UE ID from the list of UE IDs and reduces the number of UEs registered with the network slice. If the temporary information provided by the AMF is different from the temporary information stored in the nsaacf, the nsaacf ignores the message associated with deleting the UE ID from the UE ID list.
Based on the results of the network slice admission control, the nsacp returns a slice availability check and update response (message) to the AMF. This message includes the NSAC result. Note that when the NSAC result indicates a registration failure, this message includes a cause value. If the NSAC result indicates that the registration was successful, this message includes the assigned temporary information associated with the UE ID.
In step 204, the AMF sends a registration accept to the UE if NSAC for the requested S-nsai is successful. The requested S-nsai is included in the allowed list of nsais and the UE may use this S-nsai for the PDU session establishment procedure. If the requested S-NSSAI is rejected by the NSACF (i.e., NSAC fails), the AMF returns a registration reject message in which the AMF includes the rejected one or more S-NSSAIs in a rejected NSSAI list for which the NSACF has indicated that the maximum number of UEs for each network slice has been reached, the reject cause is set to "maximum number of UEs for each network slice reached" for each rejected S-NSSAI, and optionally a back-off timer.
In embodiments of registration requests associated with multiple network slices (i.e., including multiple requested NSSAIs), the AMF denies the registration request if the NSACF return has reached the maximum number of UEs for each network slice for all of the requested one or more S-NSSAs. In the registration reject message, the AMF includes one or more S-nsais to be rejected in the rejected nsai parameters, the reject cause is set to "maximum number of UEs per network slice is reached" for each S-nsai, and optionally a back-off timer is included.
In an embodiment, the AMF may also assign a 5G-GUTI (5G Globally Unique Temporary Identifier) for uniquely identifying the UE context in the AMF and provide the 5G-GUTI to the UE.
Example 2:
fig. 3 shows a schematic diagram of a process according to an embodiment of the present disclosure. Figure 3 shows how admission control is performed during a deregistration procedure.
In detail, in step 301, the UE initiates a deregistration request to the AMF.
In step 302, the AMF determines that one of the allowed nsais subject to NSAC by checking the availability of temporary information associated with the network slice (e.g., the AMF has/stores temporary information associated with the UE ID and this network slice/S-nsai), and that the nsaac has stored the UE ID of the network slice. The AMF sends a delete UE ID request to the nsacp. The delete UE ID message includes a UE ID, an S-nsai, temporary information associated with the UE ID and the S-nsai, and an indication to delete the UE ID from a UE ID list associated with the S-nsai and maintained in the nsaf.
In step 303, the nsaacf validates the message based on the received temporary information. If the temporary information provided by the AMF is the same as the temporary information stored in the nsaacf, the nsaacf deletes the UE ID from the UE ID list and/or reduces the number of UEs registered with the network slice corresponding to the received S-nsai. If the temporary information provided by the AMF and the temporary information stored in the NSACF are different, the NSACF ignores the delete UE ID request.
Further, the nsacp returns a delete UE ID response to the AMF to indicate the result.
Example 3:
fig. 4 shows a schematic diagram of a process according to an embodiment of the present disclosure. Fig. 4 shows how admission control is performed during an inter-AMF registration procedure.
In step 401, the UE is registered in the old AMF and assigned a 5G-GUTI. After the UE moves, the UE initiates a registration request to the new AMF. The UE includes the requested S-NSSAI and 5G GUTI in the registration request.
In step 402, the new AMF retrieves the UE context from the old AMF via the send UE context request using the 5G-GUTI.
In step 403, the old AMF provides the UE context to the new AMF. The UE context includes allowed nsais determined by the old AMF. Note that if the S-nsai of the allowed nsais is assigned by the nsaf, the UE context also includes temporary information associated with the S-nsai (and UE (ID)).
In step 404, the new AMF performs UE authentication. If the UE authentication is successful, the new AMF sends the UE context completion to the old AMF. If the new AMF does not support any S-NSSAI within the allowed NSSAI, the new AMF provides this/these S-NSSAI to the old AMF.
In step 405, for one or more S-nsais not supported by the new AMF, the old AMF sends a delete UE ID request to the nsaf. This message includes the UE ID, one or more S-nsais, associated temporary information, and an indication to delete the UE ID from the list of UE IDs maintained in the nsacp.
In step 406, the nsaacf verifies the delete UE ID request based on the associated temporary information. If the temporary information provided by the old AMF is the same as the temporary information stored in the nsaacf, the nsaacf deletes the UE ID from the UE ID list and reduces the number of UEs registered with the corresponding network slice.
In step 407, the new AMF continues the registration process. If one of the remaining portions of the allowed NSSAIs (i.e., the S-NSSAI supported by the new AMF) is no longer allowed to be registered, the new AMF sends a delete UE ID request to the NSACF. The message includes the UE ID, the S-nsai, associated temporary information, and an indication to delete the UE ID from the list of UE IDs maintained in the nsacp.
In step 408, the nsaacf validates the message by checking the received temporary information. If the temporary information provided by the new AMF is the same as the temporary information stored in the nsaacf, the nsaacf deletes the UE ID from the UE ID list and reduces the current number of UEs registered with the network slice.
In step 409, if the remaining S-nsais in the old allowed nsais remain allowed in the new AMF, the new AMF needs to perform NSAC again (e.g., steps 202 and 203).
For requested S-nsai that is not within the allowed nsai provided by the old AMF and is subject to NSAC, the AMF triggers a number availability check and update procedure/service for the UE per network slice to update the number of UEs registered with the network slice. The slice availability check and update request message includes the UE ID, the S-nsai, and an indication to add the UE ID to the list of UE IDs maintained in the nsacp.
In step 410, the nsaac performs NSAC based on the number of UEs in/registered with the network slice. The nsacp returns a slice availability check and update response to the AMF. This message includes the NSAC result. If the result indicates failure, this message will include a cause value. If the result indicates success, this message will include the assigned temporary information. Further details of steps 409 and 410 may be obtained from steps 202 and 203.
In step 411, the AMF sends a registration accept to the UE if NSAC for the requested S-nsai is successful. The registration accept message may include a new allowed NSSAI, a new rejected NSSAI, and/or a new 5G-GUTI.
Example 4:
fig. 5 shows a schematic diagram of a process according to an embodiment of the present disclosure. Figure 5 shows how admission control is performed during an initial registration procedure.
In step 501, the UE may trigger the initial UE to initiate a registration request to a new AMF. The UE includes the requested S-NSSAI in a message.
In step 502, the new AMF registers with the UDM and retrieves the UE subscription from the unified data management (unified data management, UDM).
In step 503, the UDM stores the service AMF information in the UE context and returns the UE subscription to the new AMF.
In step 504, if the UDM has a registration of the UE with the old AMF, the UDM sends a cancel location request to the old AMF.
In step 505, the old AMF deletes the UE context and sends a cancel location response to the UDM.
In step 506, the new AMF continues the registration process. If the requested network slice (corresponding to the requested S-nsai) is subject to NSAC, the AMF triggers a number availability check and update procedure/service for the UE per network slice to update the number of UEs registered with the requested network slice. The message includes the UE ID, the requested S-nsai, and an indication to add the UE ID to the list of UE IDs maintained in the nsacp.
In step 507, the nsaac is performed by checking the current number of UEs in/registered with the network slice. The nsacp returns a slice availability check and update response to the new AMF. The response message includes the NSAC result. If the NSAC result indicates failure, the response message includes a cause value. If the NSAC result indicates success, the response message includes the assigned temporary information.
In step 508, the AMF sends a registration accept to the UE if the NSAC result of the requested S-NSSAI is successful. The registration accept message may include a new allowed NSSAI, a new rejected NSSAI, and/or a new 5G-GUTI.
In step 509, when the old AMF deletes the UE context, it sends a delete UE ID request to the nsacp. The message includes the UE ID, S-nsai, temporary information stored in the old AMF, and/or an indication to delete the UE ID in the list of UE IDs maintained in the nsacp.
In step 510, the nsaacf validates the message by checking temporary information received from the old AMF. If the new AMF does not check for S-NSSAI (e.g., steps 506 and 507 are not performed prior to step 510), then the temporary information provided by the old AMF and the temporary information of S-NSSAI stored in the NSACF may be the same. In this case, the nsacp deletes the UE ID from the UE ID list and reduces the current number of UEs registered with the network slice. If the new AMF has checked for S-NSSAI (e.g., steps 506 and 507 are performed prior to step 510), then the old AMF and NSACF store different temporary information associated with the UE and the requested S-NSSAI. Thus, nsacp ignores the delete UE ID message and the current number of UEs registered with the network slice remains unchanged.
In the present disclosure, the nsaacf may perform at least one of the following steps:
1. receiving the S-NSSAI and the UE ID from the AMF and performing admission control accordingly;
2. providing temporary information associated with the S-NSSAI to the AMF;
3. receiving the S-NSSAI, the UE ID and temporary information associated with the S-NSSAI from the AMF to delete the UE ID;
4. deleting the UE ID if the temporary information received from the AMF is identical to the temporary information stored in the nsaacf;
5. if the temporary information received from the AMF is different from the temporary information stored in the NSACF, the message is ignored
In the present disclosure, the AMF may perform at least one of the following steps:
1. transmitting the S-NSSAI and the UE ID to the NSACF to perform admission control;
2. receiving temporary information associated with the UE and the S-nsai from the nsaacf;
3. transmitting the UE ID, the S-nsai and temporary information associated with the S-nsai to the nsaacf to delete the UE ID from the UE ID list of the S-nsai;
4. the S-NSSAI and temporary information associated with the S-NSSAI are sent to another AMF.
Fig. 6 shows a flow chart of a method according to an embodiment of the present disclosure. The method shown in fig. 6 may be used in an nsaf (e.g., a wireless device including/executing an nsaf) and includes the steps of:
Step 601 receives a registration request associated with a wireless terminal and a network slice from a first AMF.
Step 602, a registration response is sent to a first AMF, the registration response indicating a first registration of the wireless terminal with the network slice, wherein the registration response includes first temporary information associated with the first registration.
In fig. 6, nsaacf receives registration requests associated with a wireless terminal (e.g., UE) and a network slice (e.g., corresponding S-nsai). For example, the registration request may be a slice availability check and update request or an nnracf_numberofuespersliceaiitycheckandupdate request. In this embodiment, the registration request indicates that the wireless terminal ID is added to the wireless terminal ID list of the network slice stored in the nsaf and/or the number of wireless terminals registered with the network slice is increased. For example, the registration request may include a wireless terminal ID (i.e., an ID of the wireless terminal), a network slice identifier (e.g., S-NSSAI corresponding to/associated with the network slice), and an indication to increase the number of wireless terminals registered with the network slice. Based on the registration request, the nsaacf performs a first registration (procedure) of registering the wireless terminal with the network slice. For example, nsaacf checks whether the wireless terminal has registered with the network slice (i.e., the wireless terminal ID is in the wireless terminal ID list of the network slice) and/or whether the number of wireless terminals registered with the network slice reaches/has reached a maximum number or maximum threshold of wireless terminals registered with the network slice. If the wireless terminal has registered with the network slice, the first registration is successful. Since the wireless terminals have registered with the network slice, the nsacp maintains a list of wireless terminals for the network slice and/or the number of wireless terminals registered with the network slice. Alternatively, if the number of wireless terminals registered with the network slice reaches/has reached the maximum number (and the wireless terminals have not yet registered with the network slice), the first registration is successful and the nsacp adds the wireless terminal ID to the wireless terminal ID list of the network slice and/or increases the number of wireless terminals registered with the network slice.
In this embodiment, the first registration is successful, and the nsacp sends a registration response (e.g., a slice availability check and update response or an nnracf_numberofuespersliceailailailabilitycheckandupdate response) to the first AMF to indicate the first registration (successful). The registration response includes first temporary information associated with the first registration. The first temporary information is used for nsaacf to authenticate whether subsequent modifications associated with the wireless terminal and the network slice are valid. For example, the first temporary information may be a timestamp or identifier associated with the first registration (e.g., a unique ID within/generated by the nsafc).
In an embodiment, the nsaf receives a deregistration request (e.g., a slice availability check and update request or an nnracf_numberofuespersliceailailyiilycheckupdate request) associated with the wireless terminal and the network slice from the second AMF. Note that the second AMF may be equal to or different from the first AMF. The cancellation request indicates that the wireless terminal ID is deleted from the list of wireless terminal IDs of the network slice and/or the number of wireless terminals registered with the network slice is reduced. In this embodiment, the cancellation request includes a wireless terminal ID, a network slice ID, second temporary information, and an indication to delete the wireless terminal ID from the list of wireless terminal IDs of the network slice and/or to reduce the number of wireless terminals registered with the network slice. Based on the first temporary information and the second temporary information, the nsacp updates a list of wireless terminals and/or a number of wireless terminals registered with the network slice.
In an embodiment, the first temporary information and the second temporary information are the same. In this embodiment, the nsaf approves the deregistration request and deletes the wireless terminal ID from the network slice's wireless terminal ID list and/or reduces the number of wireless terminals registered with the network slice.
In an embodiment, the first temporary information and the second temporary information are different. In this embodiment, the nsacp denies/ignores the deregistration request and/or maintains a list of wireless terminal IDs for network slices and/or the number of wireless terminals registered with the network slices.
In an embodiment, the wireless terminal registers with the network slice, or is in a list of wireless terminals registered with the network slice, before the nsacp receives the registration request. For example, the wireless terminal registers with the network slice via a second registration (procedure) associated with the third temporary information or in a list of wireless terminals registered with the network slice. Note that the third temporary information is different from the first temporary information. That is, even though the registrations are associated with the same wireless terminal and the same network slice, the nsafcs allocate different temporary information for different registrations.
Fig. 7 shows a flow chart of a method according to an embodiment of the present disclosure. The method shown in fig. 7 may be used in a first AMF (e.g., a wireless device that includes/executes an AMF), and includes the steps of:
Step 701, sending a registration request associated with a wireless terminal and a network slice to a nsaacf.
Step 702 receives a registration response from the nsacp indicating a first registration of the wireless terminal with the network slice, wherein the registration response includes first temporary information associated with the first registration.
In fig. 7, the AMF sends a registration request associated with the wireless terminal and the network slice to the nsacp. For example, the registration request may be a slice availability check and update request or an nnracf_numberofuespersliceaiitycheckandupdate request. In this embodiment, the registration request indicates that the wireless terminal ID is added to the wireless terminal ID list of the network slice stored in the nsaf and/or the number of wireless terminals registered with the network slice is increased. For example, the registration request may include a wireless terminal ID (i.e., an ID of the wireless terminal), a network slice identifier (e.g., S-NSSAI corresponding to/associated with the network slice), and an indication to increase the number of wireless terminals registered with the network slice.
In this embodiment, the first AMF receives a registration response indicating a first registration (success) of the wireless terminal with the network slice. The registration response includes first temporary information associated with (e.g., corresponding to) the first registration. The first temporary information is used for nsaacf to authenticate whether subsequent modifications associated with the wireless terminal and the network slice are valid. For example, the first temporary information may be a timestamp associated with the first registration or a unique ID within (e.g., generated by) the nsaacf.
In an embodiment, the first AMF sends a logoff request (e.g., a slice availability check and update request or an nnracf_numberofuespersliceailailyilicycheckand request) associated with the wireless terminal and the network slice to the nsafc. The cancellation request indicates that the wireless terminal ID is deleted from the list of wireless terminal IDs of the network slice and/or the number of wireless terminals registered with the network slice is reduced. In this embodiment, the cancellation request includes a wireless terminal ID, a network slice ID, first temporary information, and an indication to delete the wireless terminal ID from the list of wireless terminal IDs of the network slice and/or to reduce the number of wireless terminals registered with the network slice.
In an embodiment, a first AMF sends context information (e.g., UE context) of a wireless terminal to a second AMF. For example, the second AMF may retrieve the context information of the wireless terminal from the first AMF via a context information request. Note that the context information includes first temporary information associated with the wireless terminal and the network slice.
Fig. 8 shows a flow chart of a method according to an embodiment of the present disclosure. The method shown in fig. 8 may be used in an AMF (e.g., a wireless device that includes/executes the AMF), and includes the steps of:
Step 801 sends a logout request associated with a wireless terminal and a network slice to a nsafc, wherein the logout request includes temporary information associated with registration of the wireless terminal with the network slice, a wireless terminal identifier, and an indication to reduce the number of wireless terminals registered with the network slice.
In this embodiment, the AMF sends a deregistration request associated with the wireless terminal and the network slice. For example, the cancellation request may be a slice availability check and update request or an nnracf_numberofuespersliceailailabilitycheckandupdate request that indicates that the wireless terminal ID is deleted from the wireless terminal ID list of the network slice and/or that the number of wireless terminals registered with the network slice is reduced/decreased. In this embodiment, the cancellation request includes not only the wireless terminal ID, the network slice ID, and an indication to delete the wireless terminal ID from the list of wireless terminal IDs for the network slice and/or to reduce the number of wireless terminals registered with the network slice, but also temporary information associated with the registration of the wireless terminal with the network slice. Based on temporary information received from the AMF and stored in the nsaacf, the nsaacf can determine/authenticate whether the logout request is valid.
Fig. 9 relates to a schematic diagram of a wireless terminal 90 according to an embodiment of the present disclosure. The wireless terminal 90 may be a User Equipment (UE), a mobile phone, a laptop, a tablet, an electronic book, or a portable computer system, and is not limited thereto. The wireless terminal 90 may include a processor 900, such as a microprocessor or application specific integrated circuit (Application Specific Integrated Circuit, ASIC), a storage unit 910, and a communication unit 920. The storage unit 910 may be any data storage device that stores program code 912 that is accessed and executed by the processor 900. Examples of the storage unit 912 include, but are not limited to, a subscriber identity module (subscriber identity module, SIM), a read-only memory (ROM), a flash memory, a random-access memory (RAM), a hard disk, and an optical data storage device. The communication unit 920 may be a transceiver and configured to transmit and receive signals (e.g., messages or packets) according to the processing result of the processor 900. In an embodiment, the communication unit 920 transmits and receives signals via at least one antenna 922 shown in fig. 9.
In an embodiment, the storage unit 910 and the program code 912 may be omitted, and the processor 900 may include a storage unit having the stored program code.
Processor 900 may implement any of the steps in the exemplary embodiments on wireless terminal 90, such as by executing program code 912.
The communication unit 920 may be a transceiver. Alternatively or in addition, the communication unit 920 may combine a transmitting unit and a receiving unit configured to transmit and receive signals to and from a wireless network node (e.g., a base station), respectively.
Fig. 10 relates to a schematic diagram of a wireless network node 100 according to an embodiment of the present disclosure. The radio network node 100 may be a satellite, a Base Station (BS), a network entity, a mobility management entity (Mobility Management Entity, MME), a serving gateway (S-GW), a packet data network (Packet Data Network, PDN) gateway (P-GW), a radio access network (radio access network, RAN) node, a next generation RAN (NG-RAN) node, a gNB, eNB, gNB centralized unit (gNB central unit, gNB-CU), a gNB distributed unit (gNB distributed unit, gNB-DU), a data network, a core network, or a radio network (Radio Network Controller, RNC) controller, and is not limited thereto. Further, the radio network node 100 may comprise (perform) at least one network function, such as an access and mobility management function (access and mobility management function, AMF), a session management function (session management function, SMF), a user location function (user place function, UPF), a policy control function (policy control function, PCF), an application function (application function, AF), nsafc, etc. The radio network node 100 may comprise a processor 1000, such as a microprocessor or ASIC, a storage unit 1010 and a communication unit 1020. The memory unit 1010 may be any data storage device that stores program code 1012 that is accessed and executed by the processor 1000. Examples of storage unit 1012 include, but are not limited to, a SIM, ROM, flash memory, RAM, hard disk, and optical data storage devices. The communication unit 1020 may be a transceiver and is configured to transmit and receive signals (e.g., messages or packets) according to the processing result of the processor 1000. In an example, the communication unit 1020 transmits and receives signals through at least one antenna 1022 illustrated in fig. 10.
In an embodiment, the storage unit 1010 and the program code 1012 may be omitted. The processor 1000 may include a memory unit with stored program code.
Processor 1000 may implement any of the steps described in the exemplary embodiments on radio network node 100, for example by executing program code 1012.
The communication unit 1020 may be a transceiver. Alternatively or in addition, the communication unit 1020 may combine a transmitting unit and a receiving unit configured to transmit and receive signals to and from a wireless terminal (e.g., a user equipment or another wireless network node), respectively.
While various embodiments of the present disclosure have been described above, it should be understood that they have been presented by way of example only, and not limitation. As such, various figures may depict example architectures or configurations that are provided to enable those of ordinary skill in the art to understand the example features and functionality of the disclosure. However, such person should understand that the present disclosure is not limited to the example architectures or configurations shown, but can be implemented using a variety of alternative architectures and configurations. Furthermore, one or more features of one embodiment may be combined with one or more features of another embodiment described herein, as would be appreciated by one of ordinary skill in the art. Thus, the breadth and scope of the present disclosure should not be limited by any of the above-described exemplary embodiments.
It will be further understood that any reference herein to an element using designations such as "first," "second," etc. generally does not limit the number or order of such elements. Rather, these designations may be used herein as a convenient means of distinguishing between two or more elements or instances of an element. Thus, references to a first element and a second element do not mean that only two elements can be used, or that the first element must somehow precede the second element.
Further, those of ordinary skill in the art would understand that information and signals may be represented using any of a variety of different technologies and techniques. For example, data, instructions, commands, information, signals, bits, and symbols (e.g., that may be referenced throughout the above description) may be represented by voltages, currents, electromagnetic waves, magnetic fields or particles, optical fields or particles, or any combination thereof.
Those of skill would further appreciate that any of the various illustrative logical blocks, units, processors, devices, circuits, methods, and functions described in connection with the aspects disclosed herein may be implemented with electronic hardware (e.g., digital implementations, analog implementations, or a combination of both), firmware, various forms of program or design code in connection with the instructions (which may be referred to herein as "software" or "a software element" for convenience), or any combination of these techniques.
To clearly illustrate this interchangeability of hardware, firmware, and software, various illustrative components, blocks, units, circuits, and steps have been described above generally in terms of their functionality. Whether such functionality is implemented as hardware, firmware, or software, or a combination of these techniques, depends upon the particular application and design constraints imposed on the overall system. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present disclosure. According to various embodiments, processors, devices, components, circuits, structures, machines, units, etc. may be configured to perform one or more of the functions described herein. The terms "configured" or "configured for" as used herein with respect to a particular operation or function refers to a processor, device, component, circuit, structure, machine, unit, etc. that is physically constructed, programmed, and/or arranged to perform the particular operation or function.
In addition, those of skill will appreciate that the various illustrative logical blocks, units, devices, components, and circuits described herein may be implemented within or performed by an Integrated Circuit (IC) that may comprise a general purpose processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA), or other programmable logic device, or any combination thereof. The logic blocks, units, and circuits may further comprise antennas and/or transceivers to communicate with various components within the network or within the device. A general purpose processor may be a microprocessor, but in the alternative, the processor may be any conventional processor, controller, or state machine. A processor may also be implemented as a combination of computing devices, e.g., a combination of a DSP and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a digital signal processor core, or any other suitable configuration to perform the functions described herein. If implemented in software, the functions may be stored on a computer-readable medium as one or more instructions or code. Thus, the steps of a method or algorithm disclosed herein may be embodied as software stored on a computer readable medium.
Computer-readable media includes both computer storage media and communication media including any medium that can be used to transfer a computer program or code from one place to another. A storage media may be any available media that can be accessed by a computer. By way of example, and not limitation, such computer-readable media can comprise RAM, ROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage or other magnetic storage devices, or any other medium that can be used to store desired program code in the form of instructions or data structures and that can be accessed by a computer.
In the present application, the term "unit" as used herein refers to software, firmware, hardware, and any combination of these elements for performing the associated functions described herein. Furthermore, for purposes of discussion, the various units are described as discrete modules; however, as will be apparent to one of ordinary skill in the art, two or more units may be combined to form a single unit that performs the associated function in accordance with embodiments of the disclosure.
Further, in embodiments of the present disclosure, memory or other storage devices and communication components may be employed. It should be understood that the above description has described embodiments of the present disclosure with reference to different functional units and processors for clarity. However, it will be apparent that any suitable distribution of functionality between different functional units, processing logic or domains may be used without detracting from the disclosure. For example, functions illustrated as being performed by separate processing logic elements or controllers may be performed by the same processing logic element or controller. Thus, references to specific functional units are only references to suitable means for providing the described functionality rather than indicative of a strict logical or physical structure or organization.
Various modifications to the embodiments described in the disclosure will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the scope of the disclosure. Thus, the present disclosure is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the novel features and principles disclosed herein, as set forth in the following claims.
Claims (22)
1. A wireless communication method for use in a network slice admission control function, the method comprising:
receiving a registration request associated with a wireless terminal and a network slice from a first access and mobility management function, wherein the registration request includes a wireless terminal identifier, a network slice identifier, and an indication to increase a number of wireless terminals registered with the network slice, and
a registration response is sent to the first access and mobility management function, the registration response indicating a first registration of the wireless terminal with the network slice, wherein the registration response includes first temporary information associated with the first registration.
2. The wireless communication method of claim 1, further comprising:
Receiving a deregistration request associated with the wireless terminal and the network slice from a second access and mobility management function, wherein the deregistration request includes second temporary information, the wireless terminal identifier and an indication to reduce the number of wireless terminals registered with the network slice, and
updating at least one of a list of wireless terminals registered with the network slice or a number of wireless terminals based on the first temporary information and the second temporary information.
3. The wireless communication method according to claim 2, wherein the first temporary information and the second temporary information are the same, and
updating at least one of the list of wireless terminals registered with the network slice or the number of wireless terminals based on the first temporary information and the second temporary information includes at least one of:
reducing the number of wireless terminals registered with the network slice, or
The wireless terminal is deleted from the list of wireless terminals registered with the network slice.
4. The wireless communication method according to claim 2, wherein the first temporary information and the second temporary information are different, and
Updating at least one of the list of wireless terminals registered with the network slice or the number of wireless terminals based on the first temporary information and the second temporary information includes at least one of:
ignoring the logout request, or
At least one of the list of wireless terminals registered with the network slice or the number of wireless terminals is maintained.
5. The wireless communication method according to any one of claims 1 to 4, wherein the wireless terminal registers with the network slice by a second registration or is in a list of the wireless terminals registered with the network slice before receiving the registration request.
6. The wireless communication method of claim 5, wherein third temporary information associated with the second registration is different from the first temporary information.
7. The wireless communication method of any of claims 1-4, wherein a number of wireless terminals registered with the network slice is less than a maximum threshold.
8. The wireless communication method of claim 7, wherein the wireless terminal is not registered with the network slice or is not in a list of the wireless terminals registered with the network slice.
9. The wireless communication method of any of claims 1-8, wherein the first temporary information is a timestamp or identifier associated with the first registration.
10. A wireless communication method for use in a first access and mobility management function, the method comprising:
transmitting a registration request associated with a wireless terminal and a network slice to a network slice admission control function, wherein the registration request includes a wireless terminal identifier, a network slice identifier, and an indication to increase the number of wireless terminals registered with the network slice, and
a registration response is received from the network slice admission control function indicating a first registration of the wireless terminal with the network slice,
wherein the registration response includes first temporary information associated with the first registration.
11. The wireless communication method of claim 10, further comprising:
a cancellation request associated with the wireless terminal and the network slice is sent to the network slice admission control function, wherein the cancellation request includes the first temporary information, the wireless terminal identifier, and an indication to reduce the number of wireless terminals registered with the network slice.
12. The wireless communication method according to claim 10 or 11, further comprising:
transmitting context information of the wireless terminal to a second access and mobility management function,
wherein the context information includes the first temporary information.
13. The wireless communication method of any of claims 10-12, wherein the first temporary information is a timestamp or identifier associated with the first registration.
14. A wireless communication method for use in access and mobility management functions, the method comprising:
a cancellation request associated with a wireless terminal and a network slice is sent to a network slice admission control function, wherein the cancellation request includes temporary information associated with registration of the wireless terminal with the network slice, the wireless terminal identifier, and an indication to reduce a number of wireless terminals registered with the network slice.
15. The wireless communication method of claim 14, wherein the temporary information is a timestamp or identifier associated with the registration.
16. A wireless device comprising a network slice admission control function, the wireless device comprising:
a communication unit configured to:
Receiving a registration request associated with a wireless terminal and a network slice from a first access and mobility management function, wherein the registration request includes a wireless terminal identifier, a network slice identifier, and an indication to increase a number of wireless terminals registered with the network slice, and
a registration response is sent to the first access and mobility management function indicating a first registration of the wireless terminal with the network slice, wherein the registration response includes first temporary information associated with the first registration.
17. The wireless device of claim 16, further comprising a processor configured to perform the wireless communication method of any of claims 2-9.
18. A wireless device comprising first access and mobility management functions, the wireless device comprising:
a communication unit configured to:
transmitting a registration request associated with a wireless terminal and a network slice to a network slice admission control function, wherein the registration request includes a wireless terminal identifier, a network slice identifier, and an indication to increase the number of wireless terminals registered with the network slice, and
A registration response is received from the network slice admission control function indicating a first registration of the wireless terminal with the network slice,
wherein the registration response includes first temporary information associated with the first registration.
19. The wireless device of claim 18, further comprising a processor configured to perform the wireless communication method of any of claims 11-13.
20. A wireless device comprising access and mobility management functions, the wireless device comprising:
a communication unit configured to send a deregistration request associated with a wireless terminal and a network slice to a network slice admission control function, wherein the deregistration request includes temporary information associated with registration of the wireless terminal with the network slice, the wireless terminal identifier, and an indication to reduce the number of wireless terminals registered with the network slice.
21. The wireless device of claim 20, further comprising a processor configured to perform the wireless communication method of claim 15.
22. A computer program product comprising computer readable program medium code stored thereon, which when executed by a processor causes the processor to implement the wireless communication method of any of claims 1 to 15.
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
PCT/CN2021/092128 WO2022233030A1 (en) | 2021-05-07 | 2021-05-07 | A method for network slice admission control |
Publications (1)
Publication Number | Publication Date |
---|---|
CN117223351A true CN117223351A (en) | 2023-12-12 |
Family
ID=83932526
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202180097480.6A Pending CN117223351A (en) | 2021-05-07 | 2021-05-07 | Method for network slice admission control |
Country Status (2)
Country | Link |
---|---|
CN (1) | CN117223351A (en) |
WO (1) | WO2022233030A1 (en) |
Family Cites Families (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
KR102164230B1 (en) * | 2017-06-17 | 2020-10-12 | 엘지전자 주식회사 | Terminal registration method and apparatus therefor in wireless communication system |
CN109257815B (en) * | 2017-07-14 | 2021-01-22 | 电信科学技术研究院 | Management method and device for registration request |
CN109462885B (en) * | 2018-12-14 | 2021-09-24 | 维沃移动通信有限公司 | Network slice registration method and terminal |
-
2021
- 2021-05-07 WO PCT/CN2021/092128 patent/WO2022233030A1/en active Application Filing
- 2021-05-07 CN CN202180097480.6A patent/CN117223351A/en active Pending
Also Published As
Publication number | Publication date |
---|---|
WO2022233030A1 (en) | 2022-11-10 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
KR102437811B1 (en) | Method and apparatus for session management function selection | |
US20220116816A1 (en) | Method of authorization for network slicing | |
CN117320091A (en) | Session processing method and related equipment | |
WO2012051890A1 (en) | Terminal access limit method and system | |
CN114270900B (en) | Method and computer readable medium for registration via access and mobility management function reassignment | |
US20230379704A1 (en) | Method for slice-specific authentication and authorization status transmission | |
KR20220166294A (en) | Method for Updating Slice Information | |
US20220400460A1 (en) | Communication method for controlling packet data unit session | |
WO2018205145A1 (en) | Method and apparatus for allocating registration area | |
WO2023044616A1 (en) | Intermediate session management function failure and restoration | |
WO2022233030A1 (en) | A method for network slice admission control | |
CN118339918A (en) | Service processing method for QUIC application | |
CN103188728A (en) | Network congestion control method and network congestion control system | |
US20240022999A1 (en) | Systems and methods for 5g core network access control | |
US20230328508A1 (en) | Method for transmitting radio node information | |
US20240236668A9 (en) | Method, device and computer program product for wireless communication | |
US20240314886A1 (en) | Method for slice resource release | |
US20230284128A1 (en) | Method of slice support for vehicle-to-everything service | |
WO2022232999A1 (en) | A method for session management function relocation | |
CN117957879A (en) | Access type-based network slice access control method | |
CN118355694A (en) | Method for slice resource release | |
CN117561750A (en) | Methods, apparatus and computer program products for wireless communication |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PB01 | Publication | ||
PB01 | Publication | ||
SE01 | Entry into force of request for substantive examination | ||
SE01 | Entry into force of request for substantive examination |