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 MANAGING REGISTRATION OF A NETWORK FUNCTION”
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 MANAGING REGISTRATION OF A
NETWORK FUNCTION
FIELD OF DISCLOSURE
[0001] Embodiments of the present disclosure generally relate to network
function management systems. More particularly, embodiments of the present disclosure relate to managing registration of a network function (NF).
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. 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] A Network Repository Function (NRF) plays a crucial role in ensuring
uninterrupted services, including management, discovery, access tokens, and bootstrap functions. As part of its management services, the NRF provides a registration service where other Network Functions (NFs) within the network submit their NF Profiles for registration. However, a predetermined threshold, influenced by various factors like available memory and CPU capacity, constrains the number of NFs eligible for registration.
[0005] Thus, to solve such issues, a solution is needed that empowers
administrators to control network traffic and prevent reaching critical conditions, thereby mitigating potential issues.
[0006] Thus, there exists an imperative need in the art to provide a method and
a system for implementing conditional alarm for network function count threshold, which the present disclosure aims to address.
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 managing
registration of a network function (NF). The method comprises receiving, by a transceiver unit, a request for registration of the NF with a Network Repository Function (NRF). The method further comprises comparing, by a processing unit, a

current NF count value with one or more predefined NF count threshold values. The current NF count value is associated with a stage among one or more predefined stages, comprising an initial stage, at least one intermediate stage, a final stage, and each of the one or more predefined NF count threshold values are associated with one of the one or more predefined stages. Furthermore, the method comprises determining, by the processing unit, a breach indication of the network function based on the comparison. The breach indication is one of a positive breach indication and a negative breach indication. The positive breach indication is determined in an event the current NF count value is greater than a predefined NF count threshold value of the initial stage, and the negative breach indication is determined in an event the current NF count value is less than the predefined NF count threshold value of the initial stage. The method further includes performing, by the processing unit, in an event the positive breach indication is determined, one of an alarm raising procedure, and a request rejection procedure for registration of the NF. The alarm raising procedure is performed in an event the current NF count value is greater than the predefined NF count threshold value of the initial stage, and the current NF count value is less than a predefined NF count threshold value of the final stage and the request rejection procedure is performed in an event the current NF count value is greater than the predefined NF count threshold value of the final stage.
[0009] In an exemplary aspect of the present disclosure, the one or more
predefined NF count threshold values are defined based on one or more values in an alarm sheet stored in a storage unit.
[0010] In an exemplary aspect of the present disclosure, the one or more
predefined NF count threshold values are based on a configuration sheet related to the NF.

[0011] In an exemplary aspect of the present disclosure, the alarm raising
procedure is further performed in an event the current NF count value is greater than at least a predefined NF count threshold value of the at least one intermediate stage, and the current NF count value is less than the predefined NF count threshold value of the final stage.
[0012] Another aspect of the present disclosure may relate to a system for
managing registration of a network function (NF). The system comprises a transceiver unit, configured to receive a request for registration of the NF with a Network Repository Function (NRF). The system further comprises a processing unit connected at least with the transceiver unit. The processing unit is configured to compare a current NF count value with one or more predefined NF count threshold values, wherein the current NF count value is associated with a stage among one or more predefined stages, comprising an initial stage, at least one intermediate stage, a final stage, and each of the one or more predefined NF count threshold values are associated with one of the one or more predefined stages. The processing unit is further configured to determine a breach indication of the network function based on the comparison. The breach indication is one of a positive breach indication and a negative breach indication. The positive breach indication is determined in an event the current NF count value is greater than a predefined NF count threshold value of the initial stage, and the negative breach indication is determined in an event the current NF count value is less than the predefined NF count threshold value of the initial stage. The processing unit is further configured to perform, in an event the positive breach indication is determined, one of an alarm raising procedure, and a request rejection procedure for registration of the NF. The alarm raising procedure is performed in an event the current NF count value is greater than the predefined NF count threshold value of the initial stage, and the current NF count value is less than a predefined NF count threshold value of the final stage and the request rejection procedure is performed in an event the current NF count value is greater than the predefined NF count threshold value of the final stage.

