FORM 2
THE PATENTS ACT, 1970 (39 OF 1970) & THE PATENT RULES, 2003
COMPLETE SPECIFICATION
(See section 10 and rule 13)
“METHOD AND SYSTEM FOR DISCOVERY OF ONE OR MORE PEER NETWORK FUNCTIONS”
We, Jio Platforms Limited, an Indian National, of Office - 101, Saffron, Nr. Centre Point, Panchwati 5 Rasta, Ambawadi, Ahmedabad - 380006, Gujarat, India.
The following specification particularly describes the invention and the manner in which it is to be performed.

METHOD AND SYSTEM FOR DISCOVERY OF ONE OR MORE PEER
NETWORK FUNCTIONS
FIELD OF INVENTION
[0001] 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).
BACKGROUND
[0002] The following description of the related art is intended to provide background information pertaining to the field of the disclosure. This section may include certain aspects of the art that may be related to various features of the present disclosure. However, it should be appreciated that this section is used only to enhance the understanding of the reader with respect to the present disclosure, and not as admissions of the prior art.
[0003] 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. However, with the advent of the second generation (2G) technology, digital communication and data services became possible, and text messaging was introduced. The third generation (3G) technology marked the introduction of high-speed internet access, mobile video calling, and location-based services. The fourth generation (4G) technology revolutionized wireless communication with faster data speeds, better network coverage, and improved security. Currently, the fifth generation (5G) technology is being deployed, promising even faster data speeds, low latency, and the ability to connect multiple devices simultaneously. With each generation, wireless communication technology has become more advanced, sophisticated, and capable of delivering more services to its users.

[0004] Moreover, the 5G core networks are based on service‐based architecture (SBA) that is centred around network function (NF) services. In the said Service‐ Based Architecture (SBA), a set of interconnected Network Functions (NFs) delivers the control plane functionality and common data repositories of the 5G network, where each NF is authorized to access services of other NFs. Particularly, each NF can register itself and its supported services to a Network Repository Function (NRF), which is used by other NFs for the discovery of NF instances and their services. 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.
[0005] Currently, as soon as the NF is registered to the network repository function (NRF), various ways defined by the 3GPP standard are followed that enable an immediate traffic flow at the NF. Also, in the existing systems the discovery of peer NFs is done at runtime during a traffic call flow, which leads to an increase in network latency. Further, conventionally, there exists no solution that can deal with the limitations of the NF discovery at the runtime to reduce the network latency and to reduce an overall call setup time.
[0006] Hence, in view of these and other existing limitations, there arises an imperative need to provide an efficient solution to overcome the above-mentioned and other limitations and to provide a method and a system discovery of one or more peer network functions (NFs).
SUMMARY
[0007] This section is provided to introduce certain aspects of the present disclosure in a simplified form that are further described below in the detailed description.

This summary is not intended to identify the key features or the scope of the claimed subject matter.
[0008] 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. 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.
[0009] In an exemplary aspect of the present disclosure, 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).
[0010] In an exemplary aspect of the present disclosure, the first network function is associated with one or more Public Land Mobile Networks (PLMNs).
[0011] In an exemplary aspect of the present disclosure, the one or more peer NFs are configured to communicate with the first NF.
[0012] In an exemplary aspect of the present disclosure, 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.
[0013] In an exemplary aspect of the present disclosure, the discovery request is a GET request, and wherein the discovery request comprises a PLMN ID.

[0014] In an exemplary aspect of the present disclosure, 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.
[0015] In an exemplary aspect of the present disclosure, 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.
[0016] In an exemplary aspect of the present disclosure, 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.
[0017] Another aspect of the present disclosure relates to a system for discovery of one or more peer network functions (NFs). 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 (NFs) 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. 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.

[0018] 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
5 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. Further, 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),
10 wherein the discovery request is used for discovering one or more peer NFs.
Further, 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
15 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.
OBJECTS OF THE DISCLOSURE
20 [0019] Some of the objects of the present disclosure which at least one embodiment
disclosed herein satisfies are listed herein below.
[0020] It is an object of the present disclosure to provide a method and a system for
discovery of one or more peer network functions (NFs).
25
[0021] It is another object of the present disclosure to provide a solution to reduce
network latency and overall call setup time.
[0022] It is yet another object of the present disclosure to provide a solution to
30 discover network functions (NFs) at call startup time.
6

