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 OVERWRITING NETWORK REQUESTS BASED
ON A PRIORITY OF TIMESTAMPS”
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 OVERWRITING NETWORK REQUESTS BASED
ON A PRIORITY OF TIMESTAMPS
TECHNICAL FIELD
5
[0001] Embodiments of the present disclosure generally relate to network performance management systems. More particularly, embodiments of the present disclosure relate to method and system for overwriting network requests based on a priority of timestamps.
10 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
15 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
20 generation of wireless communication technology was based on analog technology and offered
only voice services. However, with the advent of the second-generation (2G) technology, digital communication and data services became possible, and text messaging was introduced. The third-generation (3G) technology marked the introduction of high-speed internet access, mobile video calling, and location-based services. The fourth-generation (4G) technology
25 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.
30
[0004] Existing systems such as PCF and BSF support multiple sessions per subscriber based on unique identifiers like SUPI, DNN, and Slice. However, challenges arise when these systems need to determine which session is the oldest for overwriting purposes, particularly when requests for the same subscriber are received out of sequence and within very short
2

intervals. Furthermore, the timestamps provided by PCF may become irrelevant if the requests
are forwarded to the BSF in a disordered manner, rendering the process inefficient and
potentially leading to erroneous session management. Existing techniques rely on timestamps
defined by 3GPP standards, but these can be insufficient for handling corner cases such as
5 when the SMF fails to send any of the required timestamp headers or sends them in an order
different from what the PCF/BSF can effectively use. Additionally, the existing systems lack
flexibility in prioritizing timestamps, which is crucial when dealing with high volumes of
network traffic and ensuring accurate session management. This often results in the inability
to effectively manage sessions based on the most accurate or relevant timestamps, leading to
10 potential errors in session prioritization and overwriting.
[0005] Thus, there exists an imperative need in the art to provide system and method for overwriting network requests based on a priority of timestamps.
15 SUMMARY
[0006] 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.
20
[0007] An aspect of the present disclosure may relate to a method for overwriting network requests based on a priority of timestamps. The method comprising receiving, by a transceiver unit, a network request from at least one Network Function (NF). The method comprises generating, by a generator unit, a local timestamp associated with the received network request.
25 The method comprises defining, by a determination unit, a priority order of the one or more
timestamps associated with said each of the network request received from each of the Network Functions (NFs), wherein the defined priority order comprises a top priority timestamp followed by a plurality of subsequent lower priority timestamps. The method comprises based at least on the defined priority order of the one or more timestamps, performing, by the analysis
30 unit, an overwrite operation, wherein the overwrite operation comprises processing the
plurality of network requests in order of decreasing priority timestamps.
[0008] In an exemplary aspect of the present disclosure, the received network request comprises at least one of an origination timestamps and a sender timestamp.
3

[0009] In an exemplary aspect of the present disclosure, the local timestamp corresponds to a time value recorded by clock at which the network request is received from the at least one NF. 5
[0010] In an exemplary aspect of the present disclosure, the one or more timestamps comprises an origination timestamp, a sender timestamp, and the local timestamp.
[0011] In an exemplary aspect of the present disclosure, a pre-defined priority order
10 comprises the origination timestamp, followed by the sender timestamp, and subsequently
followed by the local timestamp.
[0012] In an exemplary aspect of the present disclosure, the priority order of the one or more timestamps is configurable by a user. 15
[0013] In an exemplary aspect of the present disclosure, the priority order of the one or more timestamps is configured and derived by the at least one NF.
[0014] In an exemplary aspect of the present disclosure, the NFs are selected from a group
20 consisting of: a Policy Control Function (PCF), a Binding Support Function (BSF), a Session
Management Function (SMF), and a Network Exposure Function (NEF).
[0015] In an exemplary aspect of the present disclosure, the origination timestamp associated with an SMF indicates the timestamp at which the network request originates at the SMF.
25
[0016] In an exemplary aspect of the present disclosure, the plurality of network requests are processed based on the origination timestamp, wherein the origination timestamp is utilized to perform the overwrite operation in an event when one or more network requests are received by the transceiver unit in a short interval of time for a same Subscription Permanent Identifier
30 (SUPI), Packet Data Network (PDN) Type, Data Network Name (DNN), or Packet Data Unit
(PDU) Session Identifier.
[0017] Another aspect of the present disclosure relate to a system for overwriting network requests based on a priority of timestamps, the system comprising a transceiver unit configured
4

to receive a network request from at least one Network Function (NF). The system further
comprises a transceiver unit configured to receive a network request from at least one Network
Function (NF). The system further comprises a generator unit connected to at least the
transceiver unit, wherein the generator unit configured to generate a local timestamp associated
5 with the received network request. The system further comprises a determination unit
connected to at least the generator unit, wherein the determination unit configured to define a priority order of the one or more timestamps associated with each of the network request received from each of the Network Functions (NFs), wherein the defined priority order comprises a top priority timestamp followed by a plurality of subsequent lower priority
10 timestamps. The system comprises based at least on the defined priority order of the one or
more timestamps, an analysis unit connected to at least the determination unit, wherein the analysis unit configured to perform an overwrite operation, wherein the overwrite operation comprises processing the plurality of network requests in order of decreasing priority timestamps.
15
[0018] Yet another aspect of the present disclosure may relate to a non-transitory computer readable storage medium storing instruction for overwriting network requests based on a priority of timestamps, the instructions include executable code which, when executed by a one or more units of a system, causes: a transceiver unit of the system to receive a network request
20 from at least one Network Function (NF). A generator unit of the system to generate a local
timestamp associated with the received network request. A determination unit of the system to define a priority order of the one or more timestamps associated with each of the network request received from each of the Network Functions (NFs), wherein the defined priority order comprises a top priority timestamp followed by a plurality of subsequent lower priority
25 timestamps. Based at least on the defined priority order of the one or more timestamps, the
analysis unit of the system to perform an overwrite operation, wherein the overwrite operation comprises processing the plurality of network requests in order of decreasing priority timestamps.
30 OBJECTS OF THE INVENTION
[0019] Some of the objects of the present disclosure, which at least one embodiment disclosed herein satisfies are listed herein below.
5