[0013] Yet another aspect of the present disclosure may relate to a non-
transitory computer readable storage medium, storing instructions for managing
registration of a network function (NF), the instructions include executable code
5 which, when executed by one or more units of a system cause a transceiver unit to
receive a request for registration of the NF with a Network Repository Function (NRF). The instructions when executed by the system further cause a processing unit to compare a current NF count value with one or more predefined NF count threshold values. The current NF count value is associated with a stage among one
10 or more predefined stages, comprising an initial stage, at least one intermediate
stage, and a final stage. Each of the one or more predefined NF count threshold values are associated with one of the one or more predefined stages. The instructions when executed by the system further cause the processing unit to determine a breach indication of the network function based on the comparison.
15 The breach indication is one of a positive breach indication and a negative breach
indication. The positive breach indication is determined in an event the current NF count value is greater than a predefined NF count threshold value of the initial stage. The negative breach indication is determined in an event the current NF count value is less than the predefined NF count threshold value of the initial stage. The
20 instructions when executed by the system further cause the processing unit to
perform, in an event the positive breach indication is determined, one of an alarm raising procedure, and a request rejection procedure for registration of the NF. The alarm raising procedure is performed in an event the current NF count value is greater than the predefined NF count threshold value of the initial stage, and the
25 current NF count value is less than a predefined NF count threshold value of the
final stage and the request rejection procedure is performed in an event the current NF count value is greater than the predefined NF count threshold value of the final stage.
30 OBJECTS OF THE DISCLOSURE
6

[0014] Some of the objects of the present disclosure, which at least one
embodiment disclosed herein satisfies are listed herein below.
[0015] It is an object of the present disclosure to implement a conditional alarm
5 for a Network Function (NF) count threshold that empowers administrators to
proactively detect and manage potential breaches of the NF count threshold well in advance.
[0016] It is another object of the present disclosure to prevent memory
10 overflow of the Network Repository Function (NRF).
[0017] It is yet another object of the present disclosure to reduce error by
introducing an alarm at every level of threshold to fortify the resilience of Network Functions (NFs) and significantly reduce the likelihood of loss of a request. 15
DESCRIPTION OF THE DRAWINGS
[0018] The accompanying drawings, which are incorporated herein, and
constitute a part of this disclosure, illustrate exemplary embodiments of the
20 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, 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
25 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 drawings includes disclosure of electrical components or circuitry commonly used to implement such components.
7

[0019] FIG. 1 illustrates an exemplary block diagram representation of 5th
generation core (5GC) network architecture.
[0020] FIG. 2 illustrates an exemplary block diagram of a computing device
5 upon which the features of the present disclosure may be implemented, in
accordance with exemplary implementations of the present disclosure.
[0021] FIG. 3 illustrates an exemplary block diagram of a system for managing
registration of a network function (NF), in accordance with exemplary
10 implementations of the present disclosure.
[0022] FIG. 4 illustrates a method flow diagram for managing registration of a
network function (NF), in accordance with exemplary implementations of the present disclosure. 15
[0023] FIG. 5 illustrates an exemplary method flow diagram for managing
registration of a NF, in accordance with exemplary implementations of the present disclosure.
20 [0024] FIG. 6 illustrates an exemplary system for managing registration of a
NF, in accordance with exemplary implementations of the present disclosure.
[0025] The foregoing shall be more apparent from the following more detailed
description of the disclosure. 25
DETAILED DESCRIPTION
[0026] In the following description, for the purposes of explanation, various
specific details are set forth in order to provide a thorough understanding of
8

embodiments of the present disclosure. It will be apparent, however, that
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
5 address any of the problems discussed above or might address only some of the
problems discussed above.
[0027] The ensuing description provides exemplary embodiments only, and is
not intended to limit the scope, applicability, or configuration of the disclosure.
10 Rather, the ensuing description of the exemplary embodiments will provide those
skilled in the art with an enabling description for implementing an exemplary embodiment. 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.
15
[0028] Specific details are given in the following description to provide a
thorough 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
20 may be shown as components in block diagram form in order not to obscure the
embodiments in unnecessary detail.
[0029] 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
25 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 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.
30
9