[0023] It is yet another object of the present disclosure to provide a solution to remove the need to discover the peer network functions at runtime.
DESCRIPTION OF DRAWINGS
5
[0024] The accompanying drawings, which are incorporated herein, and constitute a part of this disclosure, illustrate exemplary embodiments of the disclosed methods and systems in which like reference numerals refer to the same parts throughout the different drawings. Components in the drawings are not necessarily to scale,
10 emphasis instead being placed upon clearly illustrating the principles of the present
disclosure. Also, the embodiments shown in the figures are not to be construed as limiting the disclosure, but the possible variants of the method and system according to the disclosure are illustrated herein to highlight the advantages of the disclosure. It will be appreciated by those skilled in the art that disclosure of such
15 drawings includes disclosure of electrical components or circuitry commonly used
to implement such components.
[0025] FIG. 1 illustrates an exemplary block diagram representation of 5th generation core (5GC) network architecture; 20
[0026] 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;
25 [0027] 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;
[0028] FIG. 4 illustrates an exemplary signalling flow diagram depicting a process
30 for discovery of one or more peer network functions (NFs), in accordance with
exemplary implementation of the present disclosure; and
7

[0029] FIG.5 illustrates an exemplary method flow diagram for discovery of one or more peer network functions (NFs), in accordance with exemplary implementation of the present disclosure.
5 DETAILED DESCRIPTION
[0030] In the following description, for the purposes of explanation, various specific details are set forth in order to provide a thorough understanding of embodiments of the present disclosure. It will be apparent, however, that
10 embodiments of the present disclosure may be practiced without these specific
details. Several features described hereafter may each be used independently of one another or with any combination of other features. An individual feature may not address any of the problems discussed above or might address only some of the problems discussed above.
15
[0031] The ensuing description provides exemplary embodiments only, and is not intended to limit the scope, applicability, or configuration of the disclosure. Rather, the ensuing description of the exemplary embodiments will provide those skilled in the art with an enabling description for implementing an exemplary embodiment.
20 It should be understood that various changes may be made in the function and
arrangement of elements without departing from the spirit and scope of the disclosure as set forth.
[0032] Specific details are given in the following description to provide a thorough
25 understanding of the embodiments. However, it will be understood by one of
ordinary skill in the art that the embodiments may be practiced without these specific details. For example, circuits, systems, processes, and other components may be shown as components in block diagram form in order not to obscure the embodiments in unnecessary detail. 30
8

[0033] Also, it is noted that individual embodiments may be described as a process
which is depicted as a flowchart, a flow diagram, a data flow diagram, a structure
diagram, or a block diagram. Although a flowchart may describe the operations as
a sequential process, many of the operations may be performed in parallel or
5 concurrently. In addition, the order of the operations may be re-arranged. A process
is terminated when its operations are completed but could have additional steps not included in a figure.
[0034] The word “exemplary” and/or “demonstrative” is used herein to mean
10 serving as an example, instance, or illustration. For the avoidance of doubt, the
subject matter disclosed herein is not limited by such examples. In addition, 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
15 known to those of ordinary skill in the art. Furthermore, to the extent that 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.
20
[0035] As used herein, 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
25 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. The processor may perform signal coding data processing, input/output processing, and/or any other functionality that enables the working of
30 the system according to the present disclosure. More specifically, the processor or
processing unit is a hardware processor.
9

[0036] As used herein, “a user equipment”, “a user device”, “a smart-user-device”,
“a smart-device”, “an electronic device”, “a mobile device”, “a handheld device”,
“a wireless communication device”, “a mobile communication device”, “a
5 communication device” 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
10 of implementing the features of the present disclosure. Also, 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.
[0037] As used herein, “storage unit” or “memory unit” refers to a machine or
15 computer-readable medium including any mechanism for storing information in a
form readable by a computer or similar machine. For example, 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
20 that may be required by one or more units of the system to perform their respective
functions.
[0038] As used herein “interface” or “user interface refers to a shared boundary
across which two or more separate components of a system exchange information
25 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.
30 [0039] 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
10

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.
5
[0040] As used herein 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.
10
[0041] As discussed in the background section, in the existing systems the
discovery of peer NFs is done at runtime during a traffic call flow, which leads to
an increase in network latency. Further, there exists no solution that can deal with
the limitations of the NF discovery at the runtime to reduce the network latency and
15 to reduce an overall call setup time.
[0042] 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
20 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.
25 [0043] Hereinafter, exemplary embodiments of the present disclosure will be
described with reference to the accompanying drawings.
[0044] Referring to FIG. 1, an exemplary block diagram representation of 5th
generation core (5GC) network architecture, in accordance with exemplary
30 implementation of the present disclosure, is shown. As depicted in FIG. 1, 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],
11

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],
5 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 components are assumed to be connected to each other in a manner as obvious
to the person skilled in the art for implementing features of the present disclosure.
10
[0045] Radio Access Network (RAN) [104] 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
15 wireless communication.
[0046] Access and Mobility Management Function (AMF) [106] 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
20 procedures like handovers and paging.
[0047] Session Management Function (SMF) [108] 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
25 forwarding and handles IP address allocation and QoS enforcement.
[0048] 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
30 service-based interfaces.
12