[0020] It is an object of the present disclosure to provide a system and a method for providing timestamp implementation between Policy Control Function (PCF) and Binding Support Function (BSF).
5 [0021] It is another object of the present disclosure to provide a solution that can provide an
ability to use the local system timestamp (assuming that Network Timer Protocol (NTP) synchronization is in place) for the purpose of generation of timestamp in case no 3GPP specified header is received from peer NF for updating the field which is used for making the overwrite decision.
10
[0022] It is another object of the present disclosure to provide a solution that in case where both “3gpp-Sbi-Origination-Timestamp” and “3gpp-Sbi-Sender-Timestamp” are received in same message, is able to assign an order of priority so that system can select the correct timestamp which is used for making the overwrite decision.
15
[0023] It is yet another object of the present disclosure to provide a solution that has an ability to use “3gpp-Sbi-Origination-Timestamp” even in case of PCF to BSF so that Packet Data Unit (PDU) Session creation time is used as baseline rather than PCF local processing time for making the overwrite decision at BSF.
20
DESCRIPTION OF THE DRAWINGS
[0024] The accompanying drawings, which are incorporated herein, and constitute a part of this disclosure, illustrate exemplary embodiments of the disclosed methods and systems in
25 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 and system according to the disclosure are illustrated herein to highlight the advantages of the
30 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.
6

[0025] FIG. 1 illustrates an exemplary block diagram representation of 5th generation core (5GC) network architecture.
[0026] FIG. 2 illustrates an exemplary block diagram of a computer system upon which the
5 features of the present disclosure may be implemented in accordance with exemplary
implementation of the present disclosure.
[0027] FIG. 3 illustrates an exemplary block diagram of a system for overwriting network
requests based on a priority of timestamps, in accordance with exemplary implementations of
10 the present disclosure.
[0028] FIG. 4 illustrates a method flow diagram for overwriting network requests based on a priority of timestamps in accordance with exemplary implementations of the present disclosure. 15
[0029] FIG. 5 illustrates an exemplary sequence diagram for overwriting network requests based on a priority of timestamps, in accordance with exemplary embodiments of the present disclosure.
20 [0030] FIG. 6 illustrates an exemplary sequence diagram for overwriting network requests
based on a priority of timestamps, in accordance with exemplary embodiments of the present disclosure.
[0031] The foregoing shall be more apparent from the following more detailed description of
25 the disclosure.
DETAILED DESCRIPTION
[0032] In the following description, for the purposes of explanation, various specific details
30 are set forth in order to provide a thorough understanding of 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
7

may not address any of the problems discussed above or might address only some of the problems discussed above.
[0033] The ensuing description provides exemplary embodiments only, and is not intended
5 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. 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.
10
[0034] 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 may be shown as components in block
15 diagram form in order not to obscure the embodiments in unnecessary detail.
[0035] 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
20 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.
[0036] The word “exemplary” and/or “demonstrative” is used herein to mean serving as an
25 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 known to those of ordinary skill in the art. Furthermore, to the extent
30 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.
8

[0037] 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 of microprocessors, one or more
5 microprocessors in association with a (Digital Signal Processing) DSP core, a controller, a
microcontroller, Application Specific Integrated Circuits, Field Programmable Gate Array
circuits, any other type of integrated circuits, etc. The processor may perform signal coding
data processing, input/output processing, and/or any other functionality that enables the
working of the system according to the present disclosure. More specifically, the processor or
10 processing unit is a hardware processor.
[0038] 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
15 be any electrical, electronic and/or computing device or equipment, capable of implementing
the features of the present disclosure. The user equipment/device may include, but is not limited to, a mobile phone, smart phone, laptop, a general-purpose computer, desktop, personal digital assistant, tablet computer, wearable device or any other computing device which is capable of implementing the features of the present disclosure. Also, the user device may contain at least
20 one input means configured to receive an input from at least one of 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.
[0039] As used herein, “storage unit” or “memory unit” refers to a machine or computer-
25 readable medium including any mechanism for storing information in a form readable by a
computer or similar machine. For example, a computer-readable medium includes read-only
memory (“ROM”), random access memory (“RAM”), magnetic disk storage media, optical
storage media, flash memory devices or other types of machine-accessible storage media. The
storage unit stores at least the data that may be required by one or more units of the system to
30 perform their respective functions.
[0040] 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 be referred to a set of rules or protocols that define communication or interaction of one
9