[0030] The word “exemplary” and/or “demonstrative” is used herein to mean
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
5 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. 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
10 similar to the term “comprising” as an open transition word—without precluding
any additional or other elements.
[0031] As used herein, a “processing unit” or “processor” or “operating
processor” includes one or more processors, wherein processor refers to any logic
15 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
20 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 the system according to the present disclosure. More specifically, the processor or processing unit is a hardware processor.
25
[0032] 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 communication device” may be any electrical, electronic and/or computing device
30 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
10

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. Also, the user device may
contain at least one input means configured to receive an input from at least one of
5 a transceiver unit, a processing unit, a storage unit, a detection unit and any other
such unit(s) which are required to implement the features of the present disclosure.
[0033] As used herein, “storage unit” or “memory unit” refers to a machine or
computer-readable medium including any mechanism for storing information in a
10 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 that may be required by one or more units of the system to perform their respective
15 functions.
[0034] As used herein “interface” or “user interface” refers to a shared
boundary across which two or more separate components of a system exchange
information or data. The interface may also refer to a set of rules or protocols that
20 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.
[0035] All modules, units, components used herein, unless explicitly excluded
25 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
30 circuits (FPGA), any other type of integrated circuits, etc.
11

[0036] As used herein the transceiver unit includes 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
5 system and/or connected with the system.
[0037] As discussed in the background section, the current known solutions
have several shortcomings. The present disclosure aims to overcome the above-
mentioned and other existing problems in this field of technology by providing a
10 method and a system of managing registration of a network function (NF).
[0038] FIG. 1 illustrates an exemplary block diagram representation of 5th
generation core (5GC) network architecture, in accordance with exemplary implementation of the present disclosure. As shown in FIG. 1, the 5GC network
15 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
20 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 components are assumed to be connected to each other in a manner as obvious to
25 the person skilled in the art for implementing features of the present disclosure.
[0039] The 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).
12

It consists of radio base stations and the radio access technologies that enable wireless communication.
[0040] The Access and Mobility Management Function (AMF) [106] is a 5G
5 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.
[0041] The Session Management Function (SMF) [108] is a 5G core network
10 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.
[0042] The Service Communication Proxy (SCP) [110] is a network function
15 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.
[0043] The Authentication Server Function (AUSF) [112] is a network
20 function in the 5G core responsible for authenticating UEs during registration and
providing security services. It generates and verifies authentication vectors and tokens.
[0044] The Network Slice Specific Authentication and Authorization Function
25 (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.
13

[0045] The 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.
5 [0046] The 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.
[0047] The Network Repository Function (NRF) [120] is a network function
10 that acts as a central repository for information about available network functions
and services. It facilitates the discovery and dynamic registration of network functions.
[0048] The Policy Control Function (PCF) [122] is a network function
15 responsible for policy control decisions, such as QoS, charging, and access control,
based on subscriber information and network policies.
[0049] The Unified Data Management (UDM) [124] is a network function that
centralizes the management of subscriber data, including authentication,
20 authorization, and subscription information.
[0050] The Application Function (AF) [126] is a network function that
represents external applications interfacing with the 5G core network to access network capabilities and services. 25
[0051] The User Plane Function (UPF) [128] is a network function responsible
for handling user data traffic, including packet routing, forwarding, and QoS enforcement.
14

[0052] The 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. 5
[0053] The 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 the figure. The NEF [118] is connected with the
10 network entity via the interface denoted as (Nnef) interface in the figure. The NRF
[120] is connected with the network entity via the interface denoted as (Nnrf) interface in the figure. The PCF [122] is connected with the network entity via the interface denoted as (Npcf) interface in the figure. The UDM [124] is connected with the network entity via the interface denoted as (Nudm) interface in the figure. The
15 AF [126] is connected with the network entity via the interface denoted as (Naf)
interface in the figure. The NSSAAF [114] is connected with the network entity via the interface denoted as (Nnssaaf) interface in the figure. The AUSF [112] is connected with the network entity via the interface denoted as (Nausf) interface in the figure. The AMF [106] is connected with the network entity via the interface
20 denoted as (Namf) interface in the figure. The SMF [108] is connected with the
network entity via the interface denoted as (Nsmf) interface in the figure. The SMF [108] is connected with the UPF [128] via the interface denoted as (N4) interface in the figure. The UPF [128] is connected with the RAN [104] via the interface denoted as (N3) interface in the figure. The UPF [128] is connected with the DN
25 [130] via the interface denoted as (N6) interface in the figure. 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 the interface denoted as (N9). The interfaces such as Nnssf, Nnef, Nnrf, Npcf, Nudm, Naf, Nnssaaf, Nausf, Namf, Nsmf, N9, N6, N4, N3, N2,
30 and N1 can be referred to as a communication channel between one or more
15

functions or modules for enabling exchange of data or information between such functions or modules, and network entities.
[0054] FIG. 2 illustrates 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. In an
implementation, the computing device [200] (herein, also referred to as a computing
system [200]) may also implement a method for managing registration of a network
function (NF), utilising the system. In another implementation, the computing
10 device [200] itself implements the method for managing registration of a network
function (NF), 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.
15 [0055] The computing device [200] may include a bus [202] or other
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-
20 access memory (RAM), or other dynamic storage device, coupled to the bus [202]
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
25 accessible to the processor [204], render the computing device [200] into a special-
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].
30
16

