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 OPTIMISING A NETWORK
PERFORMANCE”
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 OPTIMISING A NETWORK
PERFORMANCE
FIELD OF INVENTION
[0001] The present disclosure generally relates to the field of network performance management systems. More particularly, the present disclosure relates to a method and system for optimising a network performance initiating a user equipment (UE) terminated registration request with re-registration option based on detecting a breach condition associated with a pending procedure queue and clearing the pending procedure queue.
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. 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] In the current scenario, during an interaction between a User Equipment (UE) registered on a 5G network via Access and Mobility Management Function (AMF), the problem arises when the UE, Radio Access Network (RAN), or network initiates a procedure towards the AMF, and either the next procedure is sent before the completion of the existing one or the AMF takes longer than expected to complete the procedure while other procedures keep coming in. To handle this situation, the AMF maintains a pending queue for every user where it keeps these procedures and processes them in a first-come, first-serve (FCFS) order once the current procedure is completed. However, the pending queue can grow rapidly if the incoming procedures are faster than the AMF can handle or if there are delayed responses from other nodes. This increase in the pending queue size results in a longer processing time for each procedure, which ultimately degrades the overall performance of the UE. Additionally, if the AMF does not support a new message or information element (IE) in a procedure, it can cause the procedure to be stuck at the AMF. As a result, the AMF keeps pushing forthcoming procedures for the UE into the pending queue, but it cannot process them because the current procedure is stuck, leading to a constantly growing pending queue and a stuck UE.
[0005] Further, over the period, various solutions have been developed to improve the performance of communication devices and to efficiently manage the procedure queues for UE in AMF. However, there are certain challenges with existing solutions. Firstly, the solution relies on a first-come, first-serve (FCFS) order for processing procedures in the pending queue. However, this approach does not consider the varying priorities or criticality of different procedures. As a result, procedures that are time-sensitive or require immediate attention may get delayed in the queue, negatively impacting the overall performance of the UE.

[0006] Secondly, the solution does not address the issue of scalability. With a growing number of procedures in the pending queue, the time taken to pop and process them increases, leading to potential bottlenecks and degradation in system performance. This limitation becomes even more significant when the rate of incoming procedures exceeds the processing capacity of the AMF or when there are delays caused by system bugs or delayed responses from other network nodes.
[0007] Another limitation is that the solution does not provide a mechanism to handle cases where the AMF encounters unsupported messages or information elements (IEs). When such situations occur, the procedure becomes stuck at the AMF, and subsequent procedures for the UE keep piling up in the pending queue. This can result in a persistent backlog, causing the UE to remain stuck and affecting the overall user experience.
[0008] Thus, there exists an imperative need in the art to efficiently manage the procedure queues in AMF, which the present disclosure aims to address.
SUMMARY
[0009] 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.
[0010] An aspect of the present disclosure may relate to a method for optimising a network performance. The method comprising receiving, by a transceiver unit at an Access and Mobility Management Function (AMF) from a user equipment (UE), a network procedure associated with the network. Further, the method comprises detecting, by a processing unit at the AMF, a procedure queue associated with the UE, wherein the procedure queue associated with the UE comprises at least a count of pending procedures associated with the UE and a pending procedure threshold

value. Further, the method comprises determining, by the processing unit at the AMF, a breach condition associated with the pending procedure threshold value. Further, the method comprises clearing, by the processing unit at the AMF, the procedure queue based on the breach condition. Further, the method comprises initiating, by the processing unit from the AMF to the UE, a UE terminated registration request with re-registration option based clearing the procedure queue. Further, the method comprises detecting, by the processing unit at the AMF, an initial registration event associated with the UE based on the UE terminated registration request with re-registration option. Thereafter, the method comprises optimising, by the processing unit at the AMF, the network performance based on the initial registration event associated with the UE.
[0011] In an exemplary aspect of the present disclosure, the breach condition associated with the pending procedure threshold value is detected in an event the count of pending procedure associated with the UE is at least one of equal to the pending procedure threshold value associated with the UE and greater the pending procedure threshold value associated with the UE.
[0012] In an exemplary aspect of the present disclosure, the procedure queue associated with the UE is based on at least a first come first serve (FCFS) logic.
[0013] In an exemplary aspect of the present disclosure, the method comprises receiving, by the transceiver unit at the AMF from one or more entities associated with a radio access network (RAN), the network procedure associated with the network.
[0014] In an exemplary aspect of the present disclosure, the optimising the network performance further comprises optimising a UE recovery time associated with the UE based on the clearing the procedure queue.

[0015] Another aspect of the present disclosure may relate to a system for optimising a network performance, the system comprises a transceiver unit, the transceiver unit is configured to: receive, at an Access and Mobility Management Function (AMF) from an user equipment (UE), a network procedure associated with the network. Further, the system comprises a processing unit connected to at least the transceiver unit, the processing unit is configured to: detect, at the AMF, a procedure queue associated with the UE, the procedure queue associated with the UE comprises at least a count of pending procedures associated with the UE and a pending procedure threshold value. Further, the processing unit is configured to determine, at the AMF, a breach condition associated with the pending procedure threshold value. Further, the processing unit is configured to clear, at the AMF, the procedure queue based on the breach condition. Further, the processing unit is configured to initiate, from the AMF to the UE, a UE terminated registration request with re-registration option based clearing the procedure queue. Further, the processing unit is configured to detect, at the AMF, an initial registration event associated with the UE based on the UE terminated registration request with re-registration option. Thereafter, the processing unit is configured to optimise, at the AMF, the network performance based on the initial registration event associated with the UE.
[0016] Yet another aspect of the present disclosure may relate to a non-transitory computer readable storage medium storing instructions for optimising a network performance, the instructions comprising executable code which, when executed by one or more units of a system causes a transceiver unit of the system to receive, at an Access and Mobility Management Function (AMF) from an user equipment (UE), a network procedure associated with the network. The executable code which, when executed further causes a processing unit of the system to detect, at the AMF, a procedure queue associated with the UE, wherein the procedure queue associated with the UE comprises at least a count of pending procedures associated with the UE and a pending procedure threshold value. Further, the executable code which, when executed causes the processing unit to determine, at the AMF, a breach