[0049] Authentication Server Function (AUSF) [112] is a network function in the 5G core responsible for authenticating UEs during registration and providing security services. It generates and verifies authentication vectors and tokens.
5 [0050] Network Slice Specific Authentication and Authorization Function
(NSSAAF) [114] is a network function that provides authentication and authorization services specific to network slices. It ensures that UEs can access only the slices for which they are authorized.
10 [0051] 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.
[0052] Network Exposure Function (NEF) [118] is a network function that
15 exposes capabilities and services of the 5G network to external applications,
enabling integration with third-party services and applications.
[0053] Network Repository Function (NRF) [120] is a network function that acts
as a central repository for information about available network functions and
20 services. It facilitates the discovery and dynamic registration of network functions.
[0054] Policy Control Function (PCF) [122] is a network function responsible for policy control decisions, such as QoS, charging, and access control, based on subscriber information and network policies. 25
[0055] Unified Data Management (UDM) [124] is a network function that centralizes the management of subscriber data, including authentication, authorization, and subscription information.
30 [0056] Application Function (AF) [126] is a network function that represents
external applications interfacing with the 5G core network to access network capabilities and services.
13

[0057] User Plane Function (UPF) [128] is a network function responsible for handling user data traffic, including packet routing, forwarding, and QoS enforcement.
5 [0058] Data Network (DN) [130] 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.
[0059] The 5GC network architecture also comprises a plurality of interfaces for connecting the network functions with a network entity for performing the network
10 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
15 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
20 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]
25 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 (N1). The UPF [128] is connected with other UPF [128] via
30 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 N1 can be
14

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.
[0060] Referring to FIG. 2, an exemplary block diagram of a computing device
5 [200] upon which the features of the present disclosure may be implemented, in
accordance with exemplary implementation of the present disclosure, is shown. In
an implementation, the computing device [200] may implement a method for
handling an overload condition in a network by utilising a system. In another
implementation, the computing device [200] itself implements the method for
10 handling an overload condition in a network using one or more units configured
within the computing device [200], wherein said one or more units are capable of implementing the features as disclosed in the present disclosure.
[0061] The computing device [200] may include a bus [202] or other
15 communication mechanism for communicating information, and a hardware
processor [204] coupled with bus [202] for processing information. The hardware
processor [204] may be, for example, a general-purpose microprocessor. The
computing device [200] may also include a main memory [206], such as a random-
access memory (RAM), or other dynamic storage device, coupled to the bus [202]
20 for storing information and instructions to be executed by the processor [204]. The
main memory [206] also may be used for storing temporary variables or other
intermediate information during execution of the instructions to be executed by the
processor [204]. Such instructions, when stored in non-transitory storage media
accessible to the processor [204], render the computing device [200] into a special-
25 purpose machine that is customized to perform the operations specified in the
instructions. The computing device [200] further includes a read only memory
(ROM) [208] or other static storage device coupled to the bus [202] for storing static
information and instructions for the processor [204].
15