[0056] 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
10 a 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
[0057] 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 [0058] The computing device [200] also may include a communication
interface [218] coupled to the bus [202]. The communication interface [218]
17

provides a two-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
5 corresponding type of 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
10 data streams representing various types of information.
[0059] 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], the local network [222], the host [224] 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
[0060] The present disclosure is implemented by a system [300] (as shown in
FIG. 3). In an implementation, the system [300] may include the computing device [200] (as shown in FIG. 2). It is further noted that the computing device [200] is able to perform the steps of a method [400] (as shown in FIG. 4).
25
[0061] Referring to FIG. 3, an exemplary block diagram of a system [300] for
managing registration of a network function (NF), is shown, in accordance with the exemplary implementations of the present disclosure. The system [300] comprises at least one transceiver unit [302], at least one processing unit [304] and at least one
30 storage unit [306]. Also, all of the components/ units of the system [300] are
18

assumed to be connected to each other unless otherwise indicated below. As shown
in FIG. 3, all units shown within the system 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
5 such numbers of said units, as required to implement the features of the present
disclosure. Further, in an implementation, the system [300] may be present in a user
equipment (UE) (such as a user device) to implement the features of the present
disclosure. The system [300] may be a part of the UE or may be independent of but
in communication with the UE. In another implementation, the system [300] may
10 reside in a server or a network entity. In yet another implementation, the system
[300] may reside partly in the server/ network entity and partly in the UE.
[0062] The system [300] is configured for managing registration of a network
function (NF), with the help of the interconnection between the components/units
15 of the system [300].
[0063] The system [300] comprises a transceiver unit [302]. The transceiver
unit [302] is configured to receive a request for registration of the NF with a
Network Repository Function (NRF) [120]. In one example, the NF may be one of
20 the AMF [106], the SMF [108], the SCP [110], the AUSF [112], the NSSAAF
[114], the NSSF [116], the NEF [118], the UDM [124], the AF [126] and the UPF [128].
[0064] The system [300] further comprises a processing unit [304]. The
25 processing unit [304] is configured to compare a current NF count value with one
or more predefined NF count threshold values. In one example, the current NF count refers to a number of NFs currently registered with the NRF [120], when the system [300] may query the NRF [120]. The current NF count value is associated with a stage among one or more predefined stages. The one or more predefined
19