or more modules or one or more units with each other, which also includes the methods, functions, or procedures that may be called.
[0041] All modules, units, components used herein, unless explicitly excluded herein, may
5 be software modules or hardware processors, the processors being a general-purpose processor,
a special purpose processor, a conventional processor, a digital signal processor (DSP), a plurality of microprocessors, one or more microprocessors in association with a DSP core, a controller, a microcontroller, Application Specific Integrated Circuits (ASIC), Field Programmable Gate Array circuits (FPGA), any other type of integrated circuits, etc.
10
[0042] BSF (Binding Support Function): The BSF is another network function in 5G networks that provides support for binding-related procedures. It assists in establishing and maintaining bindings between user equipment (UE) and its IP address. The BSF plays a crucial role in mobility management and session continuity in 5G networks.
15
[0043] NTP (Network Time Protocol): NTP is a protocol used for synchronizing the time of computer systems and network devices over a network. It ensures that all devices in a network are synchronized to a common time reference, usually provided by an NTP server. NTP is essential for various network operations, including timestamping events, logging, and
20 coordination between different network elements.
[0044] Subscription Permanent Identifier (SUPI) is an identifier uniquely identifying a subscriber in the network.
25 [0045] Packet Data Network (PDN) Type: Specifies the type of packet data network to which
the UE is connected, such as IPv4 or IPv6.
[0046] Data Network Name (DNN) is the name of the data network to which the UE is connected. 30
[0047] Packet Data Unit (PDU) Session Identifier is an identifier associated with a specific packet data session between the UE and the network.
10

[0048] As used herein the transceiver unit include at least one receiver and at least one transmitter configured respectively for receiving and transmitting data, signals, information or a combination thereof between units/components within the system and/or connected with the system. 5
[0049] As discussed in the background section, the existing systems such as PCF and BSF support multiple sessions per subscriber based on unique identifiers like SUPI, DNN, and Slice. However, challenges arise when these systems need to determine which session is the oldest for overwriting purposes, particularly when requests for the same subscriber are received out
10 of sequence and within very short intervals. Furthermore, the timestamps provided by PCF may
become irrelevant if the requests are forwarded to the BSF in a disordered manner, rendering the process inefficient and potentially leading to erroneous session management. Existing techniques rely on timestamps defined by 3GPP standards, but these can be insufficient for handling corner cases such as when the SMF fails to send any of the required timestamp headers
15 or sends them in an order different from what the PCF/BSF can effectively use. Additionally,
the existing systems lack flexibility in prioritizing timestamps, which is crucial when dealing with high volumes of network traffic and ensuring accurate session management. This often results in the inability to effectively manage sessions based on the most accurate or relevant timestamps, leading to potential errors in session prioritization and overwriting.
20
[0050] The present disclosure aims to overcome the above-mentioned and other existing problems in the field of network request management by providing a method that enhances the accuracy and efficiency of handling network requests, especially when multiple requests are received in a very short duration and out of sequence. The proposed solution provides a refined
25 approach to timestamp prioritization and handling for managing sessions effectively in network
functions like PCF and BSF. Firstly, the proposed solution introduces a system where timestamps are not only collected from various sources (e.g., origination, sender, and local system timestamps), but also prioritized in a configurable manner. The proposed solution allows network functions to determine the most relevant timestamp to use when deciding
30 whether to overwrite an existing session, for example, in high traffic environments where
decisions need to be quick and based on the most accurate data available. Additionally, the proposed solution allows for the generation of a local timestamp at the time of request reception, which serves as a fallback mechanism in scenarios where external timestamps are not provided. The proposed solution ensures that even in the absence of standard timestamps
11

from other network functions, the system can still make informed decisions based on internally
generated data, thus maintaining continuity and accuracy in session management. Moreover,
by defining a priority order for timestamps and providing the ability to configure this order
based on specific network requirements or scenarios, the system offers flexibility not present
5 in traditional systems.
[0051] It would be appreciated by the person skilled in the art that the proposed solution of
timestamp management and session overwrite decisions significantly enhances the capability
of network functions to manage sessions efficiently and accurately, addressing the limitations
10 and challenges posed by existing technologies and standards in the field.
[0052] Hereinafter, exemplary embodiments of the present disclosure will be described with reference to the accompanying drawings.
15 [0053] 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 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
20 (SCP) [110], an Authentication Server Function (AUSF) [112], a Network Slice Specific
Authentication and Authorization Function (NSSAAF) [114], a Network Slice Selection Function (NSSF) [116], a Network Exposure Function (NEF) [118], a Network Repository Function (NRF) [120], a Policy Control Function (PCF) [122], a Unified Data Management (UDM) [124], an application function (AF) [126], a User Plane Function (UPF) [128], a data
25 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.
[0054] Radio Access Network (RAN) [104] is the part of a mobile telecommunications
30 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.
12

[0055] 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. 5
[0056] Session Management Function (SMF) [108] is a 5G core network function responsible for managing session-related aspects, such as establishing, modifying, and releasing sessions. It coordinates with the User Plane Function (UPF) for data forwarding and handles IP address allocation and QoS enforcement. 10
[0057] Service Communication Proxy (SCP) [110] is a network function in the 5G core network that facilitates communication between other network functions by providing a secure and efficient messaging service. It acts as a mediator for service-based interfaces.
15 [0058] Authentication Server Function (AUSF) [112] is a network function in the 5G core
responsible for authenticating UEs during registration and providing security services. It generates and verifies authentication vectors and tokens.
[0059] Network Slice Specific Authentication and Authorization Function (NSSAAF) [114]
20 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.
[0060] 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,
25 requested services, and network policies.
[0061] 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. 30
[0062] 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.
13