[0062] A storage device [210], such as a magnetic disk, optical disk, or solid-state
drive is provided and coupled to the bus [202] for storing information and
instructions. The computing device [200] may be coupled via the bus [202] to a
display [212], such as a cathode ray tube (CRT), Liquid crystal Display (LCD),
5 Light Emitting Diode (LED) display, Organic LED (OLED) display, etc. for
displaying information to a computer user. An input device [214], including
alphanumeric and other keys, touch screen input means, etc. may be coupled to the
bus [202] for communicating information and command selections to the processor
[204]. Another type of user input device may be a cursor controller [216], such as a
10 mouse, a trackball, or cursor direction keys, for communicating direction
information and command selections to the processor [204], and for controlling
cursor movement on the display [212]. The input device typically has two degrees
of freedom in two axes, a first axis (e.g., x) and a second axis (e.g., y), that allow
the device to specify positions in a plane.
15
[0063] The computing device [200] may implement the techniques described
herein using customized hard-wired logic, one or more ASICs or FPGAs, firmware
and/or program logic which in combination with the computing device [200] causes
or programs the computing device [200] to be a special-purpose machine.
20 According to one implementation, the techniques herein are performed by the
computing device [200] in response to the processor [204] executing one or more sequences of one or more instructions contained in the main memory [206]. Such instructions may be read into the main memory [206] from another storage medium, such as the storage device [210]. Execution of the sequences of instructions
25 contained in the main memory [206] causes the processor [204] to perform the
process steps described herein. In alternative implementations of the present disclosure, hard-wired circuitry may be used in place of or in combination with software instructions.
30 [0064] The computing device [200] also may include a communication interface
[218] coupled to the bus [202]. The communication interface [218] provides a two-
16

way data communication coupling to a network link [220] that is connected to a
local network [222]. For example, the communication interface [218] may be an
integrated services digital network (ISDN) card, cable modem, satellite modem, or
a modem to provide a data communication connection to a corresponding type of
5 telephone line. As another example, the communication interface [218] may be a
local area network (LAN) card to provide a data communication connection to a
compatible LAN. Wireless links may also be implemented. In any such
implementation, the communication interface [218] sends and receives electrical,
electromagnetic or optical signals that carry digital data streams representing
10 various types of information.
[0065] The computing device [200] can send messages and receive data, including
program code, through the network(s), the network link [220] and the
communication interface [218]. In the Internet example, a server [230] might
15 transmit a requested code for an application program through the Internet [228], the
ISP [226], a host [224], the local network [222] and the communication interface
[218]. The received code may be executed by the processor [204] as it is received,
and/or stored in the storage device [210], or other non-volatile storage for later
execution.
20
[0066] Referring to 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. In one example, the system
[300] may be in communication with other network entities/components known to
25 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.
[0067] Further, FIG. 4 illustrates an exemplary signalling flow diagram depicting
a process for discovery of one or more peer network functions (NFs), in accordance
30 with exemplary implementation of the present disclosure.
17

[0068] It may be noted that FIG. 3 and FIG. 4 have been explained simultaneously and may be read in conjunction with each other.
[0069] As depicted in FIG. 3, the system [300] may include at least one
5 identification unit [302], at least one transceiver unit [304], and at least one storage
unit [306]. In one example, the system [300] may be implemented as a Network
Function (NF), referred to as first Network Function (NF) [300A]. In such cases,
the various aforementioned units, as shown in FIG. 3, may be a part of the first
Network Function (NF). In another example, the system [300] may be implemented
10 within a Network Function (NF). In such cases, 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).
[0070] In yet another example, as depicted in FIG. 3, the system [300] may include
15 a Network Function (NF), referred to as the first Network Function (NF) [300A],
along with other components in communication with the first NF [300A] (not depicted in FIG. 3). In such cases, as depicted in FIG 3, the various units may be a part of the first Network Function [300A].
20 [0071] Continuing further, also, 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
25 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.
30 [0072] 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].
18

[0073] It may be noted that the present description has been explained with respect
to a first Network Function (NF) [300A] discovering its peer network functions
(NFs). It may also be noted that, for a reference NF in a network, referred to as the
5 first NF [300A] in the present disclosure, all other network functions (NFs) in the
network would be referred to as peer NFs.
[0074] 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
10 (AMF) and a Session Management Function (SMF). Such 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.
[0075] Also, the first network function [300A] may be associated with one or more
15 Public Land Mobile Networks (PLMNs). As would be understood, 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.
20
[0076] Continuing further, in the context of the present invention, 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
25 communicate with each other. Further, the plurality of peer network functions may
receive and send the information with each other directly without needing any
central server. In the P2P network, every network function may be a client and a
server.
30 [0077] It may be understood and noted that all the Network Functions (NFs) in the
network may be registered in a Network Repository Function (NRF) [120]. Such
19