stages comprises at least one initial stage, at least one intermediate stage, and at least one final stage.
[0065] In another example, the one or more predefined NF count threshold
5 values are associated with one of the one or more predefined stages. In one example,
for the at least one initial stage, the predefined NF count threshold value may be 40%. In another example, the predefined NF count threshold value for the at least one intermediate stage may be 60% and for the final stage may be 90%. The one or more predefined NF count threshold values may be defined based on one or more
10 values in an alarm sheet stored in a storage unit [306]. In one example, the alarm
sheet refers to a record that may contain a list of predefined NF count threshold values. The one or more predefined NF count threshold values are based on a configuration sheet related to the NF. The configuration sheet refers to a list of the one or more predefined stages.
15
[0066] The processing unit [304] is configured to determine a breach indication
of the network function based on the comparison of the current NF count value with the predefined NF count threshold value. In one example, the breach indication may be one of a positive breach indication and a negative breach indication.
20
[0067] In one example, the positive breach indication is determined in an event
the current NF count value is greater than the predefined NF count threshold value of the initial stage and the negative breach indication is determined in an event the current NF count value is less than the predefined NF count threshold value of the
25 initial stage.
[0068] In one example, the processing unit [304] may reject the request for
registration of the NF. The request rejection procedure is performed in an event the
current NF count value is greater than the predefined NF count threshold value of
30 the final stage.
20

[0069] In another example, in an event the positive breach indication is
determined, the processing unit [304] may perform an alarm raising procedure. In
one example, the alarm raising procedure is performed in an event the current NF
5 count value is greater than the predefined NF count threshold value of the initial
stage. In another example, the alarm raising procedure may be performed in the
event the current NF count value is less than a predefined NF count threshold value
of the final stage. In another example, the alarm raising procedure may further be
performed in an event the current NF count value is greater than at least the
10 predefined NF count threshold value of the at least one intermediate stage, and the
current NF count value is less than the predefined NF count threshold value of the final stage.
[0070] In one example, the alarm may be a conditional alarm. The conditional
15 alarm may be configured to have plurality of levels. In one example, the conditional
alarm and the plurality of levels may be configurable by the system [300] based on
the request and the NRF [120] in every request. The plurality of levels may
represent a level of traffic on the NRF [120] and a threat in user experience if the
NF may get registered to the NRF [120]. The alarm may ensure the system [300] to
20 take appropriate action on the registration request based on the plurality of levels.
[0071] In an example, the alarm raising procedure may be indicative of the
current NF count value being equal to the predefined NF count threshold value of
the final stage. In such a case, further requests for registration of NFs may be
25 rejected by the system [200].
[0072] Referring to FIG. 4, an exemplary method flow diagram [400] for
managing registration of a network function (NF), in accordance with exemplary
implementations of the present disclosure is shown. In an implementation the
30 method [400] is performed by the system [300]. Further, in an implementation, the
21

system [300] may be present in a server device to implement the features of the present disclosure. Also, as shown in FIG. 4, the method [400] starts at step [402].
[0073] At step [404], the method comprises receiving, by a transceiver unit
5 [302], a request for registration of the NF with a Network Repository Function
(NRF) [120]. In one example, the NF may be one of the AMF [106], the SMF [108], the SCP [110], the AUSF [112], the NSSAAF [114], the NSSF [116], the NEF [118], the UDM [124], the AF [126] and the UPF [128].
10 [0074] Next at step [406], the method comprises comparing, by a processing
unit [304], a current NF count value with one or more predefined NF count threshold values. In one example, the current NF count refers to a number of NFs currently registered with the NRF [120], when the system [300] may query the NRF [120]. The current NF count value is associated with a stage among one or more
15 predefined stages. The one or more predefined stages comprises at least one initial
stage, at least one intermediate stage, at least one final stage.
[0075] In another example, the one or more predefined NF count threshold
values are associated with one of the one or more predefined stages. In one example,
20 for the at least one initial stage, the predefined NF count threshold value may be
40%. In another example, the predefined NF count threshold value for the at least one intermediate stage may be 60% and for the final stage may be 90%. The one or more predefined NF count threshold values may be defined based on one or more values in an alarm sheet stored in a storage unit [306]. In one example, the alarm
25 sheet refers to a record that may contain a list of predefined NF count threshold
values. The one or more predefined NF count threshold values are based on a configuration sheet related to the NF. The configuration sheet refers to a list of the one or more predefined stages.
22