condition associated with the pending procedure threshold value. Further, the
executable code which, when executed causes the processing unit to clear, at the
AMF, the procedure queue based on the breach condition. Further, the executable
code which, when executed causes the processing unit to initiate, from the AMF to
5 the UE, a UE terminated registration request with re-registration option based
clearing the procedure queue. Further, the executable code which, when executed
causes the processing unit to detect, at the AMF, an initial registration event
associated with the UE based on the UE terminated registration request with re-
registration option. Thereafter, the executable code which, when executed causes
10 the processing unit to optimise, at the AMF, the network performance based on the
initial registration event associated with the UE.
[0017] Yet another aspect of the present disclosure may relate to a User Equipment (UE) for optimising a network performance, the UE comprising a memory and a
15 processor coupled to the memory. The processor is configured to transmit, to a
system, a request for optimising the network performance along with a network procedure associated with the network at an Access and Mobility Management Function (AMF), and receive, a response to the request from the system, wherein the response comprises an indication of optimisation of the network performance
20 based on the request, and wherein the response is generated at the system based on
receiving, by the system at an Access and Mobility Management Function (AMF) from a user equipment (UE), a network procedure associated with the network. Further, the response is generated based on detecting, by the system at the AMF, a procedure queue associated with the UE, wherein the procedure queue associated
25 with the UE comprises at least a count of pending procedures associated with the
UE and a pending procedure threshold value. Further, the response is generated based on determining, by the system at the AMF, a breach condition associated with the pending procedure threshold value. Further, the response is generated based on clearing, by the system at the AMF, the procedure queue based on the breach
30 condition. Further, the response is generated based on initiating, by the system from
the AMF to the UE, a UE terminated registration request with re-registration option
7

based clearing the procedure queue. Further, the response is generated based on
detecting, the system at the AMF, an initial registration event associated with the
UE based on the UE terminated registration request with re-registration option.
Thereafter, the response is generated based on optimising, the system at the AMF,
5 the network performance based on the initial registration event associated with the
UE.
OBJECTS OF THE DISCLOSURE
10
[0018] Some of the objects of the present disclosure, which at least one embodiment disclosed herein satisfies are listed herein below.
[0019] It is an object of the present disclosure to provide a system and a method for
15 efficient management of procedure queues in AMF.
[0020] It is another object of the present disclosure to provide a solution that optimise network performance.
20 [0021] It is yet another object of the present disclosure to provide a solution to
transmit a negative ack associated with each procedure pending at a user equipment (UE) context from the count of procedure pending at a UE and initiating re-register procedure at the UE. Hence by optimising the UE recovery time in a telecommunications network.
25
BRIEF DESCRIPTION OF THE DRAWINGS
[0022] The accompanying drawings, which are incorporated herein, and constitute
a part of this disclosure, illustrate exemplary embodiments of the disclosed methods
30 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,
8

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
5 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.
[0023] FIG. 1 illustrates an exemplary block diagram representation of 5th
10 generation core (5GC) network architecture.
[0024] 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. 15
[0025] FIG. 3 illustrates an exemplary block diagram of a system for optimising a network performance, in accordance with exemplary implementations of the present disclosure.
20 [0026] FIG. 4 illustrates an exemplary method flow diagram indicating for
optimising a network performance, in accordance with exemplary implementations of the present disclosure.
[0027] FIG.5 illustrates an exemplary sequence flow diagram for optimising a
25 network performance, in accordance with exemplary implementations of the
present disclosure.
[0028] The foregoing shall be more apparent from the following more detailed description of the disclosure. 30
DETAILED DESCRIPTION
9