NRF [120], among other functionalities, may maintain information about NFs in the network and the services that they provide.
[0078] As would be further understood, the discovery of one or more peer network
5 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].
[0079] In operation, the identification unit [302], at the first NF [300A], may
10 identify one or more peer network functions (NFs) using one or more call
procedures. This has been depicted by Step 402 in FIG. 4.
[0080] As would be understood, the one or more peer NFs may be communicating
with each other. Also, the one or more peer NFs are configured to communicate
15 with the first NF [300A]. The identification of the one or more peer NFs by the first
NF [300] may allow the first NF [300A] to identify the NFs in the network with which the first NF [300A] may potentially communicate during the operation of the first NF [300A] and its traffic call flow.
20 [0081] Further, 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 [300A] 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.
25
[0082] Considering an example, say, there are 100 NFs present in the network and
registered in the NRF [120]. The first NF [300A] may one of the NF from the
registered 100 NFs. The first NF [300A] may not be interested to communicate with
all the other 99 registered NFs during the traffic call flow. The first NF [300A] may
30 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.
20

The identified 20 NFs are the NFs with which the first NF [300A] may potentially communicate during its operation and runtime.
[0083] Continuing further, once the first NF [300A] has identified the one or more
5 peer NFs, the subsequent steps involved with the present subject matter may be
invoked at the time of the start-up event. In one example, the start-up event may be a UE registration request. In another example, the start-up event may be a Packet Data Unit (PDU) session setup request.
10 [0084] 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.
[0085] Further, the PDU session setup is a process of establishing a data path
15 between the UE and a data network. The PDU session is a logical connection that
carries user data between the UE and the network.
[0086] 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
20 equipment by the first NF [300A], etc.
[0087] It may be noted that the aforementioned 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
25 be invoked at any other start-up event as well, and such examples would also lie
within the scope of the present subject matter.
[0088] Continuing further, pursuant to identification of the one or more peer
network functions, at a start-up event, the transceiver unit [304] may transmit a
30 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.
21

[0089] 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.
5
[0090] In one example, 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].
10
[0091] In another example, the optional input filter criteria (e.g. "nf-type") and
pagination parameters for the discovery request may be included in query
parameters.
15 [0092] In another example, 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.
20 [0093] In another example, the discovery request may be a GET request. In yet
another example, the first NF [300A] may transmit the HTTP GET request to the resource URI "nf-instances" collection resource. In yet another example, the discovery request may include a PLMN ID.
25 [0094] As would be understood, 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). 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
30 identifies a mobile network within the country.
22

[0095] 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].
[0096] Considering an example, it may be the case that the first NF [300A] may be
5 associated with one or more PLMNs. During identification of the peer NFs, it may
be possible that 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
10 PLMN, as required by the first NF [300A].
[0097] In another example, for service discovery in a different PLMN, the same
may be done by querying the "nf-instances" resource in the NRF of the Home
PLMN. In such cases, the GET request may be transmitted to the NRF in the
15 Serving PLMN, and this request may include the identity of the PLMN of the home
NRF in a query parameter of the URI.
[0098] In yet another example, this scenario may be applicable for the use case
where an NF (e.g. AMF) supports multiple PLMNs and the slices supported in each
20 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.
25
[0099] Continuing further, 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.
30
[0100] In one example, the discovery response is a HTTP 200 OK response. In
another example, the discovery response may include the URI (conforming to the
23

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).
[0101] In yet another example, the discovery response may include a set of data
5 related to one or more peer NFs associated with at least a PLMN ID included in the
discovery request. For example, the first NF [300A], while transmitting the
discovery request, may include a PLMN ID in the request. The first NF [300A] may
require data associate with the identified one or more peer NFs associated with the
PLMN ID. In such cases, the NRF, while providing the discovery response to the
10 first NF [300A], may include the data of one or more peer NFs associated with said
PLMN ID.
[0102] In another example, 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
15 from other NFs, the type of services offered, the communication ports through
which the first NF [300A] may communicate, etc.
[0103] In yet another example, in the discovery response, NRF will return the NF
profiles matching the search criteria indicated by the query parameters of the
20 discovery request, e.g. all the list of ranges of SUPIs whose profile data is available
in the UDM instance, etc.
[0104] In yet another example, the discovery response allows the retrieval of a list
of NF Instances that are currently registered in NRF.
25
[0105] Continuing further, thereafter, 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. This has been depicted as step 408 in FIG. 4.
30 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.
24