[0076] Next at step [408], the method comprises determining, by the
processing unit [102], a breach indication of the network function based on the
comparison. The breach indication is one of a positive breach indication and a
negative breach indication. The positive breach indication is determined in an event
5 the current NF count value is greater than a pre-defined NF count threshold of the
current stage, and the negative breach indication is determined in an event the current NF count value is less than the pre-defined NF count threshold of the current stage.
10 [0077] In one example, the positive breach indication is determined in an event
the current NF count value is greater than the predefined NF count threshold value of the initial stage and the negative breach indication is determined in an event the current NF count value is less than the predefined NF count threshold value of the initial stage.
15
[0078] In one example, the processing unit [304] may reject the request for
registration of the NF. The request rejection procedure is performed in an event the current NF count value is greater than the predefined NF count threshold value of the final stage.
20
[0079] Next at step [410], the method comprises determining, by the
processing unit [304], a breach indication of the network function based on the comparison of the current NF count value with the predefined NF count threshold value. In one example, the breach indication may be one of a positive breach
25 indication and a negative breach indication. In one example, the positive breach
indication is determined in an event the current NF count value is greater than a predefined NF count threshold value of the initial stage, and the negative breach indication is determined in an event the current NF count value is less than the predefined NF count threshold value of the initial stage.
30
23

[0080] Next at step [412], the method comprises performing, by the processing
unit [304], in an event the positive breach indication is determined, one of an alarm
raising procedure, and a request rejection procedure for registration of the NF. In
one example, the alarm raising procedure is performed in an event the current NF
5 count value is greater than the predefined NF count threshold value of the initial
stage, and the current NF count value is less than a predefined NF count threshold
value of the final stage. In another example, the request rejection procedure is
performed in an event the current NF count value is greater than the predefined NF
count threshold value of the final stage. The alarm raising procedure is further
10 performed in an event the current NF count value is greater than at least a predefined
NF count threshold value of the at least one intermediate stage, and the current NF count value is less than the predefined NF count threshold value of the final stage.
[0081] In one example, the alarm may be a conditional alarm. The conditional
15 alarm may be configured to have a plurality of levels. In one example, the
conditional alarm and the plurality of levels may be configurable by the system
[300] based on the request and the NRF [120] in every request. The plurality of
levels may represent a level of traffic on the NRF [120] and a threat in user
experience if the NF may get registered to the NRF [120]. The alarm may ensure
20 the system [300] to take appropriate action on the registration request based on the
plurality of levels.
[0082] The method terminates at step [414].
25 [0083] Referring to FIG. 5, an exemplary method flow for managing
registration of a NF, in accordance with exemplary implementations of the present disclosure, is shown.
[0084] The method starts at step [502]. The system [300] may receive a request
30 for registration of the NF with the NRF [120]. In one example, the NF may be one
24

of the AMF [106], the SMF [108], the SCP [110], the AUSF [112], the NSSAAF [114], the NSSF [116], the NEF [118], the UDM [124], the AF [126] and the UPF [128].
5 [0085] At step [504], in an example, the system operator or the network
operator may create the predefined NF count threshold values. The predefined NF count threshold values may be created based on a configuration sheet. Further, the system operator or the network operator may create the alarm raising procedure based on an alarm sheet. In one example, the alarm may be a conditional alarm. The
10 conditional alarm may be configured to have a plurality of levels. In one example,
the plurality of levels may be a minor level, a major level and a critical level. In another example, the conditional alarm and the plurality of levels may be configurable by the system [300] based on the request and the NRF [120] in every request. The plurality of levels may represent a level of traffic on the NRF [120]
15 and a threat in user experience if the NF may get registered to the NRF [120]. The
alarm may ensure the system [300] to take appropriate action on the registration request based on the plurality of levels.
[0086] In one example, the initial stage may be set at 30%, the intermediate
20 stage may be set at 50%, and the final stage may be set at 90%. The alarm will be
raised at the initial stage, suggesting that the NRF [120] is at or above 30% of
capacity to register NFs. In another example, when the current NF count is at 50%
or above of the threshold capacity, the intermediate stage of the alarm may be
raised. The final stage of the alarm may be raised when the predefined NF count
25 threshold value of 90% may be breached.
[0087] At step [506], the system [300] as shown in FIG. 3 may monitor the
current NF count at the NRF [120]. The system [300] may check if the current NF
count is greater than the predefined NF count. If the current NF count is not greater
30 than the predefined NF count, the system [300] may continue to monitor the current
25