[0063] 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 [0064] Unified Data Management (UDM) [124] is a network function that centralizes the
management of subscriber data, including authentication, authorization, and subscription information.
[0065] Application Function (AF) [126] is a network function that represents external
10 applications interfacing with the 5G core network to access network capabilities and services.
[0066] User Plane Function (UPF) [128] is a network function responsible for handling user data traffic, including packet routing, forwarding, and QoS enforcement.
15 [0067] 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.
[0068] FIG. 2 illustrates an exemplary block diagram of a computer system [1000] upon
20 which the features of the present disclosure may be implemented in accordance with exemplary
implementation of the present disclosure. In an implementation, the computer system [1000]
may also implement a method for overwriting network requests based on a priority of
timestamps utilising the system. In another implementation, the computer system [1000] itself
implements the method for overwriting network requests based on a priority of timestamps
25 using one or more units configured within the computer system [1000], wherein said one or
more units are capable of implementing the features as disclosed in the present disclosure.
[0069] The computer system [1000] encompasses a wide range of electronic devices capable
of processing data and performing computations. Examples of computer system [1000]
30 include, but are not limited only to, personal computers, laptops, tablets, smartphones, user
equipment (UE), servers, and embedded systems. The devices may operate independently or as part of a network and can perform a variety of tasks such as data storage, retrieval, and analysis. Additionally, computer system [1000] may include peripheral devices, such as
14

monitors, keyboards, and printers, as well as integrated components within larger electronic systems, showcasing their versatility in various technological applications.
[0070] The computer system [1000] may include a bus [1002] or other communication
5 mechanism for communicating information, and a processor [1004] coupled with bus [1002]
for processing information. The processor [1004] may be, for example, a general-purpose microprocessor. The computer system [1000] may also include a main memory [1006], such as a random-access memory (RAM), or other dynamic storage device, coupled to the bus [1002] for storing information and instructions to be executed by the processor [1004]. The
10 main memory [1006] also may be used for storing temporary variables or other intermediate
information during execution of the instructions to be executed by the processor [1004]. Such instructions, when stored in non-transitory storage media accessible to the processor [1004], render the computer system [1000] into a special-purpose machine that is customized to perform the operations specified in the instructions. The computer system [1000] further
15 includes a read only memory (ROM) [1008] or other static storage device coupled to the bus
[1002] for storing static information and instructions for the processor [1004].
[0071] A storage device [1010], such as a magnetic disk, optical disk, or solid-state drive is provided and coupled to the bus [1002] for storing information and instructions. The computer
20 system [1000] may be coupled via the bus [1002] to a display [1012], 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 [1014], including alphanumeric and other keys, touch screen input means, etc. may be coupled to the bus [1002] for communicating information and command selections to the processor [1004].
25 Another type of user input device may be a cursor control [1016], such as a mouse, a trackball,
or cursor direction keys, for communicating direction information and command selections to the processor [1004], and for controlling cursor movement on the display [1012]. 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 the device to specify positions in a plane.
30
[0072] The computer system [1000] 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 computer system [1000] causes or programs the computer system [1000] to be a special-purpose machine. According to one implementation, the
15