[0106] For example, the first NF [300A] 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. 5
[0107] In another example, it may be the case that the discovery response may include a set of data corresponding to one or more peer NFs associated with one or more PLMNs. For example, 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
10 Profile shall apply to each PLMN ID registered in the plmnList. As an exception,
attributes including a PLMN ID, e.g. IMSI-based SUPI ranges, Tracking Area Identity (TAIs) and Globally Unique AMF (GUAMIs), are specific to one PLMN ID and the NF may register in its profile multiple occurrences of such attributes for different PLMN IDs (e.g. the UDM may register in its profile SUPI ranges for
15 different PLMN IDs).
[0108] 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.
20 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.
[0109] In such cases, on receiving the discovery request, the storage unit [306] may
25 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].
30 [0110] Referring to 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. In an implementation the
25

method [500] is performed by the system [300]. Also, as shown in FIG. 5, the method [500] initiates at step [502].
[0111] At step [504], the method comprises identifying, by an identification unit
5 [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.
[0112] For example, one or more peer network functions may be communicating
with the first Network Function (NF) [300A]. The first NF [300A] and the plurality
10 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.
[0113] It may be further understood and noted that all the Network Functions (NFs)
in the network may be registered in a Network Repository Function (NRF) [120].
Such NRF [120], among other functionalities, may maintain information about NFs
15 in the network and the services that they provide.
[0114] In operation, the identification unit [302], at the first NF [300A], may identify one or more peer network functions (NFs) using one or more call procedures.
20 [0115] As would be understood, 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 [300A] to identify the NFs in the network with which the first NF [300A] may potentially communicate during the operation of the
25 first NF [300A] and its traffic call flow.
[0116] Further, 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 [300A] and the one or more peer NFs in
30 the network.
26

[0117] Next, at step [506], 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.
5
[0118] Continuing further, once the first NF [300A] has identified the one or more
peer NFs, the subsequent steps involved with the present subject matter may be
invoked at the time of the start-up event. In one example, the start-up event may be
a UE registration request. In another example, the start-up event may be a Packet
10 Data Unit (PDU) session setup request.
[0119] 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.
15
[0120] It may be noted that the aforementioned 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
20 within the scope of the present subject matter.
[0121] Continuing further, pursuant to identification of the one or more peer network functions, at a start-up event, the transceiver unit [304] may transmit a discovery request to the Network Repository Function (NRF) [120]. The discovery
25 request may be used for discovering one or more peer NFs.
[0122] 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.
30
[0123] In one example, the discovery request may also include filter criteria such as, but not limited to, type of the network function, services offered by the network
27

function, etc. Such filter criteria may allow efficient retrieval of data corresponding to relevant peer NFs, as required by the first NF [300A].
[0124] In another example, the discovery request may be a GET request. In yet
5 another example, the discovery request may include a PLMN ID.
[0125] 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].
10 [0126] Considering an example, it may be the case that the first NF [300A] may be
associated with one or more PLMNs. During identification of the peer NFs, it may be possible that 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
15 process the discovery request for discovery of one or more peer NFs, in a relevant
PLMN, as required by the first NF [300A].
[0127] At step [508], the method [500] comprises receiving, by the transceiver unit
[304], a discovery response from the NRF. The discovery response may include
20 data corresponding to one or more peer NFs.
[0128] Continuing further, 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.
25
[0129] In one example, the discovery response is a HTTP 200 OK response. In another example, 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. For example, the first NF [300A], while transmitting the discovery request,
30 may include a PLMN ID in the request. The first NF [300A] may require data
associate with the identified one or more peer NFs associated with the PLMN ID. In such cases, the NRF, while providing the discovery response to the first NF
28

[300A], may include the data of one or more peer NFs associated with said PLMN ID.
[0130] In another example, the data corresponding to the one or more peer NFs
5 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.
[0131] At step [510], the method [500] comprises storing, by the storage unit [306],
10 the data corresponding to one or more peer NFs to be used at runtime during traffic
call flow.
[0132] Continuing further, thereafter, the storage unit [306] may store the data
corresponding to one or more peer NFs to be used at runtime during traffic call flow.
15 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 [300A] during a runtime during traffic call flow.
20 [0133] In one example, it may be the case that the discovery response may include
a set of data corresponding to one or more peer NFs associated with one or more PLMNs. In such cases, on receiving the discovery request, 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
25 such selective storage may allow the storage unit to only store the data of peer NFs
which was requested by the first NF [300A].
[0134] The method terminates at step [512].
30 [0135] 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
29