NF count. If the current NF count is greater than the predefined NF count, the exemplary method flow [500] may proceed to step [508].
[0088] At step [508], the system [300] may check if the current NF count is
5 higher than the one or more stages of the predefined NF count threshold value, the
exemplary method flow [500] may proceed to step [512] to reject the request for registration. In another instance, if the current NF count is lower than the one or more stages of the predefined NF count threshold value, the exemplary method flow [500] may proceed to step [510].
10
[0089] At step [510], the alarm raising procedure is performed in an event the
current NF count value is greater than the predefined NF count threshold value of the initial stage. In another example, the alarm raising procedure may be performed in the event the current NF count value is less than a predefined NF count threshold
15 value of the final stage. The alarm raising procedure may further be performed in
an event the current NF count value is greater than at least the predefined NF count threshold value of the at least one intermediate stage, and the current NF count value is less than the predefined NF count threshold value of the final stage.
20 [0090] The exemplary method flow [500] may terminate at the step [512].
[0091] Referring to FIG. 6 an exemplary system for managing registration of
a NF, in accordance with exemplary implementations of the present disclosure is shown. 25
[0092] The exemplary system [600] comprises an alarm folder [602], and
depicts a connection between the system [300] as shown in FIG. 3, and the alarm folder [602]. The system [300] is in communication with the network function which may send the request for registration with the NRF [120].
30
26

[0093] The alarm folder [602] may be in communicative coupling with the
other components of the system [300]- the transceiver unit [302], the processing unit [304] and the storage unit [306], to manage the registration of the NF.
[0094] The alarm folder [602] may include predefined NF count threshold
values for raising alarms. The components (such as the transceiver unit [302], the processing unit [304], and/or the storage unit [306]) of the system [300] may be configured to access the alarm folder [602] and retrieve the predefined NF count threshold values. The alarm folder [602] may further include the alarm sheet that contains the predefined NF count threshold values. The alarm folder [602] may further specifically have details related to the plurality of levels for configuring the conditional alarm. The alarm folder [602] may further be directly, or through the components of the system [300], be connected to the NRF [120].
[0095] The present disclosure further discloses a non-transitory computer
readable storage medium, storing instructions for managing registration of a network function (NF), the instructions include executable code which, when executed by one or more units of a system, cause a transceiver unit [302] to receive a request for registration of the NF with a Network Repository Function (NRF) [120]. The instructions when executed by the system further cause a processing unit [304] to compare a current NF count value with one or more predefined NF count threshold values. The current NF count value is associated with a stage among one or more predefined stages, comprising an initial stage, at least one intermediate stage, and a final stage. Each of the one or more predefined NF count threshold values are associated with one of the one or more predefined stages. The instructions when executed by the system further cause the processing unit [304] to determine a breach indication of the network function based on the comparison. The breach indication is one of a positive breach indication and a negative breach indication. The positive breach indication is determined in an event the current NF count value is greater than a predefined NF count threshold value of the initial stage. The negative breach indication is determined in an event the current NF count value

is less than the predefined NF count threshold value of the initial stage. The instructions when executed by the system further cause the processing unit [304] to perform, in an event the positive breach indication is determined, one of an alarm raising procedure, and a request rejection procedure for registration of the NF. The alarm raising procedure is performed in an event the current NF count value is greater than the predefined NF count threshold value of the initial stage, and the current NF count value is less than a predefined NF count threshold value of the final stage and the request rejection procedure is performed in an event the current NF count value is greater than the predefined NF count threshold value of the final stage.
[0096] As is evident from the above, the present disclosure provides a
technically advanced solution for managing registration of a network function (NF). The present solution implements a conditional alarm for a Network Function (NF) count threshold that empowers administrators to proactively detect and manage potential breaches of the NF count threshold well in advance. The present disclosure further prevents memory overflow of the Network Repository Function (NRF). The present disclosure further reduces error by introducing an alarm at every level of threshold to fortify the resilience of Network Functions (NFs) and significantly reduce the likelihood of loss of a request.
[0097] 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.