[0029] 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
5 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.
10
[0030] 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.
15 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.
[0031] Specific details are given in the following description to provide a thorough
20 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. 25
[0032] 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
30 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
10

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. 5
[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
10 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
15 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
20 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.
25
[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
30 of microprocessors, one or more microprocessors in association with a Digital
Signal Processing (DSP) core, a controller, a microcontroller, Application Specific
11

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
the system according to the present disclosure. More specifically, the processor or
5 processing unit is a hardware processor.
[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
10 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
15 of implementing the one or more 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 one or more features of the present disclosure.
20 [0037] As used herein, “storage unit” or “memory unit” refers to a machine or
computer-readable medium including any mechanism for storing information in a form readable by a computer or similar machine. 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
25 types of machine-accessible storage media. The storage unit stores at least the data
that may be required by one or more units of the system to perform their respective functions.
[0038] As used herein “interface” or “user interface refers to a shared boundary
30 across which two or more separate components of a system exchange information
or data. The interface may also be referred to a set of rules or protocols that define
12

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.
5 [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
digital signal processor (DSP), a plurality of microprocessors, one or more
microprocessors in association with a DSP core, a controller, a microcontroller,
10 Application Specific Integrated Circuits (ASIC), Field Programmable Gate Array
circuits (FPGA), any other type of integrated circuits, etc.
[0040] As portable electronic devices and wireless technologies continue to improve and grow in popularity, the advancing wireless technologies for data
15 transfer are also expected to evolve and replace the older generations of
technologies. In the field of wireless data communications, the dynamic advancement of various generations of cellular technology are also seen. The development, in this respect, has been incremental in the order of second generation (2G), third generation (3G), fourth generation (4G), and now fifth generation (5G),
20 and more such generations are expected to continue in the forthcoming time.
[0041] Radio Access Technology (RAT) refers to the technology used by mobile devices/ user equipment (UE) to connect to a cellular network. It refers to the specific protocol and standards that govern the way devices communicate with base
25 stations, which are responsible for providing the wireless connection. Further, each
RAT has its own set of protocols and standards for communication, which define the frequency bands, modulation techniques, and other parameters used for transmitting and receiving data. Examples of RATs include GSM (Global System for Mobile Communications), CDMA (Code Division Multiple Access), UMTS
30 (Universal Mobile Telecommunications System), LTE (Long-Term Evolution), and
5G. The choice of RAT depends on a variety of factors, including the network
13

infrastructure, the available spectrum, and the mobile device's/device's capabilities. Mobile devices often support multiple RATs, allowing them to connect to different types of networks and provide optimal performance based on the available network resources. 5
[0042] 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 system and/or connected with the system.
10
[0043] As discussed in the background section, the current known solutions for efficient management of procedure queues for user equipment (UE) context in AMF have several shortcomings such as the prior solution does not effectively handle scalability issues for e.g., as the number of procedures in the pending queue grows,
15 the processing time increases, which can result in performance degradation and
delays for the UE. Without a scalable mechanism in place, the solution is not able to efficiently handle the increasing load and demands of a growing network. Furthermore, the prior solutions do not provide a robust mechanism for handling unsupported messages or Information Elements (IEs) at the AMF. When an
20 unsupported message or IE is encountered, the procedure becomes stuck, causing
subsequent procedures to accumulate in the pending queue. This leads to a backlog and a stuck UE, negatively impacting the user experience and system performance. Overall, the prior known solution lacks the ability to prioritize procedures, address scalability concerns, and handle unsupported messages/IEs effectively. These
25 shortcomings hinder the performance, efficiency, and reliability of the solution
within a network environment.
[0044] The present disclosure aims to overcome the above-mentioned and other
existing problems in this field of technology by disclosing a system and method for
30 optimizing network performance by optimising a user equipment (UE) recovery
time in a telecommunications network. The invention introduces a novel approach
14

that enables efficient management of procedure queues associated with the UE at
an Access and Mobility Management Function (AMF) in order to minimize
signalling congestion and reduce UE recovery time. By dynamically determining a
trigger based on a pre-defined threshold count associated with the procedure queue,
5 the invention initiates a terminate de-registration message with a re-registration
option to expedite the recovery process. Furthermore, the present solution provides
an efficient solution to address the challenges associated with managing pending
procedures for UE context in the Access and Mobility Function (AMF) of
communication networks. This innovative approach involves the implementation
10 of a monitoring system within the AMF that keeps track of the number of
procedures present in the pending queue for specific user equipment (UE). When
the pending queue size in the UE context reaches the maximum configured limit,
the AMF automatically performs a clean-up process. As part of this clean up, the
AMF triggers a User Equipment (UE) terminated de-registration request with a re-
15 registration option. The present disclosure ensures that the pending queue is
efficiently managed, preventing any backlog of procedures and optimizing the
overall performance of the network. By proactively addressing potential
bottlenecks, this invention significantly enhances the reliability and responsiveness
of communication systems, resulting in an improved user experience.
20
[0045] Furthermore, the present disclosure introduces a novel solution that
addresses the challenges of network congestion and UE recovery time in
telecommunications networks by introducing the concept of pre-defined threshold
counts associated with procedure queues, the invention enables dynamic trigger
25 determination for initiating the recovery process. The combination of terminate de-
registration messages, acknowledgement (ACK) transmission, and re-registration
options provides a unique approach to expediting UE recovery and optimising
network resources. This innovative solution offers a new and improved method for
managing network signalling and enhancing user experiences in congested network
30 environments.
15

[0046] Hereinafter, exemplary embodiments of the present disclosure will be described with reference to the accompanying drawings.
[0047] FIG. 1 illustrates an exemplary block diagram representation of 5th
5 generation core (5GC) network architecture, in accordance with exemplary
implementation of the present disclosure. As shown 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], a Session Management Function (SMF) [108], a Service Communication Proxy (SCP) [110],
10 an Authentication Server Function (AUSF) [112], a Network Slice Specific
Authentication and Authorization Function (NSSAAF) [114], a Network Slice Selection Function (NSSF) [116], a Network Exposure Function (NEF) [118], a Network Repository Function (NRF) [120], a Policy Control Function (PCF) [122], a Unified Data Management (UDM) [124], an application function (AF) [126], a
15 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.
[0048] Radio Access Network (RAN) [104] is the part of a mobile
20 telecommunications system that connects user equipment (UE) [102] to the core
network (CN) and provides access to different types of networks (e.g., 5G network). It consists of radio base stations and the radio access technologies that enable wireless communication.
25 [0049] 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 procedures like handovers and paging.
30 [0050] Session Management Function (SMF) [108] is a 5G core network function
responsible for managing session-related aspects, such as establishing, modifying,
16

and releasing sessions. It coordinates with the User Plane Function (UPF) for data forwarding and handles IP address allocation and QoS enforcement.
[0051] Service Communication Proxy (SCP) [110] is a network function in the 5G
5 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.
[0052] Authentication Server Function (AUSF) [112] is a network function in the
10 5G core responsible for authenticating UEs during registration and providing
security services. It generates and verifies authentication vectors and tokens.
[0053] Network Slice Specific Authentication and Authorization Function
(NSSAAF) [114] is a network function that provides authentication and
15 authorization services specific to network slices. It ensures that UEs can access only
the slices for which they are authorized.
[0054] Network Slice Selection Function (NSSF) [116] is a network function
responsible for selecting the appropriate network slice for a UE based on factors
20 such as subscription, requested services, and network policies.
[0055] 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. 25
[0056] Network Repository Function (NRF) [120] is a network function that acts as a central repository for information about available network functions and services. It facilitates the discovery and dynamic registration of network functions.
17

[0057] 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.
5 [0058] Unified Data Management (UDM) [124] is a network function that
centralizes the management of subscriber data, including authentication, authorization, and subscription information.
[0059] Application Function (AF) [126] is a network function that represents
10 external applications interfacing with the 5G core network to access network
capabilities and services.
[0060] User Plane Function (UPF) [128] is a network function responsible for
handling user data traffic, including packet routing, forwarding, and QoS
15 enforcement.
[0061] 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.
20
[0062] FIG. 2 illustrates an exemplary block diagram of a computing device [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] may be in communication with a
25 communication network and may also implement a method for optimising a
network performance. In another implementation, the computing device [200] in communication with the communication network, itself implements the method for optimising the network performance within the computing device [200], wherein a person skilled in the art would appreciate that said one or more units are capable of
30 implementing the features as disclosed in the present disclosure.
18

[0063] The computing device [200] may include a bus [202] or other
communication mechanism for communicating information, and a processor [204]
coupled with the bus [202] for processing information. The processor [204] may
be, for example, a general-purpose microprocessor. The computing device [200]
5 may also include a main memory [206], such as a random-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
10 instructions, when stored in non-transitory storage media 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
15 instructions for the processor [204].
[0064] 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
20 display [212], such as a cathode ray tube (CRT), Liquid crystal Display (LCD),
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
25 [204]. Another type of user input device may be a cursor controller [216], such as 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]. This 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
30 the device to specify positions in a plane.
19

[0065] 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.
5 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
10 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.
15 [0066] The computing device [200] also may include a communication interface
[218] coupled to the bus [202]. The communication interface [218] 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
20 a modem to provide a data communication connection to a 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,
25 electromagnetic or optical signals that carry digital data streams representing
various types of information.
[0067] The computing device [200] can send messages and receive data, including
program code, through the network(s), the network link [220] and the
30 communication interface [218]. In the Internet example, a server [230] might
transmit a requested code for an application program through the Internet [228], the
20

Internet Service Provider (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. 5
[0068] The computing device [200] encompasses a wide range of electronic devices capable of processing data and performing computations. Examples of computing device [200] include, but are not limited only to, personal computers, laptops, tablets, smartphones, servers, and embedded systems. The devices may
10 operate independently or as part of a network and can perform a variety of tasks
such as data storage, retrieval, and analysis. Additionally, computing device [200] may include peripheral devices, such as monitors, keyboards, and printers, as well as integrated components within larger electronic systems, showcasing their versatility in various technological applications.
15
[0069] Referring to FIG. 3, an exemplary block diagram of a system [300] for optimising a network performance, 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 storage
20 unit [306]. Also, all of the components/ units of the system [300] are assumed to be
connected to each other unless otherwise indicated below. Also, in FIG. 3 only a few units are shown, however, the system [300] may comprise multiple such units or the system [300] may comprise any such numbers of said units, as required to implement the features of the present disclosure. Further, in an implementation, the
25 system [300] may be in communication with the user device (may also referred to
herein as a user equipment or UE). In another implementation, the system [300] may reside in a server or at a network entity.
[0070] The system [300] is configured for optimising the network performance,
30 with the help of the interconnection between the components/units of the system
[300].
21

[0071] The system comprises the transceiver unit [302], the transceiver unit [302]
is configured to receive, at an Access and Mobility Management Function (AMF)
[106] from a user equipment (UE) [102], a network procedure associated with the
5 network. The UE may be selected from but is not limited to, a smartphone, a tablet
or a laptop.
[0072] The transceiver unit [302] is further configured to receive, at the AMF [106] from oner or more entities associated with a radio access network (RAN) [104], the
10 network procedure associated with the network. It is to be noted that at least one of
the UE [102], the one or more entities associated with RAN [104], one or more second entities associated with the network may initiate network procedures that are then directed to and handled by the AMF [106]. The network procedure may involve procedures related to initial connection setup, handover between different
15 cell towers (e.g., in the case of RAN), or other management activities that may be
appreciated by a person skilled in the art to qualify as the network procedure within the network. For example a network procedure with the network may relate to at least one of an attach procedure, wherein a particular UE attaches to the network, registering with the MME (Mobility Management Entity) and establishing a
20 signalling connection; an Authentication procedure wherein the particular UE
authenticates with the network using a user credentials and the HSS (Home Subscriber Server); a location update procedure, wherein the particular UE updates its location with the MME and the HSS, allowing the network to track its whereabouts; a session establishment procedure, wherein the particular UE sets up
25 a data session with a Packet Data Network Gateway (PGW) and a Serving Gateway
(SGW); a handover procedure, wherein the particular UE transitions between cells or networks, maintaining its connection and session continuity, and any other like such network procedure that may be appreciated by a person skilled in the art to implement the present disclosure.
30
22

[0073] Further, in an implementation of the present solution the one or more second
entities associated with the network may be one of a Session Management Function
(SMF) [108], and a User Plane Function (UPF) [128]. Further, said one or more
entities i.e., the SMF [108] and the UPF [128] that may initiate network procedures
5 that are then directed to and handled by the AMF [106].
[0074] Further, in another implementation of the present solution the one or more entities associated with the RAN [104] such as a gNodeB may initiate network procedures that are then directed to and handled by the AMF [106]. Further, as used
10 herein, the gNodeB associated with RAN [104] may refer to a component in the
network that provides wireless connectivity to UE [102] in the network. Further, the gNodeB is responsible for transmitting and receiving radio signals to and from the UE [102], and for forwarding data to and from the network, and may also facilitate one or more functionality in the network such as including a radio resource
15 management, a mobility management, and a data transmission/reception.
[0075] Further, the processing unit [304] is connected to at least the transceiver unit
[302], the processing unit [304] is configured to detect, at the AMF [106], a
procedure queue associated with the UE [102], wherein the procedure queue
20 associated with the UE [102] comprises at least a count of pending procedures
associated with the UE [102] and a pending procedure threshold value. The procedure queue associated with the UE [102] is based on at least a first come first serve (FCFS) logic.
25 [0076] The procedure queue refers to a list or queue of network procedures that are
awaiting processing or completion for a specific user equipment such as the (UE) [102]. The procedure queue may have a line-up of tasks or actions that need to be performed for the UE [102] within the network. The count of pending procedures is the number of procedures (tasks, actions, or commands) that are waiting to be
30 executed for the UE [102]. Each procedure typically represents a specific network
operation that needs to be carried out. The pending procedure threshold value such
23

as 10 pending procedure, 20 pending procedure, 25 pending procedure, etc., sets a
limit on the number of pending procedures that can be queued up for a particular
UE at any given time. Once this threshold is reached, the solution might take
specific actions, such as prioritizing certain procedures or delaying new requests.
5 The FCFS logic means that the procedures in the queue are handled in the order
they were received or requested. In other words, the oldest pending procedure (the one that arrived first) gets processed first.
[0077] Further, the processing unit [304] is configured to determine, at the AMF
10 [106], a breach condition associated with the pending procedure threshold value.
The breach condition associated with the pending procedure threshold value is
detected in an event the count of pending procedure associated with the UE [102]
is at least one of equal to the pending procedure threshold value associated with the
UE [102] and greater the pending procedure threshold value associated with the UE
15 [102].
[0078] The breach condition indicates a state or situation that signifies a violation or exceeding a predefined limit related to pending procedures associated with the UE [102]. The processing unit [304] may continuously monitors the count of
20 pending procedures linked to a particular UE and compares such count against a
predefined pending procedure threshold value. If the count of pending procedures equals or exceeds this threshold value, a breach condition is detected. For example, if a UE-A has 2 pending procedures associated with it. Them the pending procedure is within the acceptable limit (i.e., below the pending procedure threshold value
25 such as 3). At a certain point, if the count of pending procedures associated with the
UE-a reaches 3. This triggers the breach condition because the count of pending procedures has now equalled the pending procedure threshold value (i.e., 3).
[0079] Further, the processing unit [304] is configured to clear, at the AMF [106],
30 the procedure queue based on the breach condition. Upon detecting the breach
condition, the system may initiate predefined actions such as notifying network
24

administrators, adjusting network parameters, or taking corrective measures such as clearing the procedures in the procedure queue.
[0080] Further, the processing unit [304] is configured to initiate, from the AMF
5 [106] to the UE [102], a UE terminated registration request with re-registration
option based clearing the procedure queue. The UE terminated registration request
is a request sent from the network (AMF) [106] to the UE [102], asking the UE
[102] to register or re-register itself with the network. It typically involves the UE
[102] providing updated information or confirming its presence and readiness to
10 communicate.
[0081] Further, the processing unit [304] is configured to detect, at the AMF [106],
an initial registration event associated with the UE [102] based on the UE
terminated registration request with re-registration option. The initial registration
15 request refers to the first instance or occurrence of a registration process involving
the UE [102]. This could be the first registration of the UE [102] with the network or a re-registration after a significant event such as network handover or change.
[0082] Further, the processing unit [304] is configured to optimise, at the AMF
20 [106], the network performance based on the initial registration event associated
with the UE [102]. In order to optimise the network performance, the processing
unit [304] is further configured to optimise a UE recovery time associated with the
UE [102] based on the clearance of the procedure queue. Upon clearing the
procedure queue associated with the UE [102], the processing unit [304] optimizes
25 the UE recovery time. As used herein, optimising the UE recovery time may
involves minimizing the time it takes for the UE [102] to complete necessary procedures and resume normal operation within the network.
[0083] Further, as used herein, the “UE recovery time" refers to the time it takes
30 for a User Equipment (UE) to restore its connection and services after a failure or
disruption, such as a handover failure, network outage, or software restart. The UE
25

recovery time indicates a measures of the time taken by the UE to recover and regain its normal operational state, enabling the user to access network services and features again.
5 [0084] Referring to FIG.4, an exemplary flow diagram of a method [400] for
optimising a network performance, in accordance with exemplary implementations
of the present disclosure is shown. In an implementation the method [400] is
performed by the system [300]. Further, in an implementation, the system [300]
may be present in a server device to implement the features of the present
10 disclosure. Also, as shown in FIG. 4, the method [400] starts at step [402].
[0085] At step [404], the method comprises receiving, by a transceiver unit [302] at an Access and Mobility Management Function (AMF) [106] from a user equipment (UE) [102], a network procedure associated with the network. Further,
15 the method [400] further comprise receiving, by the transceiver unit [302] at the
AMF [106] from oner or more entities associated with a radio access network (RAN) [104], the network procedure associated with the network. It is to be noted that UE, at least one of the UE [102], the one or more entities associated with the RAN [104], and one or more second entities associated with the network procedure
20 may initiate network procedures that are then directed to and handled by the AMF
[106]. The network procedure may involve procedures related to initial connection setup, handover between different cell towers (e.g., in the case of RAN), or other management activities that may be appreciated by a person skilled in the art to qualify as the network procedure within the network.
25
[0086] Further, in an implementation of the present solution the one or more second
entities associated with network may be one of a Session Management Function
(SMF) [108], and a User Plane Function (UPF) [128]. Further, said one or more
30 entities i.e., the SMF [108] and the UPF [128] that may initiate network procedures
that are then directed to and handled by the AMF [106].
26

[0087] Further, in another implementation of the present solution the one or more
entities associated with RAN [104] such as a gNodeB may initiate network
procedures that are then directed to and handled by the AMF [106]. Further, as used
5 herein, the gNodeB associated with RAN [104] may refer to a component in the
network that provides wireless connectivity to UE [102] in the network. Further,
the gNodeB is responsible for transmitting and receiving radio signals to and from
the UE [102], and for forwarding data to and from the network, and may also
facilitate one or more functionality in the network such as including a radio resource
10 management, a mobility management, and a data transmission/reception.
[0088] At step [406], the method comprises detecting, by a processing unit [304] at the AMF [106], a procedure queue associated with the UE [102], wherein the
15 procedure queue associated with the UE [102] comprises at least a count of pending
procedures associated with the UE [102] and a pending procedure threshold value. The procedure queue refers to a list or queue of network procedures that are awaiting processing or completion for a specific user equipment such as the (UE) [102]. The procedure queue may have a line-up of tasks or actions that need to be
20 performed for the UE [102] within the network. The count of pending procedures
is the number of procedures (tasks, actions, or commands) that are waiting to be executed for the UE [102]. Each procedure typically represents a specific network operation that needs to be carried out. The pending procedure threshold value sets a limit on the number of pending procedures that can be queued up for a particular
25 UE at any given time. Once this threshold is reached, the solution might take
specific actions, such as prioritizing certain procedures or delaying new requests.
[0089] At step [408], the method comprises determining, by the processing unit
[304] at the AMF [106], a breach condition associated with the pending procedure
30 threshold value. The breach condition associated with the pending procedure
threshold value is detected in an event the count of pending procedure associated
27

with the UE [102] is at least one of equal to the pending procedure threshold value
associated with the UE [102] and greater the pending procedure threshold value
associated with the UE [102]. The breach condition indicates a state or situation
that signifies a violation or exceeding a predefined limit related to pending
5 procedures associated with the UE [102]. The processing unit [304] may
continuously monitors the count of pending procedures linked to a particular UE and compares such count against a predefined pending procedure threshold value. If the count of pending procedures equals or exceeds this threshold value, a breach condition is detected. For example, if a UE-A has 2 pending procedures associated
10 with it. Them the pending procedure is within the acceptable limit (i.e., below the
pending procedure threshold value such as 3). At a certain point, if the count of pending procedures associated with the UE-a reaches 3. This triggers the breach condition because the count of pending procedures has now equalled the pending procedure threshold value (i.e., 3).
15
[0090] At step [410], the method comprises clearing, by the processing unit [304] at the AMF [106], the procedure queue based on the breach condition. Upon detecting the breach condition, the system may initiate predefined actions such as notifying network administrators, adjusting network parameters, or taking
20 corrective measures such as clearing the pending procedures in the procedure
queue.
[0091] Further, the procedure queue associated with the UE [102] is based on at
least a first come first serve (FCFS) logic. The FCFS logic means that the
25 procedures in the queue are handled in the order they were received or requested.
In other words, the oldest pending procedure (the one that arrived first) gets processed first.
[0092] At step [412], the method comprises initiating, by the processing unit [304]
30 from the AMF [106] to the UE [102], a UE terminated registration request with re-
registration option based clearing the procedure queue. The UE terminated
28

registration request is a request sent from the network (AMF) [106] to the UE [102], asking the UE [102] to register or re-register itself with the network. It typically involves the UE [102] providing updated information or confirming its presence and readiness to communicate. 5
[0093] At step [414], the method comprises detecting, by the processing unit [304]
at the AMF [106], an initial registration event associated with the UE [102] based
on the UE terminated registration request with re-registration option. The initial
registration request refers to the first instance or occurrence of a registration process
10 involving the UE [102]. This could be the first registration of the UE [102] with the
network or a re-registration after a significant event such as network handover or change.
[0094] At step [416], the method comprises optimising, by the processing unit
15 [304] at the AMF [106], the network performance based on the initial registration
event associated with the UE [102]. The optimising the network performance
further comprises optimising a UE recovery time associated with the UE [102]
based on the clearing the procedure queue. Upon clearing the procedure queue
associated with the UE [102], the processing unit [304] optimizes the UE recovery
20 time. It is to be noted that optimising the UE recovery time means to decrease the
recovery time to a certain or optimum level to make the communication effective.
[0095] Thereafter, at step [418], the method [400] is terminated.
25 [0096] FIG.5 illustrates an exemplary sequence [500] flow diagram for optimising
a network performance, in accordance with exemplary implementations of the present disclosure.
[0097] At step S1, with newly coming procedures (for e.g., a procedure 1) from a
30 user equipment (UE) [102]/Radio Access Network (RAN) [104] or network, an
Access and Mobility Management Function (AMF) [106] checks if some procedure
29

is already running and whether pending queue size has reached to its max limit size i.e., the pending procedure threshold value.
[0098] At step S2, the AMF [106] sends new procedure(s) (e.g., procedures 2, 3,..n,
5 etc.) into a pending queue until the pending queue is not full i.e., the count of
pending procedures associated with the UE [102] is less than the pending procedure threshold value. The AMF [106] keeps handling pending queue procedures in a First Come First Serve (FCFS) order.
10 [0099] At step S3, the AMF [106] clean-up the entire pending queue and at step S4,
the AMF [106] triggers a UE terminated de-registration request with re-registration option if the pending queue size reached to maximum configure size or maximum limit. i.e., the breach condition associated with the pending procedure threshold value is determined.
15
[0100] At step S5, the UE will initiate initial registration i.e., an initial registration event associated with the UE [102], for optimizing response time for forthcoming procedures.
20 [0101] The optimising of the network performance further comprises optimising a
UE recovery time associated with the UE [102] based on the clearing the procedure queue that is performed at S3.
[0102] Thereafter, the sequence [500] flow diagram terminates.
25
[0103] Yet another aspect of the present disclosure may relate to a User Equipment (UE) for optimising a network performance, the UE comprising a memory and a processor coupled to the memory. The processor is configured to transmit, to a system [300], a request for optimising the network performance along with a
30 network procedure associated with the network at an Access and Mobility
Management Function (AMF) [106], and receive, a response to the request from
30

the system [300], wherein the response comprises an indication of optimisation of
the network performance based on based on the request, and wherein the response
is generated at the system [300] based on receiving, by the system [300] at an
Access and Mobility Management Function (AMF) [106] from a user equipment
5 (UE) [102], a network procedure associated with the network. Further, the response
is generated based on detecting, by the system [300] at the AMF [106], a procedure queue associated with the UE [102], wherein the procedure queue associated with the UE [102] comprises at least a count of pending procedures associated with the UE [102] and a pending procedure threshold value. Further, the response is
10 generated based on determining, by the system [300] at the AMF [106], a breach
condition associated with the pending procedure threshold value. Further, the response is generated based on clearing, by the system [300] at the AMF [106], the procedure queue based on the breach condition. Further, the response is generated based on initiating, by the system [300] from the AMF [106] to the UE [102], a UE
15 terminated registration request with re-registration option based clearing the
procedure queue. Further, the response is generated based on detecting, the system [300] at the AMF [106], an initial registration event associated with the UE [102] based on the UE terminated registration request with re-registration option. Thereafter, the response is generated based on optimising, the system [300] at the
20 AMF [106], and the network performance based on the initial registration event
associated with the UE [102].
[0104] Yet another aspect of the present disclosure may relate to a non-transitory computer readable storage medium storing instructions for optimising a network
25 performance, the instructions comprising executable code which, when executed by
one or more units of a system [300] causes a transceiver unit [302] of the system [300] to receive, at an Access and Mobility Management Function (AMF) [106] from an user equipment (UE) [102], a network procedure associated with the network. The executable code which, when executed causes a processing unit [304]
30 of the system [300] to detect, at the AMF [106], a procedure queue associated with
the UE [102], wherein the procedure queue associated with the UE [102] comprises
31

at least a count of pending procedures associated with the UE [102] and a pending
procedure threshold value. Further, the executable code which, when executed
causes the processing unit [304] of the system [300] to determine, at the AMF [106],
a breach condition associated with the pending procedure threshold value. Further,
5 the executable code which, when executed causes the processing unit [304] of the
system [300] to clear, at the AMF [106], the procedure queue based on the breach condition. Further, the executable code which, when executed causes the processing unit [304] of the system [300] to initiate, from the AMF [106] to the UE [102], a UE terminated registration request with re-registration option based clearing the
10 procedure queue, Further, the executable code which, when executed causes the
processing unit [304] of the system [300] to detect, at the AMF [106], an initial registration event associated with the UE [102] based on the UE terminated registration request with re-registration option. Thereafter, the executable code which, when executed causes the processing unit [304] of the system [300] to
15 optimise, at the AMF [106], the network performance based on the initial
registration event associated with the UE [102].
[0105] As is evident from the above, the present disclosure provides a technically advanced solution for efficient management of procedure queues for a user
20 equipment (UE) [102] in AMF. The solution disclosed herein provides a technical
advantage by optimising network signalling and reducing user equipment (UE) [102] recovery time in a telecommunications network. By efficiently managing procedure queues associated with an Access and Mobility Management Function (AMF), the invention minimises congestion and improves overall network
25 performance. This leads to enhanced user experiences, reduced service disruptions,
and increased network efficiency.
[0106] Further, the technical effect of the present solution is a significant reduction
in a user equipment (UE) recovery time during congestion scenarios. By
30 dynamically determining triggers based on pre-defined threshold counts associated
with procedure queues, the solution of the present disclosure enables faster recovery
32

and re-establishment of network connectivity for UEs. The use of terminate de-registration messages with re-registration options expedites the recovery process, while the transmission of negative acknowledgments (nacks) ensures efficient resource utilisation and optimised network signalling. Furthermore, the present solution provided an advanced solution to resolve procedural delays encountered during a network procedure handling at the Access and Mobility Function (AMF) by implementing a technically advanced solution, wherein the AMF initiates a User Equipment (UE) terminated de-registration request with a re-registration option, the network experiences a halt in signalling transmission, thereby allowing for prompt recovery of the UE. The method disclosed in the present disclosure ensures that upon receipt of the UE terminated registration request with a re-registration option, signalling flows are re-established, leading to immediate UE recovery. These advancements greatly contribute to the seamless operation and improved performance of communication networks, thereby elevating the overall user experience.
[0107] 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.

We Claim:
1. A method for optimising a network performance, the method comprising:
- receiving, by a transceiver unit [302] at an Access and Mobility Management Function (AMF) [106] from a user equipment (UE) [102], a network procedure associated with a network;
- detecting, by a processing unit [304] at the AMF [106], a procedure queue associated with the UE [102], wherein the procedure queue associated with the UE [102] comprises at least a count of pending procedures associated with the UE [102] and a pending procedure threshold value;
- determining, by the processing unit [304] at the AMF [106], a breach condition associated with the pending procedure threshold value;
- clearing, by the processing unit [304] at the AMF [106], the procedure queue based on the breach condition;
- initiating, by the processing unit [304] from the AMF [106] to the UE [102], a UE terminated registration request with re-registration option based clearing the procedure queue;
- detecting, by the processing unit [304] at the AMF [106], an initial registration event associated with the UE [102] based on the UE terminated registration request with re-registration option; and
- optimising, by the processing unit [304] at the AMF [106], the network performance based on the initial registration event associated with the UE [102].
2. The method as claimed in claim 1, wherein the breach condition associated
with the pending procedure threshold value is detected in an event the count
of pending procedure associated with the UE [102] is at least one of equal
to the pending procedure threshold value associated with the UE [102] and
greater than the pending procedure threshold value associated with the UE
[102].

3. The method as claimed in claim 1, wherein the procedure queue associated with the UE [102] is based on at least a first come first serve (FCFS) logic.
4. The method as claimed in claim 1, further comprises receiving, by the transceiver unit [302] at the AMF [106] from one or more entities associated with a radio access network (RAN) [104], the network procedure associated with the network.
5. The method as claimed in claim 1, wherein the optimising the network performance further comprises optimising a UE recovery time associated with the UE [102] based on the clearing the procedure queue.
6. A system for optimising a network performance, the system comprises:
- a transceiver unit [302], wherein the transceiver unit [302] is configured to:
• receive, at an Access and Mobility Management Function (AMF) [106]
from an user equipment (UE) [102], a network procedure associated
with a network; and
- a processing unit [304] connected to at least the transceiver unit [302],
wherein the processing unit [304] is configured to:
• detect, at the AMF [106], a procedure queue associated with the UE [102], wherein the procedure queue associated with the UE [102] comprises at least a count of pending procedures associated with the UE [102] and a pending procedure threshold value,
• determine, at the AMF [106], a breach condition associated with the pending procedure threshold value,
• clear, at the AMF [106], the procedure queue based on the breach condition,
• initiate, from the AMF [106] to the UE [102], a UE terminated registration request with re-registration option based clearing the procedure queue,
• detect, at the AMF [106], an initial registration event associated with the UE [102] based on the UE terminated registration request with re-registration option, and

• optimise, at the AMF [106], the network performance based on the initial registration event associated with the UE [102].
7. The system as claimed in claim 6, wherein the breach condition associated with the pending procedure threshold value is detected in an event the count of pending procedure associated with the UE [102] is at least equal one of equal to the pending procedure threshold value associated with the UE [102] and greater the pending procedure threshold value associated with the UE [102].
8. The system as claimed in claim 6, wherein the procedure queue associated with the UE [102] is based on at least a first come first serve (FCFS) logic.
9. The system as claimed in claim 6, wherein the transceiver unit [302] is further configured to receive, at the AMF [106] from oner or more entities associated with a radio access network (RAN) [104], the network procedure associated with the network.
10. The system as claimed in claim 6, wherein to optimise the network performance the processing unit [304] is further configured to optimise a UE recovery time associated with the UE [102] based on the clearance of the procedure queue.