by one or more units of a system [300], causes an identification unit [302] at a first Network Function [300A] 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. Further, 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. Further, 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. Further, 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.
[0136] As is evident from the above, 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.
[0137] While considerable emphasis has been placed herein on the disclosed implementations, it will be appreciated that many implementations can be made and that many changes can be made to the implementations without departing from the principles of the present disclosure. These and other changes in the implementations of the present disclosure will be apparent to those skilled in the art, whereby it is to be understood that the foregoing descriptive matter to be implemented is illustrative and non-limiting.

[0138] Further, in accordance with the present disclosure, it is to be acknowledged that the functionality described for the various components/units can be implemented interchangeably. While specific embodiments may disclose a particular functionality of these units for clarity, it is recognized that various configurations and combinations thereof are within the scope of the disclosure. The functionality of specific units as disclosed in the disclosure should not be construed as limiting the scope of the present disclosure. Consequently, alternative arrangements and substitutions of units, provided they achieve the intended functionality described herein, are considered to be encompassed within the scope of the present disclosure.

We Claim:
1. A method [500] for discovery of one or more peer network functions (NFs),
the method [500] comprising:
- identifying [504], by an identification unit [302] at a first Network Function (NF) [300A], one or more peer Network Functions (NFs) using one or more call procedures, wherein the one or more peer NFs communicate with each other;
- at a start-up event, transmitting [506], by a transceiver unit [304] at the first NF [300A], a discovery request to a Network Repository Function (NRF) [120], wherein the discovery request is used for discovering one or more peer NFs; and
- receiving [508], by the transceiver unit [304] at the first NF [300A], a discovery response from the NRF, wherein the discovery response comprises data corresponding to one or more peer NFs; and
- storing [510], by a storage unit [306] at the first NF [300A], the data corresponding to one or more peer NFs to be used at runtime during traffic call flow.

2. The method [500] as claimed in claim 1, wherein 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).
3. The method [500] as claimed in claim 1, wherein, the first network function (NF) [300A] is associated with one or more Public Land Mobile Networks (PLMNs).
4. The method [500] as claimed in claim 1, wherein the one or more peer NFs are configured to communicate with the first NF [300A].

5. The method [500] as claimed in claim 1, wherein 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.
6. The method [500] as claimed in claim 1, wherein the discovery request is a GET request, and wherein the discovery request comprises a PLMN ID.
7. The method [500] as claimed in claim 3, wherein 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.
8. The method [500] as claimed in claim 1, wherein 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.
9. The method [500] as claimed in claim 8, wherein storing, by the storage unit [306], 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.
10. A system [300] for discovery of one or more peer network functions (NFs), the system [300] comprising a first Network Function (NF) [300A], the first NF [300A] comprising:

- an identification unit [302] configured 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;
- a transceiver unit [304] connected to at least the identification unit [302], the transceiver unit [304] configured to:

o at a start-up event, transmit a discovery request to a Network Repository Function (NRF), wherein the discovery request is used for discovering one or more peer NFs; and o receive a discovery response from the NRF, wherein the discovery response comprises data corresponding to one or more peer NFs; and - a storage unit [306] connected to at least the identification unit [302] and the transceiver unit [304], the storage unit [306] configured to: store the data corresponding to one or more peer NFs to be used at runtime during traffic call flow.
11. The system [300] as claimed in claim 10, wherein each of the first NF [300A] and the one or more peer NFs is one of an Access and Mobility Management Function (AMF) [106] and a Session Management Function (SMF) [108].
12. The system [300] as claimed in claim 10, wherein, the first network function [300A] is associated with one or more Public Land Mobile Networks (PLMNs).
13. The system [300] as claimed in claim 10, wherein the one or more peer NFs are configured to communicate with the first NF [300A].
14. The system [300] as claimed in claim 10, wherein 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.
15. The system [300] as claimed in claim 10, wherein the discovery request is a GET request, and wherein the discovery request comprises a PLMN ID.

16. The system [300] as claimed in claim 12, wherein 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 [300A].
17. The system [300] as claimed in claim 10, wherein 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.
18. The system [300] as claimed in claim 17, wherein the storage unit [306] is further configured to: store the data corresponding to one or more peer NFs associated with the PLMN ID included in the discovery request.