[0098] 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 [400] for managing registration of a network function (NF), the method [400] comprising:
- receiving, by a transceiver unit [302], a request for registration of the NF with a Network Repository Function (NRF) [120];
- comparing, by a processing unit [304], a current NF count value with one or more predefined NF count threshold values, wherein the current NF count value is associated with a stage among one or more predefined stages, comprising an initial stage, at least one intermediate stage, a final stage, and each of the one or more predefined NF count threshold values are associated with one of the one or more predefined stages;
- determining, by the processing unit [304], a breach indication of the network function based on the comparison,
wherein the breach indication is one of: a positive breach indication and a negative breach indication, and
wherein the positive breach indication is determined in an event the current NF count value is greater than a predefined NF count threshold value of the initial stage, and the negative breach indication is determined in an event the current NF count value is less than the predefined NF count threshold value of the initial stage; and
- performing, by the processing unit [304], in an event the positive
breach indication is determined, one of: an alarm raising procedure,
and a request rejection procedure for registration of the NF,
wherein:
- the alarm raising procedure is performed in an event the current NF count value is greater than the predefined NF count threshold value of the initial stage, and the current NF count

value is less than a predefined NF count threshold value of the final stage, and
- the request rejection procedure is performed in an event the
current NF count value is greater than the predefined NF count
threshold value of the final stage.
2. The method [400] as claimed in claim 1, wherein the one or more predefined NF count threshold values may be defined based on one or more values in an alarm sheet stored in a storage unit [306].
3. The method [400] as claimed in claim 1, wherein the one or more predefined NF count threshold values are based on a configuration sheet related to the NF.
4. The method [400] as claimed in claim 1, wherein the alarm raising procedure is further performed in an event the current NF count value is greater than at least a predefined NF count threshold value of the at least one intermediate stage, and the current NF count value is less than the predefined NF count threshold value of the final stage.
5. A system [300] for managing registration of a network function (NF), the system [300] comprising:

- a transceiver unit [302] configured to receive a request for registration of the NF with a Network Repository Function (NRF) [120];
- a processing unit [304] connected at least with the transceiver unit [302], the processing unit [304] is configured to:
- compare a current NF count value with one or more predefined
NF count threshold values, wherein the current NF count value
is associated with a stage among one or more predefined stages,
comprising an initial stage, at least one intermediate stage, a

final stage, and each of the one or more predefined NF count threshold values are associated with one of the one or more predefined stages;
- determine a breach indication of the network function based on
the comparison,
wherein the breach indication is one of: a positive breach indication and a negative breach indication, and
wherein the positive breach indication is determined in an event the current NF count value is greater than a predefined NF count threshold value of the initial stage, and the negative breach indication is determined in an event the current NF count value is less than the predefined NF count threshold value of the initial stage; and
- perform, in an event the positive breach indication is
determined, one of: an alarm raising procedure, and a request
rejection procedure for registration of the NF,
wherein:
- the alarm raising procedure is performed in an event the current NF count value is greater than the predefined NF count threshold value of the initial stage, and the current NF count value is less than a predefined NF count threshold value of the final stage, and
- the request rejection procedure is performed in an event the current NF count value is greater than the predefined NF count threshold value of the final stage.
6. The system [300] as claimed in claim 5, wherein the one or more predefined NF count threshold values may be defined based on one or more values in an alarm sheet stored in a storage unit [306].

7. The system [300] as claimed in claim 5, wherein the one or more predefined NF count threshold values are based on a configuration sheet related to the NF.
8. The system [300] as claimed in claim 5, wherein the alarm raising procedure is further performed in an event the current NF count value is greater than at least a predefined NF count threshold value of the at least one intermediate stage, and the current NF count value is less than the predefined NF count threshold value of the final stage.