[go: up one dir, main page]

WO2025052436A1 - Procédé et système de découverte d'une ou de plusieurs fonctions de réseau homologues - Google Patents

Procédé et système de découverte d'une ou de plusieurs fonctions de réseau homologues Download PDF

Info

Publication number
WO2025052436A1
WO2025052436A1 PCT/IN2024/051629 IN2024051629W WO2025052436A1 WO 2025052436 A1 WO2025052436 A1 WO 2025052436A1 IN 2024051629 W IN2024051629 W IN 2024051629W WO 2025052436 A1 WO2025052436 A1 WO 2025052436A1
Authority
WO
WIPO (PCT)
Prior art keywords
nfs
peer
network
discovery
discovery request
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
Application number
PCT/IN2024/051629
Other languages
English (en)
Inventor
Aayush Bhatnagar
Birendra Singh Bisht
Harbinder Pal Singh
Durgesh RAJESH
Venkatakrishna Banka
Sunny DEVAL
Pradeep Kumar
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Jio Platforms Ltd
Original Assignee
Jio Platforms Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Jio Platforms Ltd filed Critical Jio Platforms Ltd
Publication of WO2025052436A1 publication Critical patent/WO2025052436A1/fr
Pending legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/50—Network services
    • H04L67/51—Discovery or management thereof, e.g. service location protocol [SLP] or web services
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W8/00—Network data management
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/14—Session management