techniques herein are performed by the computer system [1000] in response to the processor
[1004] executing one or more sequences of one or more instructions contained in the main
memory [1006]. Such instructions may be read into the main memory [1006] from another
storage medium, such as the storage device [1010]. Execution of the sequences of instructions
5 contained in the main memory [1006] causes the processor [1004] 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.
[0073] The computer system [1000] also may include a communication interface [1018]
10 coupled to the bus [1002]. The communication interface [1018] provides a two-way data
communication coupling to a network link [1020] that is connected to a local network [1022]. For example, the communication interface [1018] may be an integrated services digital network (ISDN) card, cable modem, satellite modem, or a modem to provide a data communication connection to a corresponding type of telephone line. As another example, the communication
15 interface [1018] 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 [1018] sends and receives electrical, electromagnetic or optical signals that carry digital data streams representing various types of information.
20
[0074] The computer system [1000] can send messages and receive data, including program code, through the network(s), the network link [1020] and the communication interface [1018]. In the Internet example, a server [1030] might transmit a requested code for an application program through the Internet [1028], the ISP [1026], the local network [1022] and the
25 communication interface [1018]. The received code may be executed by the processor [1004]
as it is received, and/or stored in the storage device [1010], or other non-volatile storage for later execution.
[0075] Referring to FIG. 3, an exemplary block diagram of a system [300] for overwriting
30 network requests based on a priority of timestamps, is shown, in accordance with the exemplary
implementations of the present disclosure. The system [300] comprises at least one transceiver unit [301], at least one generator unit [303], at least one determination unit [305 and at least one analysis unit [307], Also, all of the components/ units of the system [300] are assumed to be connected to each other unless otherwise indicated below. As shown in the figures all units
16

shown within the system should also be assumed to be connected to each other. Also, in Fig. 1
only a few units are shown, however, the system [300] may comprise multiple such units or
the system [300] may comprise any such numbers of said units, as required to implement the
features of the present disclosure. Further, in an implementation, the system [300] may be
5 present in a user device to implement the features of the present disclosure. The system [300]
may be a part of the user device / or may be independent of but in communication with the user device (may also referred herein as a UE). In another implementation, the system [300] may 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 user device. 10
[0076] The system [300] is configured for overwriting network requests based on a priority of timestamps, with the help of the interconnection between the components/units of the system [300].
15 [0077] The system [300] comprises a transceiver unit [301] configured to receive a network
request from at least one Network Function (NF). The present disclosure encompasses the transceiver unit [301] is responsible for receiving network requests from one or more Network Functions (NFs). It acts as the interface between the NFs and the system. For example, the NF could be a Session Management Function (SMF) or a Policy Control Function (PCF),
20 responsible for specific roles within the network, such as session management and policy
enforcement respectively. When the SMF sends a request to update or modify a user session, it passes through the network and is received by the transceiver unit [301]. The received network request comprises at least one of an origination timestamp and a sender timestamp.
25 [0078] The origination timestamp associated with the SMF indicates the timestamp at which
the network request originates at the SMF. The origination timestamp refers to the exact time when the network request was initially created by the Network Function (NF). For example, if a Session Management Function (SMF) generates a request to modify a user session, the origination timestamp records the moment this request was generated. The sender timestamp
30 refers to the time at which the request was actually sent by the last NF that handled the request
before it reaches the transceiver unit [301]. This could be the same as the origination timestamp if the originating NF is directly connected to the transceiver unit, or it could be later, indicating a delay or additional processing by intermediate nodes.
17

[0079] In cases where multiple network requests are received in a short interval for the same
subscription or session identifiers (such as Subscription Permanent Identifier (SUPT), Packet
Data Network (PDN) Type, Data Network Name (DNN), or Packet Data Unit (PDU) Session
Identifier), the system [300], by evaluating the timestamps, can accurately determine which
5 request should be prioritized and processed first, thereby preventing potential session conflicts
and ensuring the network operates efficiently. For example, if two requests are received almost
simultaneously for the same user session, the system can compare their origination and sender
timestamps to decide which one to process first. This helps maintain the accuracy of network
resource allocation, especially during peak times or under conditions of network congestion,
10 ensuring that older requests are not overwritten by newer ones unless explicitly intended by
network management policies. The timestamp-based management facilitates in maintaining an orderly and efficient network operation, reducing errors, and enhancing user satisfaction by adhering to the quality of service expectations.
15 [0080] The system comprises the generator unit [303] connected to at least the transceiver
unit [301], wherein the generator unit [303] configured to generate a local timestamp associated with the received network request. The present disclosure encompasses the generator unit [303] generates a local timestamp associated with each received network request. This timestamp represents the time at which the network request is received by the system. For example, a
20 telecommunications network where a SMF sends a request to update a user session's
parameters. Upon receiving this request, the transceiver unit [301] forwards it to the generator unit [303]. The generator unit then assigns a local timestamp derived from the system’s internal clock. This timestamp reflects the system's local time at which the request was physically received, irrespective of the time it was sent or created by the originating NF. The local
25 timestamp corresponds to a time value recorded by clock at which the network request is
received from the at least one NF. Additionally, the local timestamp facilitates in resolving conflicts or deciding between multiple actions that may affect the same user session. For example, if two requests to modify the same user session are received almost simultaneously but from different sources, the local timestamp allows the system to prioritize these requests
30 accurately. The system can use this timestamp to enforce rules such as "first come, first served"
or to implement more complex logic that might involve checking the timestamps against other criteria specified in the network's operational policies.
18

[0081] The system comprises the determination unit [305] connected to at least the generator
unit [303], wherein the determination unit [305] configured to define a priority order of the one
or more timestamps associated with each of the network request received from each of the
Network Functions (NFs), wherein the defined priority order comprises a top priority
5 timestamp followed by a plurality of subsequent lower priority timestamps. The defined
priority order comprises a top priority timestamp followed by a plurality of subsequent lower priority timestamps, ensuring that network operations are handled in a systematic and efficient manner based on the timing of each request. For example, a network may receive multiple requests from different NFs such as a Session Management Function (SMF) and a Policy
10 Control Function (PCF) that need to be processed in an order that respects the timing and
priority of each request to maintain network stability and service quality. The priority order is based on the timestamps, with a top priority timestamp followed by lower priority timestamps wherein the one or more timestamps comprises an origination timestamp, a sender timestamp, and the local timestamp. Further, the pre-defined priority order comprises the origination
15 timestamp, followed by the sender timestamp, and subsequently followed by the local
timestamp. Further, the priority order of the one or more timestamps is configurable by a user Indicates that the priority order of timestamps can be customized or adjusted by the user according to specific requirements or preferences and derived by the at least one NF. The NFs are selected from a group consisting of: a Policy Control Function (PCF), a Binding Support
20 Function (BSF), a Session Management Function (SMF), and a Network Exposure Function
(NEF).
[0082] The system [300] comprises the analysis unit [307] connected to at least the determination unit [305], wherein the analysis unit [307] is configured to perform an overwrite
25 operation based at least on the defined priority order of the one or more timestamps, wherein
the overwrite operation comprises processing the plurality of network requests in order of decreasing priority timestamps. For example, two requests are received simultaneously to modify the same user session: one from a Session Management Function (SMF) and another from a Policy Control Function (PCF). Each request carries its own set of timestamps,
30 including origination and sender timestamps. Based on the priority rules defined by the
determination unit [305], the analysis unit [307] would sequence these requests. If the origination timestamp from the SMF is given higher priority over the sender timestamp from the PCF, the request from the SMF would be processed first. Further, plurality of network requests are processed based on the origination timestamp, wherein the origination timestamp
19

is utilized to perform the overwrite operation in an event when one or more network requests
are received by the transceiver unit [301] in a short interval of time for the same Subscription
Permanent Identifier (SUPI), Packet Data Network (PDN) Type, Data Network Name (DNN),
or Packet Data Unit (PDU) Session Identifier. When such requests arrive almost
5 simultaneously, the analysis unit [307], following the priority determinations from the
determination unit [305], utilizes the origination timestamp to decide which request should be processed first. The origination timestamp indicates the moment at which each request was initially generated by its originating Network Function (NF). The overwrite operation is the process of replacing or updating existing data or requests with new information.
10
[0083] For example, when two requests concerning the same SUPI and DNN arrive at the system: one request originates from an SMF attempting to update session settings due to a change in user data consumption, and another from a PCF looking to adjust policy settings for the same session. Both requests could potentially alter the session state in conflicting ways. By
15 prioritizing these requests based on their origination timestamps, the system ensures that the
earliest request, presumably the one reflecting the initial change condition, is processed first, thus maintaining a logical and consistent session evolution.
[0084] Referring to FIG. 4, an exemplary method flow diagram [400] for overwriting network
20 requests based on a priority of timestamps, 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 disclosure. Also, as shown in FIG. 4, the method [400] starts at step [402]. 25
[0085] At step 404, the method [400] comprises receiving, by a transceiver unit [301], a
network request from at least one Network Function (NF). The present disclosure encompasses
the transceiver unit [301] unit is responsible for receiving network requests from one or more
Network Functions (NFs). It acts as the interface between the NFs and the system. For example,
30 the NF could be a Session Management Function (SMF) or a Policy Control Function (PCF),
responsible for specific roles within the network, such as session management and policy enforcement respectively. When the SMF sends a request to update or modify a user session, it passes through the network and is received by the transceiver unit [301]. The received network request comprises at least one of an origination timestamp and a sender timestamp.
20

[0086] In cases where multiple network requests are received in a short interval for the same
subscription or session identifiers (such as Subscription Permanent Identifier (SUPT), Packet
Data Network (PDN) Type, Data Network Name (DNN), or Packet Data Unit (PDU) Session
5 Identifier), the system [300], by evaluating the timestamps, can accurately determine which
request should be prioritized and processed first, thereby preventing potential session conflicts
and ensuring the network operates efficiently. For example, if two requests are received almost
simultaneously for the same user session, the system can compare their origination and sender
timestamps to decide which one to process first. This helps maintain the accuracy of network
10 resource allocation, especially during peak times or under conditions of network congestion,
ensuring that older requests are not overwritten by newer ones unless explicitly intended by network management policies. The timestamp-based management facilitates in maintaining an orderly and efficient network operation, reducing errors, and enhancing user satisfaction by adhering to the quality-of-service expectations.
15
[0087] At step 406, generating, by a generator unit [303], a local timestamp associated with the received network request. The present disclosure encompasses the generator unit [303] generates a local timestamp associated with each received network request. The timestamp represents the time at which the network request is received by the system. For example, a
20 telecommunications network where a SMF sends a request to update a user session's
parameters. Upon receiving the request, the transceiver unit [301] forwards the request to the generator unit [303]. The generator unit [303] then assigns a local timestamp derived from the system’s internal clock. The timestamp reflects the system's local time at which the request was physically received, irrespective of the time it was sent or created by the originating NF.
25 The local timestamp corresponds to a time value recorded by clock at which the network
request is received from the at least one NF. Additionally, the local timestamp facilitates in resolving conflicts or deciding between multiple actions that may affect the same user session. For example, if two requests to modify the same user session are received almost simultaneously but from different sources, the local timestamp allows the system to prioritize
30 these requests accurately. The system can use the timestamp to enforce rules such as "first
come, first served" or to implement more complex logic that might involve checking the timestamps against other criteria specified in the network's operational policies.
21

[0088] At step 408, defining, by a determination unit [305], a priority order of the one or more
timestamps associated with said each of the network request received from each of the Network
Functions (NFs), wherein the defined priority order comprises a top priority timestamp
followed by a plurality of subsequent lower priority timestamps. The defined priority order
5 comprises a top priority timestamp followed by a plurality of subsequent lower priority
timestamps, ensuring that network operations are handled in a systematic and efficient manner based on the timing of each request. For example, a network may receive multiple requests from different NFs such as a Session Management Function (SMF) and a Policy Control Function (PCF) that need to be processed in an order that respects the timing and priority of
10 each request to maintain network stability and service quality. The priority order is based on
the timestamps, with a top priority timestamp followed by lower priority timestamps wherein the one or more timestamps comprises an origination timestamp, a sender timestamp, and the local timestamp. Further, the pre-defined priority order comprises the origination timestamp, followed by the sender timestamp, and subsequently followed by the local timestamp. Further,
15 the priority order of the one or more timestamps is configurable by a user Indicates that the
priority order of timestamps can be customized or adjusted by the user according to specific requirements or preferences and derived by the at least one NF. The NFs are selected from a group consisting of: a Policy Control Function (PCF), a Binding Support Function (BSF), a Session Management Function (SMF), and a Network Exposure Function (NEF).
20
[0089] At step 410, based at least on the defined priority order of the one or more timestamps, performing, by an analysis unit [307], an overwrite operation, wherein the overwrite operation comprises processing the plurality of network requests in order of decreasing priority timestamps. For example, two requests are received simultaneously to modify the same user
25 session: one from a Session Management Function (SMF) and another from a Policy Control
Function (PCF). Each request carries its own set of timestamps, including origination and sender timestamps. Based on the priority rules defined by the determination unit [305], the analysis unit [307] would sequence these requests. If the origination timestamp from the SMF is given higher priority over the sender timestamp from the PCF, the request from the SMF
30 would be processed first. Further, plurality of network requests are processed based on the
origination timestamp, wherein the origination timestamp is utilized to perform the overwrite operation in an event when one or more network requests are received by the transceiver unit [301] in a short interval of time for the same Subscription Permanent Identifier (SUPI), Packet Data Network (PDN) Type, Data Network Name (DNN), or Packet Data Unit (PDU) Session
22

Identifier. When such requests arrive almost simultaneously, the analysis unit [307], following
the priority determinations from the determination unit [305], utilizes the origination timestamp
to decide which request should be processed first. The origination timestamp indicates the
moment at which each request was initially generated by its originating Network Function
5 (NF). The overwrite operation is the process of replacing or updating existing data or requests
with new information.
[0090] For example, when two requests concerning the same SUPI and DNN arrive at the system: one request originates from an SMF attempting to update session settings due to a
10 change in user data consumption, and another from a PCF looking to adjust policy settings for
the same session. Both requests could potentially alter the session state in conflicting ways. By prioritizing these requests based on their origination timestamps, the system ensures that the earliest request, presumably the one reflecting the initial change condition, is processed first, thus maintaining a logical and consistent session evolution.
15
[0091] Further, at step 412, the method terminates.
[0092] Referring to FIG. 5, an exemplary sequence diagram [500] for overwriting network
requests based on a priority of timestamps, in accordance with exemplary embodiments of the
20 present disclosure.
[0093] Here's a detailed description based on the outlined steps for FIG. 5, showing how the PCF manages requests from SMF1 and SMF2:
25 [0094] At step S1, SMF2 [108B] sends a network request (`Npcf_SMPolicyControl_Create`
for SUPI1) to the PCF [122]. The request includes a timestamp that marks the time it was sent from SMF2.
[0095] Next, at step S2, almost simultaneously, SMF1 [108A] sends another network request
30 (`Npcf_SMPolicyControl_Create` for SUPI1) to the PCF [122]. The request also includes a
timestamp, possibly very close to the one from SMF2.
23

[0096] Next at step S3, upon receiving these requests, the PCF [122] checks the timestamps as defined by the solution's rules to determine which request arrived first. The decision to accept or reject is based on which request is considered "late" according to the timestamps.
5 [0097] Next at step S4, after determining which request arrived first and thus has higher
priority, the PCF [122] responds to SMF2 [108B] with a `201 Created` status, indicating that the request has been accepted and processed.
[0098] Next at step S5, the PCF [122] then sends a `403 Late Overlapping Request` response
10 to SMF1 [108A]. The response indicates that SMF1's request was overlapping with another
request for the same SUPI but was considered less timely or relevant based on the established timestamp priority.
[0099] Next at step S6, SMF1 [108A] sends a new request (`Npcf_SMPolicyControl_Create`
15 for SUPI1) to the PCF [122], with updated information or a new timestamp that might qualify
it for reconsideration or processing.
[0100] Next at step S7, the PCF [122] again evaluates the new request from SMF1 [108A],
comparing the new timestamp with the existing session's timestamps. The PCF [122] decides
20 whether to maintain the current session or overwrite it with the new information, based on
which request is the latest and most relevant.
[0101] Next at step S8, should the new request from SMF1 [108A] meet the criteria and
determined to be more current, the PCF [122] responds with `201 Created`, indicating
25 acceptance and processing of the new, updated request.
[0102] Referring to FIG. 6, an exemplary sequence diagram [600] for overwriting network requests based on a priority of timestamps, in accordance with exemplary embodiments of the present disclosure. 30
[0103] At step P1, SMF2 [108B] sends a network request (Nbcf_SMPolicyControl_Create for SUPI1) to the BSF [602]. The request includes a timestamp that marks the time it was sent from SMF2.
24

[0104] Next, at step P2, almost simultaneously, SMF1 [108A] sends another network request (Nbcf_SMPolicyControl_Create for SUPI1) to the BSF [602]. The request also includes a timestamp, possibly very close to the one from SMF2.
5 [0105] Next at step P3, upon receiving these requests, the BSF [602] checks the timestamps
as defined by the solution's rules to determine which request arrived first. The decision to accept or reject is based on which request is considered "late" according to the timestamps.
[0106] Next at step P4, after determining which request arrived first and thus has higher
10 priority, the BSF [602] responds to SMF2 [108B] with a `201 Created` status, indicating that
the request has been accepted and processed.
[0107] Next at step P5, the BSF [602] then sends a `403 Late Overlapping Request` response
to SMF1 [108A]. The response indicates that SMF1's request was overlapping with another
15 request for the same SUPI but was considered less timely or relevant based on the established
timestamp priority.
[0108] Next at step P6, SMF1 [108A] sends a new request (`Npcf_SMPolicyControl_Create`
for SUPI1) to the BSF [602], with updated information or a new timestamp that might qualify
20 it for reconsideration or processing.
[0109] Next at step P7, the BSF [602] again evaluates the new request from SMF1 [108A],
comparing the new timestamp with the existing session's timestamps. The BSF [602] decides
whether to maintain the current session or overwrite it with the new information, based on
25 which request is the latest and most relevant.
[0110] Next at step P8, should the new request from SMF1 [108A] meet the criteria and determined to be more current, the BSF [602] responds with `201 Created`, indicating acceptance and processing of the new, updated request. 30
[0111] The present disclosure further discloses a non-transitory computer readable storage medium storing instruction for overwriting network requests based on a priority of timestamps, the instructions include executable code which, when executed by a one or more units of a system, causes: a receiving unit of the system to receive a transceiver unit of the system to
25

receive a network request from at least one Network Function (NF). Further, a generator unit
of the system to generate a local timestamp associated with the received network request.
Further, a determination unit of the system to define a priority order of the one or more
timestamps associated with each of the network request received from each of the Network
5 Functions (NFs), wherein the defined priority order comprises a top priority timestamp
followed by a plurality of subsequent lower priority timestamps. Further, based at least on the defined priority order of the one or more timestamps, the analysis unit of the system to perform an overwrite operation, wherein the overwrite operation comprises processing the plurality of network requests in order of decreasing priority timestamps.
10
[0112] As is evident from the above, the present disclosure provides a technically advanced solution for overwriting network requests based on a priority of timestamps. Also, the solution as disclosed in the present disclosure is an extension of the existing implementation but makes use of local timestamp, extends the use of “3gpp-Sbi-Origination-Timestamp” beyond intended
15 SMF to PCF and also provides order of priority for various timestamp options available at
system for case where multiple headers for timestamp may be received. Therefore, the solution as disclosed in the present disclosure overcomes the limitations of the existing solutions and provides technical advancements.
[0113] 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.
[0114] While considerable emphasis has been placed herein on the disclosed
30 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.
26

We Claim:
1. A method for overwriting network requests based on a priority of timestamps, the
5 method comprising:
- receiving, by a transceiver unit [301], a network request from at least one Network Function (NF);
- generating, by a generator unit [303], a local timestamp associated with the received network request;
10 - defining, by a determination unit [305], a priority order of the one or more
timestamps associated with said each of the network request received from each of the at least one NF, wherein the defined priority order comprises a top priority timestamp followed by a plurality of subsequent lower priority timestamps; and
- based at least on the defined priority order of the one or more timestamps,
15 performing, by an analysis unit [307], an overwrite operation, wherein the overwrite
operation comprises processing a plurality of network requests in order of decreasing priority timestamps.
2. The method as claimed in claim 1, wherein the received network request comprises at
20 least one of an origination timestamps and a sender timestamp.
3. The method as claimed in claim 1, wherein the local timestamp corresponds to a time
value recorded by clock at which the network request is received from the at least one
NF.
25
4. The method as claimed in claim 1, wherein the one or more timestamps comprises an
origination timestamp, a sender timestamp, and the local timestamp.
5. The method as claimed in claim 4, wherein a pre-defined priority order comprises the
30 origination timestamp, followed by the sender timestamp, and subsequently followed
by the local timestamp.

6. The method as claimed in claim 1, wherein the priority order of the one or more
timestamps is configurable by a user.
7. The method as claimed in claim 1, wherein the priority order of the one or more
5 timestamps is configured and derived by the at least one NF.

10

8. The method as claimed in claim 1, wherein the at least one NF is selected from a group
consisting of: a Policy Control Function (PCF) [122], a Binding Support Function (BSF) [602], a Session Management Function (SMF) [108], and a Network Exposure Function (NEF) [118].

15
20

9. The method as claimed in claim 2, wherein the origination timestamp associated with an SMF [108] indicates the timestamp at which the network request originates at the SMF [108].
10. The method as claimed in claim 1, wherein the plurality of network requests are processed based on the origination timestamp, wherein the origination timestamp is utilized to perform the overwrite operation in an event when one or more network requests are received by the transceiver unit [301] in a short interval of time for a Subscription Permanent Identifier (SUPI), Packet Data Network (PDN) Type, Data Network Name (DNN), or Packet Data Unit (PDU) Session Identifier.

11. A system for overwriting network requests based on a priority of timestamps, the
system comprising:
25 - a transceiver unit [301] configured to receive a network request from at least one
Network Function (NF);
- a generator unit [303] connected to at least the transceiver unit [301], wherein the
generator unit [303] configured to generate a local timestamp associated with the
received network request;
30 - a determination unit [305] connected to at least the generator unit [303], wherein the
determination unit [305] configured to define a priority order of the one or more timestamps associated with each of the network request received from each of the at least one NF, wherein the defined priority order comprises a top priority timestamp followed by a plurality of subsequent lower priority timestamps; and
28

- based at least on the defined priority order of the one or more timestamps, an analysis
unit [307] connected to at least the determination unit [305], wherein the analysis unit
[307] configured to perform an overwrite operation, wherein the overwrite operation
comprises processing a plurality of network requests in order of decreasing priority
5 timestamps.
12. The system as claimed in claim 11, wherein the received network request comprises at
least one of an origination timestamps and a sender timestamp.
10 13. The system as claimed in claim 11, wherein the local timestamp corresponds to a time
value recorded by clock at which the network request is received from the at least one NF.
14. The system as claimed in claim 11, wherein the one or more timestamps comprises an
15 origination timestamp, a sender timestamp, and the local timestamp.
15. The system as claimed in claim 14, wherein a pre-defined priority order comprises the
origination timestamp, followed by the sender timestamp, and subsequently followed
by the local timestamp.
20
16. The system as claimed in claim 11, wherein the priority order of the one or more
timestamps is configurable by a user.
17. The system as claimed in claim 11, wherein the priority order of the one or more
25 timestamps is configured and derived by the at least one NF.
18. The system as claimed in claim 11, wherein the at least one NF is selected from a group
consisting of: a Policy Control Function (PCF) [122], a Binding Support Function
(BSF) [602], a Session Management Function (SMF) [108], and a Network Exposure
30 Function (NEF) [118].

19. The system as claimed in claim 12, wherein the origination timestamp associated with
an SMF [108] indicates the timestamp at which the network request originates at the SMF [108].
5 20. The system as claimed in claim 11, wherein the plurality of network requests are
processed based on the origination timestamp, wherein the origination timestamp is
utilized to perform the overwrite operation in an event when one or more network
requests are received by the transceiver unit [301] in a short interval of time for a
Subscription Permanent Identifier (SUPI), Packet Data Network (PDN) Type, Data
10 Network Name (DNN), or Packet Data Unit (PDU) Session Identifier.