Definitions

  • Embodiment of the present disclosure generally relate to a field of wireless communication. More particularly, the present disclosure relates to a method and a system for discovery of one or more peer network functions (NFs).
  • NFs peer network functions
  • Wireless communication technology has rapidly evolved over the past few decades, with each generation bringing significant improvements and advancements.
  • the first generation of wireless communication technology was based on analog technology and offered only voice services.
  • 2G second generation
  • 3G third generation
  • 4G fourth generation
  • the fourth generation (4G) technology revolutionized wireless communication with faster data speeds, better network coverage, and improved security.
  • 5G fifth generation
  • wireless communication technology has become more advanced, sophisticated, and capable of delivering more services to its users.
  • the 5G core networks are based on service-based architecture (SBA) that is centred around network function (NF) services.
  • SBA Service-Based Architecture
  • NFs network function
  • NFs network function
  • SBA Service-Based Architecture
  • NFs Network Functions
  • NRF Network Repository Function
  • the NRF therefore supports functions related to 1) maintaining the profiles of the available network function (NF) instances and their supported services in the 5G core network, 2) allowing NF instances to discover other NF instances in the 5G core network, and 3) allowing the NF instances to track the status of other NF instances.
  • NF network function
  • An aspect of the present disclosure may relate to a method for discovery of one or more peer network functions (NFs).
  • the method comprises identifying, by an identification unit at a first Network Function (NF), one or more peer Network Functions (NFs) using one or more call procedures, wherein the one or more peer NFs communicate with each other.
  • the method further comprises transmitting, by a transceiver unit at the first NF, at a start-up event, a discovery request to a Network Repository Function (NRF), wherein the discovery request is used for discovering one or more peer NFs.
  • the method further comprises receiving, by the transceiver unit at the first NF, a discovery response from the NRF, wherein the discovery response comprises data corresponding to one or more peer NFs.
  • NRF Network Repository Function
  • the method further comprises storing, by a storage unit at the first NF, the data corresponding to one or more peer NFs to be used at runtime during traffic call flow.
  • each of the first NF and the one or more peer NFs is one of an Access and Mobility Management Function (AMF) and a Session Management Function (SMF).
  • AMF Access and Mobility Management Function
  • SMF Session Management Function
  • the first network function is associated with one or more Public Land Mobile Networks (PLMNs).
  • PLMNs Public Land Mobile Networks
  • the one or more peer NFs are configured to communicate with the first NF.
  • the start-up event is a registration of a User Equipment (UE) with a network, a Packet Data Unit (PDU) session setup, and a combination thereof.
  • UE User Equipment
  • PDU Packet Data Unit
  • the discovery request is a GET request, and wherein the discovery request comprises a PLMN ID.
  • the discovery request is used for discovering one or more peer NFs associated with each of a plurality of PLMNs associated with the first NF.
  • the discovery response is a HTTP 200 OK response, and wherein the discovery response comprises a set of data related to one or more peer NFs associated with at least a PLMN ID included in the discovery request.
  • storing, by the storage unit, the data corresponding to one or more peer NFs comprises storing the data corresponding to one or more peer NFs associated with the PLMN ID included in the discovery request.
  • the system may comprise a first Network Function (NF).
  • the first NF may include an identification unit.
  • the identification unit may be configured to identify one or more peer Network Functions (NF s) using one or more call procedures, wherein the one or more peer NFs communicate with each other.
  • the first NF may further include a transceiver unit connected to at least the identification unit.
  • the transceiver unit may be configured to transmit, at a start-up event, a discovery request to a Network Repository Function (NRF), wherein the discovery request is used for discovering one or more peer NFs.
  • NRF Network Repository Function
  • the transceiver unit may be further configured to receive a discovery response from the NRF, wherein the discovery response comprises data corresponding to one or more peer NFs.
  • the first NF may further include a storage unit connected to at least the identification unit and the transceiver unit.
  • the storage unit may be configured to store the data corresponding to one or more peer NFs to be used at runtime during traffic call flow.
  • Yet another aspect of the present disclosure may relate to a non-transitory computer- readable storage medium storing instructions for discovery of one or more peer network functions (NFs).
  • the instructions include executable code which, when executed by one or more units of a system, causes an identification unit at a first Network Function of the system to identify one or more peer Network Functions (NFs) using one or more call procedures, wherein the one or more peer NFs communicate with each other.
  • the instructions include executable code which, when executed, causes a transceiver unit, at the first NF, to transmit, at a start-up event, a discovery request to a Network Repository Function (NRF), wherein the discovery request is used for discovering one or more peer NFs.
  • NRF Network Repository Function
  • the instructions include executable code which, when executed, causes the transceiver unit, at the first NF, to receive a discovery response from the NRF, wherein the discovery response comprises data corresponding to one or more peer NFs. Further, the instructions include executable code which, when executed, cause a storage unit, at the first NF, to store the data corresponding to one or more peer NFs to be used at runtime during traffic call flow.
  • FIG. 2 illustrates an exemplary block diagram of a computing device upon which the features of the present disclosure may be implemented, in accordance with exemplary implementation of the present disclosure
  • FIG. 3 illustrates an exemplary block diagram of a system for discovery of one or more peer network functions (NFs), in accordance with exemplary implementation of the present disclosure
  • FIG. 4 illustrates an exemplary signalling flow diagram depicting a process for discovery of one or more peer network functions (NFs), in accordance with exemplary implementation of the present disclosure
  • exemplary and/or “demonstrative” is used herein to mean serving as an example, instance, or illustration.
  • the subject matter disclosed herein is not limited by such examples.
  • any aspect or design described herein as “exemplary” and/or “demonstrative” is not necessarily to be construed as preferred or advantageous over other aspects or designs, nor is it meant to preclude equivalent exemplary structures and techniques known to those of ordinary skill in the art.
  • the terms “includes,” “has,” “contains,” and other similar words are used in either the detailed description or the claims, such terms are intended to be inclusive in a manner similar to the term “comprising” as an open transition word without precluding any additional or other elements.
  • a “processing unit” or “processor” or “operating processor” includes one or more processors, wherein processor refers to any logic circuitry for processing instructions.
  • a processor may be a general-purpose processor, a special purpose processor, a conventional processor, a digital signal processor, a plurality of microprocessors, one or more microprocessors in association with a Digital Signal Processing (DSP) core, a controller, a microcontroller, Application Specific Integrated Circuits, Field Programmable Gate Array circuits, any other type of integrated circuits, etc.
  • DSP Digital Signal Processing
  • the processor may perform signal coding data processing, input/output processing, and/or any other functionality that enables the working of the system according to the present disclosure. More specifically, the processor or processing unit is a hardware processor.
  • a user equipment may be any electrical, electronic and/or computing device or equipment, capable of implementing the features of the present disclosure.
  • the user equipment/device may include, but is not limited to, a mobile phone, smart phone, laptop, a general-purpose computer, desktop, personal digital assistant, tablet computer, wearable device or any other computing device which is capable of implementing the features of the present disclosure.
  • the user device may contain at least one input means configured to receive an input from unit(s) which are required to implement the features of the present disclosure.
  • storage unit or “memory unit” refers to a machine or computer-readable medium including any mechanism for storing information in a form readable by a computer or similar machine.
  • a computer-readable medium includes read-only memory (“ROM”), random access memory (“RAM”), magnetic disk storage media, optical storage media, flash memory devices or other types of machine-accessible storage media.
  • the storage unit stores at least the data that may be required by one or more units of the system to perform their respective functions.
  • interface refers to a shared boundary across which two or more separate components of a system exchange information or data.
  • the interface may also be referred to a set of rules or protocols that define communication or interaction of one or more modules or one or more units with each other, which also includes the methods, functions, or procedures that may be called.
  • All modules, units, components used herein, unless explicitly excluded herein, may be software modules or hardware processors, the processors being a general-purpose processor, a special purpose processor, a conventional processor, a digital signal processor (DSP), a plurality of microprocessors, one or more microprocessors in association with a DSP core, a controller, a microcontroller, Application Specific Integrated Circuits (ASIC), Field Programmable Gate Array circuits (FPGA), any other type of integrated circuits, etc.
  • DSP digital signal processor
  • ASIC Application Specific Integrated Circuits
  • FPGA Field Programmable Gate Array circuits
  • the transceiver unit include at least one receiver and at least one transmitter configured respectively for receiving and transmitting data, signals, information or a combination thereof between units/components within the system and/or connected with the system.
  • the present disclosure aims to overcome the above-mentioned and other existing problems in this field of technology by providing method and system for discovery of one or more peer network functions. More particularly, the present disclosure provides a solution to reduce network latency and overall call setup time. Further, the present disclosure provides a solution to discover the network functions (NFs) at call startup time. Furthermore, the present disclosure provides a solution to remove the need to discover the peer network functions at runtime.
  • NFs network functions
  • the 5GC network architecture [100] includes a user equipment (UE) [102], a radio access network (RAN) [104], an access and mobility management function (AMF) [106], a Session Management Function (SMF) [108], a Service Communication Proxy (SCP) [110], an Authentication Server Function (AUSF) [112], a Network Slice Specific Authentication and Authorization Function (NSSAAF) [114], a Network Slice Selection Function (NSSF) [116], a Network Exposure Function (NEF) [118], a Network Repository Function (NRF) [120], a Policy Control Function (PCF) [122], a Unified Data Management (UDM) [124], an application function (AF) [126], a User Plane Function (UPF) [128], a data network (DN) [130], wherein all the
  • Radio Access Network (RAN) is the part of a mobile telecommunications system that connects user equipment (UE) [102] to the core network (CN) and provides access to different types of networks (e.g., 5G network). It consists of radio base stations and the radio access technologies that enable wireless communication.
  • Access and Mobility Management Function (AMF) is a 5G core network function responsible for managing access and mobility aspects, such as UE registration, connection, and reachability. It also handles mobility management procedures like handovers and paging.
  • Session Management Function (SMF) is a 5G core network function responsible for managing session-related aspects, such as establishing, modifying, and releasing sessions. It coordinates with the User Plane Function (UPF) for data forwarding and handles IP address allocation and QoS enforcement.
  • UPF User Plane Function
  • Service Communication Proxy (SCP) [110] is a network function in the 5G core network that facilitates communication between other network functions by providing a secure and efficient messaging service. It acts as a mediator for service-based interfaces.
  • AUSF Authentication Server Function
  • 5G core responsible for authenticating UEs during registration and providing security services. It generates and verifies authentication vectors and tokens.
  • NSSAAF Network Slice Specific Authentication and Authorization Function
  • Network Slice Selection Function (NSSF) [116] is a network function responsible for selecting the appropriate network slice for a UE based on factors such as subscription, requested services, and network policies.
  • Network Exposure Function (NEF) [118] is a network function that exposes capabilities and services of the 5G network to external applications, enabling integration with third-party services and applications.
  • Network Repository Function (NRF) [120] is a network function that acts as a central repository for information about available network functions and services. It facilitates the discovery and dynamic registration of network functions.
  • PCF Policy Control Function
  • Unified Data Management [124] is a network function that centralizes the management of subscriber data, including authentication, authorization, and subscription information.
  • Application Function (AF) is a network function that represents external applications interfacing with the 5G core network to access network capabilities and services.
  • UPF User Plane Function
  • Data Network (DN) refers to a network that provides data services to user equipment (UE) in a telecommunications system.
  • the data services may include but are not limited to Internet services, private data network related services.
  • the 5GC network architecture also comprises a plurality of interfaces for connecting the network functions with a network entity for performing the network functions.
  • the NSSF [116] is connected with the network entity via the interface denoted as (Nnssf) interface in FIG. 1.
  • the NEF [118] is connected with the network entity via the interface denoted as (Nnef) interface in FIG. 1.
  • the NRF [120] is connected with the network entity via the interface denoted as (Nnrf) interface in FIG. 1.
  • the PCF [122] is connected with the network entity via the interface denoted as (Npcf) interface in FIG. 1.
  • the UDM [124] is connected with the network entity via the interface denoted as (Nudm) interface in FIG. 1.
  • the AF [126] is connected with the network entity via the interface denoted as (Naf) interface in FIG. 1.
  • the NSSAAF [114] is connected with the network entity via the interface denoted as (Nnssaaf) interface in FIG. 1.
  • the AUSF [112] is connected with the network entity via the interface denoted as (Nausf) interface in FIG. 1.
  • the AMF [106] is connected with the network entity via the interface denoted as (Namf) interface in FIG. 1.
  • the SMF [108] is connected with the network entity via the interface denoted as (Nsmf) interface in FIG. 1.
  • the SMF [108] is connected with the UPF [128] via the interface denoted as (N4) interface in FIG. 1.
  • the UPF [128] is connected with the RAN [104] via the interface denoted as (N3) interface in FIG. 1.
  • the UPF [128] is connected with the DN [130] via the interface denoted as (N6) interface in FIG. 1.
  • the RAN [104] is connected with the AMF [106] via the interface denoted as (N2).
  • the AMF [106] is connected with the RAN [104] via the interface denoted as (Nl).
  • the UPF [128] is connected with other UPF [128] via the interface denoted as (N9).
  • the interfaces such as Nnssf, Nnef, Nnrf, Npcf, Nudm, Naf, Nnssaaf, Nausf, Namf, Nsmf, N9, N6, N4, N3, N2, and Nl can be referred to as a communication channel between one or more functions or modules for enabling exchange of data or information between such functions or modules, and network entities.
  • FIG. 3 an exemplary block diagram of a system for discovery of one or more peer network functions (NFs), in accordance with exemplary implementation of the present disclosure, is illustrated.
  • the system [300] may be in communication with other network entities/components known to a person skilled in the art. Such network entities/components have not been depicted in FIG. 3 and have not been explained here for the sake of brevity.
  • FIG. 4 illustrates an exemplary signalling flow diagram depicting a process for discovery of one or more peer network functions (NFs), in accordance with exemplary implementation of the present disclosure.
  • NFs peer network functions
  • FIG. 3 and FIG. 4 have been explained simultaneously and may be read in conjunction with each other.
  • the system [300] may include at least one identification unit [302], at least one transceiver unit [304], and at least one storage unit [306],
  • the system [300] may be implemented as a Network Function (NF), referred to as first Network Function (NF) [300A],
  • NF Network Function
  • the various aforementioned units, as shown in FIG. 3 may be a part of the first Network Function (NF).
  • the system [300] may be implemented within a Network Function (NF).
  • NF Network Function
  • various aforementioned units may be a part of the system [300] and the system [300] may be in communication with various other components of the Network Function (NF).
  • the system [300] may include a Network Function (NF), referred to as the first Network Function (NF) [300 A], along with other components in communication with the first NF [300A] (not depicted in FIG. 3).
  • NF Network Function
  • the various units may be a part of the first Network Function [300A]
  • system [300] all of the components/ units of the system [300] are assumed to be connected to each other unless otherwise indicated below. As shown in the FIG. 3, all units shown within the system [300] should also be assumed to be connected to each other. Also, in FIG. 3 only a few units are shown, however, the system [300] may comprise multiple such units or the system [300] may comprise any such numbers of said units, as required to implement the features of the present disclosure. Further, in an implementation, the system [300] may reside in a server or the network entity or the system [300] may be in communication with the network entity to implement the features as disclosed in the present disclosure.
  • the system [300] is configured for discovery of one or more peer network functions (NFs) with the help of the interconnection between the components/units of the system [300],
  • NFs peer network functions
  • NF Network Function
  • peer NFs peer network functions
  • Examples of such first NF [300A] and other peer NFs in the network may include, but are not limited to, an Access and Mobility Management Function (AMF) and a Session Management Function (SMF).
  • AMF Access and Mobility Management Function
  • SMF Session Management Function
  • AMF and SMF have explained in conjunction with FIG. 1, as AMF [106] and SMF [108] respectively. The same explanation has not been repeated here for the sake of brevity.
  • the first network function [300A] may be associated with one or more Public Land Mobile Networks (PLMNs).
  • PLMN Public Land Mobile Networks
  • the PLMN is a combination of wireless services offered by one or more network operators to subscribers.
  • the PLMNs includes several cellular technologies, such as, but not limited to, GSM/2G, UMTS/3G, LTE/4G, NR/5G, etc., offered by at least one of the network operator from the one or more network operators.
  • one or more peer network functions may be communicating with the first Network Function (NF) [300A],
  • the first NF [300 A] and the plurality of peer network functions are part of a peer to peer (P2P) network, where all the network functions are connected to and communicate with each other.
  • the plurality of peer network functions may receive and send the information with each other directly without needing any central server.
  • every network function may be a client and a server.
  • NRF Network Repository Function
  • the discovery of one or more peer network functions (NFs), by a reference NF, the first NF [300A], is a process of finding other network functions in a network that are available for communication and compatible with the first NF [300A],
  • the identification unit [302], at the first NF [300A], may identify one or more peer network functions (NFs) using one or more call procedures. This has been depicted by Step 402 in FIG. 4.
  • the one or more peer NFs may be communicating with each other. Also, the one or more peer NFs are configured to communicate with the first NF [300A], The identification of the one or more peer NFs by the first NF [300] may allow the first NF [300 A] to identify the NFs in the network with which the first NF [300 A] may potentially communicate during the operation of the first NF [300 A] and its traffic call flow.
  • the identification unit [302] may identify the one or more peer NFs using one or more call procedures. Such call procedures may be based on the communication capabilities of the first NF [300 A] and the one or more peer NFs in the network. It may be further understood that such call procedures may be well understood to a person skilled in the art, and has not been explained here again.
  • the first NF [300 A] may one of the NF from the registered 100 NFs.
  • the first NF [300 A] may not be interested to communicate with all the other 99 registered NFs during the traffic call flow.
  • the first NF [300A] may only intend to communicate with few NFs from the registered 100 NFs registered in the NRF [120],
  • the first NF [300A] may identify, say, 20 NFs as relevant NFs.
  • the identified 20 NFs are the NFs with which the first NF [300A] may potentially communicate during its operation and runtime.
  • the subsequent steps involved with the present subject matter may be invoked at the time of the startup event.
  • the start-up event may be a UE registration request.
  • the start-up event may be a Packet Data Unit (PDU) session setup request.
  • PDU Packet Data Unit
  • the UE registration request is sent by the UE to the network to establish a connection with the network.
  • the UE may perform a Random-Access Procedure (RAP) to establish the connection with the network.
  • RAP Random-Access Procedure
  • the PDU session setup is a process of establishing a data path between the UE and a data network.
  • the PDU session is a logical connection that carries user data between the UE and the network.
  • the start up event may also include such as, but not limited to, the initiation of any service offered by the first NF [300A], communication with the user equipment by the first NF [300A], etc.
  • start-up events are only exemplary, and in no manner is to be construed to limit the scope of the present subject matter in any manner.
  • the subsequent steps involved with the present subject matter may be invoked at any other start-up event as well, and such examples would also lie within the scope of the present subject matter.
  • the transceiver unit [304] may transmit a discovery request to the Network Repository Function (NRF) [120], The discovery request may be used for discovering one or more peer NFs. This has been depicted as step 404 in FIG. 4.
  • NRF Network Repository Function
  • the NF [300A] may transmit the discovery request to the NRF to retrieve data related to the identified one or more peer NFs from the NRF [120], As described previously and would be understood, the NRF [120] may include the data corresponding to all the NFs registered in the network.
  • the discovery request may also include filter criteria such as, but not limited to, type of the network function, services offered by the network function, etc. Such filter criteria may allow efficient retrieval of data corresponding to relevant peer NFs, as required by the first NF [300A], [0091]
  • filter criteria e.g. "nf-type"
  • pagination parameters for the discovery request may be included in query parameters.
  • such filter criteria may allow the first NF [300A] to discover the set of peer NF Instances (and their associated NF Service Instances), represented by their NF Profile, that are currently registered in NRF and satisfy a number of input query parameters.
  • the discovery request may be a GET request.
  • the first NF [300A] may transmit the HTTP GET request to the resource URI "nf-instances" collection resource.
  • the discovery request may include a PLMN ID.
  • the PLMN ID is a numeric identifier assigned to the mobile network, uniquely identifying it among other mobile networks.
  • the PLMN ID consists of a Mobile Country Code (MCC) and a Mobile Network Code (MNC).
  • MCC Mobile Country Code
  • MNC Mobile Network Code
  • the MCC is a three-digit numeric code that uniquely identifies a country or a geographical area. Whereas the MNC is a two- or three- digit code that uniquely identifies a mobile network within the country.
  • the discovery request may be used for discovering one or more peer NFs associated with each of a plurality of PLMNs associated with the first NF [300A],
  • the first NF [300 A] may be associated with one or more PLMNs.
  • the first NF [300A] may have identified different peer NFs from different PLMNs. It may be noted and appreciated that inclusion of the PLMN ID in the discovery request may allow the NRF [120] to efficiently and precisely process the discovery request for discovery of one or more peer NFs, in a relevant PLMN, as required by the first NF [300A],
  • the same may be done by querying the "nf-instances" resource in the NRF of the Home PLMN.
  • the GET request may be transmitted to the NRF in the Serving PLMN, and this request may include the identity of the PLMN of the home NRF in a query parameter of the URI.
  • this scenario may be applicable for the use case where an NF (e.g. AMF) supports multiple PLMNs and the slices supported in each PLMN are different.
  • This IE may be included when NF services in a different PLMN, or NF services of specific PLMN ID(s) in a same PLMN comprising multiple PLMN IDs, need to be discovered. When included, this IE shall contain the PLMN ID of the target NF. If more than one PLMN ID is included, NFs from any PLMN ID present in the list matches the query parameter.
  • the transceiver unit [304] may then receive a discovery response from the NRF, wherein the discovery response may include data corresponding to one or more peer NFs. This has been depicted as Step 406 in FIG. 4.
  • the discovery response is a HTTP 200 OK response.
  • the discovery response may include the URI (conforming to the resource URI structure) of each registered NF in the NRF that satisfy the retrieval filter criteria (e.g., all NF instances of the same NF type).
  • the discovery response may include a set of data related to one or more peer NFs associated with at least a PLMN ID included in the discovery request.
  • the first NF [300A] while transmitting the discovery request, may include a PLMN ID in the request.
  • the first NF [300 A] may require data associate with the identified one or more peer NFs associated with the PLMN ID.
  • the NRF while providing the discovery response to the first NF [300A], may include the data of one or more peer NFs associated with said PLMN ID.
  • the data corresponding to the one or more peer NFs may include such as, but not limited to, NF ID that may uniquely identify the NF from other NFs, the type of services offered, the communication ports through which the first NF [300A] may communicate, etc.
  • NRF will return the NF profiles matching the search criteria indicated by the query parameters of the discovery request, e.g. all the list of ranges of SUPIs whose profile data is available in the UDM instance, etc.
  • the discovery response allows the retrieval of a list of NF Instances that are currently registered in NRF.
  • the storage unit [306] may store the data corresponding to one or more peer NFs to be used at runtime during traffic call flow.
  • the storage unit [306] may store the received set of data related to the peer NFs. This has been depicted as step 408 in FIG. 4.
  • the said set of data related to the one or more of peer NFs, received from the NRF [120], may be used by the first NF [300A] during a runtime during traffic call flow.
  • the first NF [300 A] may completely stores the data in the response message in the cache, therefore other SUPIs can be searched locally in the subsequent service discovery procedure, avoiding excessive signaling interaction with the NRF.
  • the discovery response may include a set of data corresponding to one or more peer NFs associated with one or more PLMNs.
  • a NF may register multiple PLMN IDs in its profile within a PLMN comprising multiple PLMN IDs. If so, all the attributes of the NF Profile shall apply to each PLMN ID registered in the plmnList.
  • attributes including a PLMN ID e.g. IMSI-based SUPI ranges, Tracking Area Identity (TAIs) and Globally Unique AMF (GUAMIs)
  • TAIs Tracking Area Identity
  • GUIAMF Globally Unique AMF
  • TAI may refer to a geographical region covered by one or more eNodeBs. TAI may be used in mobile networks to identify specific tracking area within a PMLN. Further, TAI helps in managing the mobility of UE within the network. Further, GUAMI may be used in 5G networks to uniquely identify the AMF serving a particular UE. GUAMI also helps in identifying and managing connections within the 5GC core network.
  • the storage unit [306] may store the data corresponding to one or more peer NFs associated with the PLMN ID included in the discovery request. It may be noted and appreciated that such selective storage may allow the storage unit to only store the data of peer NFs which was requested by the first NF [300A],
  • FIG. 5 an exemplary method flow diagram for discovery of one or more peer network functions (NFs), in accordance with exemplary implementation of the present disclosure is illustrated.
  • the method [500] is performed by the system [300], Also, as shown in FIG. 5, the method [500] initiates at step [502],
  • the method comprises identifying, by an identification unit [302], one or more peer Network Functions (NFs) using one or more call procedures.
  • the one or more peer NFs may be communicating with each other.
  • one or more peer network functions may be communicating with the first Network Function (NF) [300A],
  • the first NF [300A] and the plurality of peer network functions are part of a peer to peer (P2P) network, where all the network functions are connected to and communicate with each other.
  • P2P peer to peer
  • NFs Network Functions
  • NRF Network Repository Function
  • the identification unit [302], at the first NF [300A], may identify one or more peer network functions (NFs) using one or more call procedures.
  • NFs peer network functions
  • the identification unit [302] may identify the one or more peer NFs using one or more call procedures. Such call procedures may be based on the communication capabilities of the first NF [300 A] and the one or more peer NFs in the network.
  • the method comprises transmitting, by a transceiver unit [304], at a start-up event, a discovery request to a Network Repository Function (NRF).
  • the discovery request may be used for discovering one or more peer NFs.
  • the subsequent steps involved with the present subject matter may be invoked at the time of the startup event.
  • the start-up event may be a UE registration request.
  • the start-up event may be a Packet Data Unit (PDU) session setup request.
  • PDU Packet Data Unit
  • the start up event may also include such as, but not limited to, the initiation of any service offered by the first NF [300A], communication with the user equipment by the first NF [300A], etc.
  • start-up events are only exemplary, and in no manner is to be construed to limit the scope of the present subject matter in any manner.
  • the subsequent steps involved with the present subject matter may be invoked at any other start-up event as well, and such examples would also lie within the scope of the present subject matter.
  • the transceiver unit [304] may transmit a discovery request to the Network Repository Function (NRF) [120], The discovery request may be used for discovering one or more peer NFs.
  • NRF Network Repository Function
  • the NF [300A] may transmit the discovery request to the NRF to retrieve data related to the identified one or more peer NFs from the NRF [120], As described previously and would be understood, the NRF [120] may include the data corresponding to all the NFs registered in the network.
  • the discovery request may also include filter criteria such as, but not limited to, type of the network function, services offered by the network function, etc.
  • filter criteria may allow efficient retrieval of data corresponding to relevant peer NFs, as required by the first NF [300A],
  • the discovery request may be a GET request.
  • the discovery request may include a PLMN ID.
  • the discovery request may be used for discovering one or more peer NFs associated with each of a plurality of PLMNs associated with the first NF [300A],
  • the first NF [300A] may be associated with one or more PLMNs.
  • the first NF [300A] may have identified different peer NFs from different PLMNs. It may be noted and appreciated that inclusion of the PLMN ID in the discovery request may allow the NRF [120] to efficiently and precisely process the discovery request for discovery of one or more peer NFs, in a relevant PLMN, as required by the first NF [300A],
  • the method [500] comprises receiving, by the transceiver unit [304], a discovery response from the NRF.
  • the discovery response may include data corresponding to one or more peer NFs.
  • the transceiver unit [304] may then receive a discovery response from the NRF, wherein the discovery response may include data corresponding to one or more peer NFs.
  • the discovery response is a HTTP 200 OK response.
  • the discovery response may include a set of data related to one or more peer NFs associated with at least a PLMN ID included in the discovery request.
  • the first NF [300A] while transmitting the discovery request, may include a PLMN ID in the request.
  • the first NF [300 A] may require data associate with the identified one or more peer NFs associated with the PLMN ID.
  • the NRF, while providing the discovery response to the first NF [300A] may include the data of one or more peer NFs associated with said PLMN ID.
  • the data corresponding to the one or more peer NFs may include such as, but not limited to, NF ID that may uniquely identify the NF from other NFs, the type of services offered, the communication ports through which the first NF [300A] may communicate, etc.
  • the method [500] comprises storing, by the storage unit [306], the data corresponding to one or more peer NFs to be used at runtime during traffic call flow.
  • the storage unit [306] may store the data corresponding to one or more peer NFs to be used at runtime during traffic call flow. As would be appreciated and noted, the storage unit [306] may store the received set of data related to the peer NFs. The said set of data related to the one or more of peer NFs, received from the NRF [120], may be used by the first NF [300 A] during a runtime during traffic call flow.
  • the discovery response may include a set of data corresponding to one or more peer NFs associated with one or more PLMNs.
  • the storage unit [306] may store the data corresponding to one or more peer NFs associated with the PLMN ID included in the discovery request. It may be noted and appreciated that such selective storage may allow the storage unit to only store the data of peer NFs which was requested by the first NF [300A],
  • the present disclosure further discloses a non-transitory computer-readable storage medium storing instructions for discovery of one or more peer network functions (NFs).
  • the instructions include executable code which, when executed by one or more units of a system [300], causes an identification unit [302] at a first Network Function [300 A] of the system [300] to identify one or more peer Network Functions (NFs) using one or more call procedures, wherein the one or more peer NFs communicate with each other.
  • the instructions include executable code which, when executed, causes a transceiver unit [304], at the first NF [300A], to transmit, at a start-up event, a discovery request to a Network Repository Function (NRF) [120], wherein the discovery request is used for discovering one or more peer NFs.
  • the instructions include executable code which, when executed, causes the transceiver unit [304], at the first NF [300A], to receive a discovery response from the NRF, wherein the discovery response comprises data corresponding to one or more peer NFs.
  • the instructions include executable code which, when executed, cause a storage unit [306], at the first NF [300A], to store the data corresponding to one or more peer NFs to be used at runtime during traffic call flow.
  • the present disclosure provides a technically advanced solution for discovery of one or more peer network functions (NFs). Further, the present solution reduces network latency and overall call setup time. Also, the present solution discovers the network functions (NFs) at call startup time. Furthermore, removes the need to discover the peer network functions at runtime.
  • NFs peer network functions

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Databases & Information Systems (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

La présente divulgation se rapporte à un procédé [500] et à un système [300] de découverte d'une ou de plusieurs fonctions de réseau (NF) homologues. Le procédé [500] consiste à identifier [504], au moyen d'une unité d'identification [302] au niveau d'une première NF [300A], une ou plusieurs NF homologues à l'aide d'une ou de plusieurs procédures d'appel. La ou les NF homologues peuvent communiquer les unes avec les autres. Le procédé consiste en outre à transmettre, lors d'un événement de démarrage, une demande de découverte à une NRF. La demande de découverte peut être utilisée pour découvrir une ou plusieurs NF homologues. Le procédé consiste en outre à recevoir une réponse de découverte en provenance de la NRF. La réponse de découverte peut comprendre des données correspondant à une ou plusieurs NF homologues. Le procédé consiste ensuite à stocker les données correspondant à une ou plusieurs NF homologues à utiliser au moment de l'exécution pendant un flux d'appel de trafic.
PCT/IN2024/051629 2023-09-06 2024-09-04 Procédé et système de découverte d'une ou de plusieurs fonctions de réseau homologues Pending WO2025052436A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
IN202321059959 2023-09-06
IN202321059959 2023-09-06

Publications (1)

Publication Number Publication Date
WO2025052436A1 true WO2025052436A1 (fr) 2025-03-13

Family

ID=94923721

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/IN2024/051629 Pending WO2025052436A1 (fr) 2023-09-06 2024-09-04 Procédé et système de découverte d'une ou de plusieurs fonctions de réseau homologues

Country Status (1)

Country Link
WO (1) WO2025052436A1 (fr)

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20220038999A1 (en) * 2020-07-29 2022-02-03 Oracle International Corporation Methods, systems, and computer readable media for providing network function discovery service enhancements

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20220038999A1 (en) * 2020-07-29 2022-02-03 Oracle International Corporation Methods, systems, and computer readable media for providing network function discovery service enhancements

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
"3rd Generation Partnership Project; Technical Specification Group Services and System Aspects; System architecture for the 5G System (5GS); Stage 2 (Release 15)", 3GPP STANDARD; 3GPP TS 23.501, 3RD GENERATION PARTNERSHIP PROJECT (3GPP), MOBILE COMPETENCE CENTRE ; 650, ROUTE DES LUCIOLES ; F-06921 SOPHIA-ANTIPOLIS CEDEX ; FRANCE, vol. SA WG2, no. V15.13.0, 23 March 2022 (2022-03-23), Mobile Competence Centre ; 650, route des Lucioles ; F-06921 Sophia-Antipolis Cedex ; France, pages 1 - 250, XP052144757 *

Similar Documents

Publication Publication Date Title
WO2025052436A1 (fr) Procédé et système de découverte d'une ou de plusieurs fonctions de réseau homologues
WO2025069062A1 (fr) Procédé et système de continuité de service dans un réseau de communication
WO2025052421A1 (fr) Procédé et système de traitement des demandes de localisation dans un réseau de communication sans fil
EP4255001A1 (fr) Mécanisme d'accès à des données d'abonnement
WO2025012979A1 (fr) Procédé et système aux fins d'une gestion basée sur la configuration d'une demande de procédure
WO2025008876A1 (fr) Procédé et système de mise sur liste d'autorisation de dispositifs compatibles avec vowifi
WO2025008863A1 (fr) Procédé et système d'octroi d'un accès à un trafic de données associé à un réseau cible
WO2025008929A1 (fr) Procédé et système de sélection d'un domaine pour terminer un message
WO2025017686A1 (fr) Procédé et système de fourniture d'informations de tranche dans un réseau de communication
WO2025069063A1 (fr) Procédé et système pour intégrer une fonction de référentiel de réseau à un proxy de protection de la périphérie du réseau
WO2025017730A1 (fr) Procédé et système de gestion de données de configuration de distribution de données non ip (nidd)
WO2025008953A1 (fr) Procédé et système d'activation d'un ou de plusieurs services de communication
WO2025052474A1 (fr) Procédé et système permettant de gérer un abonnement de fonctions de réseau
WO2025008865A1 (fr) Procédé et système pour fournir une notification d'abonnement dans un réseau de communication
WO2025013017A1 (fr) Procédé et système permettant de transmettre une demande de protocole d'initiation de session à un serveur d'abonné domestique
WO2025012943A1 (fr) Procédé et système de création d'un contexte de gestion de session (sm) dans un premier et un second réseau
WO2025057211A1 (fr) Procédé et système de gestion de demandes de service dans un réseau
WO2025052438A1 (fr) Procédé et système de réduction de défaillance de demande entre un nœud gmlc et des nœuds de réseau
WO2025057183A1 (fr) Procédé et système pour établir une connexion entre un équipement utilisateur et un réseau
WO2025013048A1 (fr) Procédé et système de mise à jour de paramètres pour un ou plusieurs nœuds réseau
WO2025052399A1 (fr) Procédé et système d'enregistrement d'un équipement utilisateur
WO2025008978A1 (fr) Procédé et système pour lister des dispositifs pour optimiser l'attribution d'adresses ipv4 et ipv6
WO2025012972A1 (fr) Procédé et système de fourniture d'informations de tranche dans un réseau de communication
WO2025012923A1 (fr) Procédé et système de synchronisation en temps réel d'une ou de plusieurs entités de réseau
WO2025052420A1 (fr) Procédé et système d'établissement d'une session de réseau au niveau d'une fonction de support de liaison (bsf)

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 24862283

Country of ref document: EP

Kind code of ref document: A1