Sign In to Follow Application
View All Documents & Correspondence

Method And System For Reducing Request Failure Between Gmlc Node And Network Nodes

Abstract: The present disclosure relates to a method and a system for reducing request failure between a gateway mobile location centre (GMLC) node and one or more network nodes in a network. The method comprises checking, by testing unit [302] at network repository function (NRF) node [310], connection of GMLC node [304] with database(s) [306]. Further, the method comprises determining, by processing unit [308] at NRF node [310], the GMLC node [304] as one of: an available GMLC node, and an unavailable GMLC node. Further, the method comprises performing, by processing unit [308], a restriction procedure in an event the GMLC node [304] is determined as unavailable GMLC node. The restriction procedure comprises restricting, by processing unit [308], sending a ping-pong request to a service communication proxy (SCP) server [312] and a heartbeat request to the network repository function (NRF) node [310]. [FIG. 4]

Get Free WhatsApp Updates!
Notices, Deadlines & Correspondence

Patent Information

Application #
Filing Date
06 September 2023
Publication Number
1/2025
Publication Type
INA
Invention Field
COMMUNICATION
Status
Email
Parent Application

Applicants

Jio Platforms Limited
Office - 101, Saffron, Nr. Centre Point, Panchwati 5 Rasta, Ambawadi, Ahmedabad - 380006, Gujarat, India

Inventors

1. Aayush Bhatnagar
Reliance Corporate Park, Thane-Belapur Road, Ghansoli, Navi Mumbai, Maharashtra 400701, India
2. Vikash Agrawal
Reliance Corporate Park, Thane-Belapur Road, Ghansoli, Navi Mumbai, Maharashtra 400701, India
3. Omprakash Kushwah
Reliance Corporate Park, Thane-Belapur Road, Ghansoli, Navi Mumbai, Maharashtra 400701, India
4. Vikram Liman
Reliance Corporate Park, Thane-Belapur Road, Ghansoli, Navi Mumbai, Maharashtra 400701, India

Specification

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 REDUCING REQUEST FAILURE BETWEEN GMLC NODE AND NETWORK
NODES”
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 REDUCING REQUEST FAILURE BETWEEN GMLC NODE AND NETWORK NODES
FIELD OF INVENTION
[0001] Embodiments of the present disclosure generally relate to wireless communication systems. More particularly, embodiments of the present disclosure relate to reducing request failure between a gateway mobile location centre (GMLC) node and one or more network nodes in a network.
BACKGROUND OF THE DISCLOSURE
[0002] The following description of the related art is intended to provide background information pertaining to the field of the disclosure. This section may include certain aspects of the art that may be related to various features of the present disclosure. However, it should be appreciated that this section is used only to enhance the understanding of the reader with respect to the present disclosure, and not as admissions of the prior art.
[0003] Wireless communication technology has rapidly evolved over the past few decades, with each generation bringing significant improvements and advancements. The first generation of wireless communication technology was based on analog technology and offered only voice services. However, with the advent of the second generation (2G) technology, digital communication and data services became possible, and text messaging was introduced. The third generation (3G) technology marked the introduction of high-speed internet access, mobile video calling, and location-based services. The fourth generation (4G) technology revolutionized wireless communication with faster data speeds, better network coverage, and improved security. Currently, the fifth generation (5G) technology is being deployed, promising even faster data speeds, low latency, and the ability to connect multiple devices simultaneously. With each generation, wireless

communication technology has become more advanced, sophisticated, and capable of delivering more services to its users.
[0004] When an application hosted by a server in a communication network is up and running, it may register its information with a network repository function (NRF) node. Once this registration is successful, the server on which the application is hosted may start sending heartbeat request. This heartbeat request is to inform other nodes that the server is available for serving the consumer nodes, that is, to make the server discoverable by other nodes in the network. In other words, a heartbeat (or as used herein, heartbeat request) is a signal to periodically check the status of services and determine their availability and reachability. A gateway mobile location centre (GMLC) node may be a producer node for other nodes (or network functions (NFs)), for example, for access and mobility management function (AMF), unified data management (UDM) function, network exposure function (NEF), etc. Similarly, a ping pong (or as used herein, ping pong request) may also be initiated from the server to regularly make sure that a node is connected. A "ping pong request" generally refers to a communication pattern in which a request is sent, and a response is quickly sent back, often resulting in a back-and-forth exchange. In network protocols, it is a simple check to ensure a connection is active by sending a "ping" request and receiving a "pong" response.
[0005] There are several limitations associated with sending unsuccessful ping pong and heartbeats using NRF (Network Repository function) when the database node(s) are down/malfunctioning. In a situation where the database nodes recover after a period of downtime, there might be a delay in reporting the unsuccessful ping pong scores and heartbeats. This delay can affect real-time monitoring and response to issues, as operators may not be immediately aware of problems within the system. As a result, there may be delays in serving critical requests that may be made by a client, resources may be unnecessarily engaged in processing which can be avoided, which may ultimately result in bad user experience.

[0006] Thus, there exists an imperative need in the art to provide a solution for reducing request failure between a gateway mobile location centre (GMLC) node and one or more network nodes in a network, which the present disclosure aims to address.
SUMMARY OF THE DISCLOSURE
[0007] This section is provided to introduce certain aspects of the present disclosure in a simplified form that are further described below in the detailed description. This summary is not intended to identify the key features or the scope of the claimed subject matter.
[0008] An aspect of the present disclosure may relate to a method for reducing request failure between a gateway mobile location centre (GMLC) node and one or more network nodes in a network. The method comprises checking, by a testing unit at a network repository function (NRF) node, a connection of a GMLC node with one or more databases. Further, the method comprises determining, by a processing unit at the NRF node, the GMLC node as one of: an available GMLC node, and an unavailable GMLC node, wherein the GMLC node is determined as the available GMLC node in an event the connection of the GMLC node with the one or more databases is healthy, and the GMLC node is determined as the unavailable GMLC node in an event the connection of the GMLC node with the one or more databases is broken. Further, the method comprises performing, by the processing unit at the NRF node, a restriction procedure in an event the GMLC node is determined as the unavailable GMLC node. The restriction procedure comprises restricting, by the processing unit, sending a ping-pong request to a service communication proxy (SCP) server and a heartbeat request to the network repository function (NRF) node.
[0009] In an exemplary aspect of the present disclosure, the connection with the one or more databases is checked periodically at a pre-defined interval of time.

[0010] In an exemplary aspect of the present disclosure, the restriction procedure is performed automatically based on the periodic checking at the pre-defined interval of time.
[0011] In an exemplary aspect of the present disclosure, the pre-defined interval of time is in the range of 1 second and 60 seconds.
[0012] In an exemplary aspect of the present disclosure, the unavailable GMLC node is not discoverable by any node in the network.
[0013] Another aspect of the present disclosure may relate to a system for reducing request failure between a gateway mobile location centre (GMLC) node and one or more network nodes in a network. The system comprises a testing unit at a network repository function (NRF) node. The testing unit is configured to check a connection of a GMLC node with one or more databases. Further, the system comprises a processing unit at the NRF node. The processing unit is configured to determine the GMLC node as one of: an available GMLC node, and an unavailable GMLC node, wherein the GMLC node is determined as the available GMLC node in an event the connection of the GMLC node with the one or more databases is healthy, and the GMLC node is determined as the unavailable GMLC node in an event the connection of the GMLC node with the one or more databases is broken. Further, the processing unit is configured to perform a restriction procedure in an event the GMLC node is determined as the unavailable GMLC node. The restriction procedure comprises restricting, by the processing unit, sending a ping-pong request to a service communication proxy (SCP) server and a heartbeat request to the network repository function (NRF) node.
[0014] Yet another aspect of the present disclosure may relate to a non-transitory computer readable storage medium storing one or more instructions for reducing request failure between a gateway mobile location centre (GMLC) node and one or more network nodes in a network. The instructions include executable code which,

when executed by one or more units of a system, causes a testing unit at a network repository function (NRF) node to check a connection of a GMLC node with one or more databases. Further, the executable code, when executed, causes a processing unit at the NRF node to determine the GMLC node as one of: an available GMLC node, and an unavailable GMLC node. The GMLC node is determined as the available GMLC node in an event the connection of the GMLC node with the one or more databases is healthy, and the GMLC node is determined as the unavailable GMLC node in an event the connection of the GMLC node with the one or more databases is broken. Further, the executable code, when executed, causes the processing unit to perform a restriction procedure in an event the GMLC node is determined as the unavailable GMLC node. The restriction procedure comprises restricting, by the processing unit, sending a ping-pong request to a service communication proxy (SCP) server and a heartbeat request to the network repository function (NRF) node.
OBJECTS OF THE INVENTION
[0015] Some of the objects of the present disclosure, which at least one embodiment disclosed herein satisfies are listed herein below.
[0016] It is an object of the present disclosure to provide a solution for reducing request failure and communication failure between various microservices (that may be associated with a gateway mobile location centre with other network functions (NFs) or network nodes.
[0017] It is another object of the present disclosure to provide a system and a method that can periodically check connection with database node(s).
[0018] It is another object of the present disclosure to provide a system and a method that can facilitate in reducing delays in serving critical requests that may be made by a client.

[0019] It is another object of the present disclosure to provide a system and a method that can facilitate avoiding unnecessary use of processing resources.
DESCRIPTION OF THE DRAWINGS
5
[0020] The accompanying drawings, which are incorporated herein, and constitute a part of this disclosure, illustrate exemplary embodiments of the disclosed methods and systems in which like reference numerals refer to the same parts throughout the different drawings. Components in the drawings are not necessarily to scale,
10 emphasis instead being placed upon clearly illustrating the principles of the present
disclosure. Also, the embodiments shown in the figures are not to be construed as limiting the disclosure, but the possible variants of the method and system according to the disclosure are illustrated herein to highlight the advantages of the disclosure. It will be appreciated by those skilled in the art that disclosure of such
15 drawings includes disclosure of electrical components or circuitry commonly used
to implement such components.
[0021] FIG. 1 illustrates an exemplary block diagram representation of 5th
generation core (5GC) network architecture.
20
[0022] FIG. 2 illustrates an exemplary block diagram of a computing device upon
which the features of the present disclosure may be implemented in accordance with
exemplary implementation of the present disclosure.
25 [0023] FIG. 3 illustrates an exemplary block diagram of a system for reducing
request failure between a gateway mobile location centre (GMLC) node and one or more network nodes in a network, in accordance with exemplary implementations of the present disclosure.
30 [0024] FIG. 4 illustrates a method flow diagram for reducing request failure
between a gateway mobile location centre (GMLC) node and one or more network
7

nodes in a network, in accordance with exemplary implementations of the present disclosure.
[0025] The foregoing shall be more apparent from the following more detailed
5 description of the disclosure.
DETAILED DESCRIPTION
[0026] In the following description, for the purposes of explanation, various
10 specific details 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 may not
15 address any of the problems discussed above or might address only some of the
problems discussed above.
[0027] The ensuing description provides exemplary embodiments only, and is not intended to limit the scope, applicability, or configuration of the disclosure. Rather,
20 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.
25
[0028] Specific details are given in the following description to provide a thorough understanding of the embodiments. However, it will be understood by one of ordinary skill in the art that the embodiments may be practiced without these specific details. For example, circuits, systems, processes, and other components
30 may be shown as components in block diagram form in order not to obscure the
embodiments in unnecessary detail.
8

[0029] Also, it is noted that individual embodiments may be described as a process
which is depicted as a flowchart, a flow diagram, a data flow diagram, a structure
diagram, or a block diagram. Although a flowchart may describe the operations as
5 a sequential process, many of the operations may be performed in parallel or
concurrently. In addition, the order of the operations may be re-arranged. A process is terminated when its operations are completed but could have additional steps not included in a figure.
10 [0030] The word “exemplary” and/or “demonstrative” is used herein to mean
serving as an example, instance, or illustration. For the avoidance of doubt, the subject matter disclosed herein is not limited by such examples. In addition, any aspect or design described herein as “exemplary” and/or “demonstrative” is not necessarily to be construed as preferred or advantageous over other aspects or
15 designs, nor is it meant to preclude equivalent exemplary structures and techniques
known to those of ordinary skill in the art. Furthermore, to the extent that the terms “includes,” “has,” “contains,” and other similar words are used in either the detailed description or the claims, such terms are intended to be inclusive—in a manner similar to the term “comprising” as an open transition word—without precluding
20 any additional or other elements.
[0031] As used herein, a “processing unit” or “processor” or “operating processor” includes one or more processors, wherein processor refers to any logic circuitry for processing instructions. A processor may be a general-purpose processor, a special
25 purpose processor, a conventional processor, a digital signal processor, a plurality
of microprocessors, one or more microprocessors in association with a (Digital Signal Processing) DSP core, a controller, a microcontroller, Application Specific Integrated Circuits, Field Programmable Gate Array circuits, any other type of integrated circuits, etc. The processor may perform signal coding data processing,
30 input/output processing, and/or any other functionality that enables the working of
the system according to the present disclosure. More specifically, the processor or processing unit is a hardware processor.
9

[0032] As used herein, “a user equipment”, “a user device”, “a smart-user-device”,
“a smart-device”, “an electronic device”, “a mobile device”, “a handheld device”,
“a wireless communication device”, “a mobile communication device”, “a
5 communication device” may be any electrical, electronic and/or computing device
or equipment, capable of implementing the features of the present disclosure. The
user equipment/device may include, but is not limited to, a mobile phone, smart
phone, laptop, a general-purpose computer, desktop, personal digital assistant,
tablet computer, wearable device or any other computing device which is capable
10 of implementing the features of the present disclosure. Also, the user device may
contain at least one input means configured to receive an input from unit(s) which are required to implement the features of the present disclosure.
[0033] As used herein, “storage unit” or “memory unit” refers to a machine or
15 computer-readable medium including any mechanism for storing information in a
form readable by a computer or similar machine. For example, a computer-readable
medium includes read-only memory (“ROM”), random access memory (“RAM”),
magnetic disk storage media, optical storage media, flash memory devices or other
types of machine-accessible storage media. The storage unit stores at least the data
20 that may be required by one or more units of the system to perform their respective
functions.
[0034] As used herein “interface” or “user interface refers to a shared boundary
across which two or more separate components of a system exchange information
25 or data. The interface may also be referred to a set of rules or protocols that define
communication or interaction of one or more modules or one or more units with each other, which also includes the methods, functions, or procedures that may be called.
30 [0035] 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,
10

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.
5
[0036] As used herein the transceiver unit include at least one receiver and at least
one transmitter configured respectively for receiving and transmitting data, signals,
information or a combination thereof between units/components within the system
and/or connected with the system.
10
[0037] As used herein, the Gateway Mobile Location Centre (GMLC) or the
GMLC node contains functionality required to support location services (LCS). In
one Public Land Mobile Network (PLMN), there may be more than one GMLC. A
GMLC is the first node an external LCS client accesses in a PLMN (i.e. the Le
15 reference point is supported by the GMLC). AFs and NFs may access GMLC
directly or via network exposure function (NEF). The GMLC may request routing information and/or target UE privacy information from the UDM via the Nudm interface (which enables communication between the UDM function and other network functions or applications, and allows for the management and retrieval of
20 subscriber data, such as user profiles, authentication, and authorization information,
essential for providing network services). After performing authorization of an external LCS Client or AF and verifying target UE privacy, a GMLC forwards a location request to either a serving AMF using Namf interface (which facilitates communication between the AMF and other network functions or components, and
25 handles tasks related to managing and controlling access to the network, including
handling network slice assignments, access requests, and session management) or to a GMLC in another PLMN using the Ngmlc interface (which handles the exchange of location-related information, such as tracking and reporting user location data, which is crucial for location-based services and applications) in the
30 case of a roaming UE.
11

[0038] 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
5 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
10 of the present disclosure.
[0039] As discussed in the background section, the current known solutions have several shortcomings. The present disclosure aims to overcome the above-mentioned and other existing problems in this field of technology by providing
15 method and system of reducing request failure between a gateway mobile location
centre (GMLC) node and one or more network nodes in a network. For this purpose, the system is configured to perform periodic checking of connection of a GMLC node with one or more databases. In case the database connection with the GMLC is broken, the network repository function node may mark or determine the GMLC
20 as unavailable to serve any request sent by the network nodes in the network to
which the GMLC is connected. In this scenario, the heartbeat request and/or the ping pong request is restricted (that is, not transmitted) for finding/discovering that GMLC node.
25 [0040] Hereinafter, exemplary embodiments of the present disclosure will be
described with reference to the accompanying drawings.
[0041] FIG. 1 illustrates an exemplary block diagram representation of 5th
generation core (5GC) network architecture, in accordance with exemplary
30 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
12

Management Function (SMF) [108], a Service Communication Proxy (SCP) [110],
an Authentication Server Function (AUSF) [112], a Network Slice Specific
Authentication and Authorization Function (NSSAAF) [114], a Network Slice
Selection Function (NSSF) [116], a Network Exposure Function (NEF) [118], a
5 Network Repository Function (NRF) [120], a Policy Control Function (PCF) [122],
a Unified Data Management (UDM) [124], an application function (AF) [126], a
User Plane Function (UPF) [128], a data network (DN) [130], wherein all the
components are assumed to be connected to each other in a manner as obvious to
the person skilled in the art for implementing features of the present disclosure.
10
[0042] Radio Access Network (RAN) [104] is the part of a mobile
telecommunications system that connects user equipment (UE) [102] to the core
network (CN) and provides access to different types of networks (e.g., 5G network).
It consists of radio base stations and the radio access technologies that enable
15 wireless communication.
[0043] Access and Mobility Management Function (AMF) [106] is a 5G core
network function responsible for managing access and mobility aspects, such as UE
registration, connection, and reachability. It also handles mobility management
20 procedures like handovers and paging.
[0044] Session Management Function (SMF) [108] is a 5G core network function
responsible for managing session-related aspects, such as establishing, modifying,
and releasing sessions. It coordinates with the User Plane Function (UPF) for data
25 forwarding and handles IP address allocation and QoS enforcement.
[0045] 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-
30 based interfaces.
13

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

[0054] User Plane Function (UPF) [128] is a network function responsible for handling user data traffic, including packet routing, forwarding, and QoS enforcement.
5 [0055] 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.
[0056] Gateway Mobile Location Centre (GMLC) [132] refers to a network
10 component that provides location-based services (LCS) by interfacing with various
network elements. The GMLC contains functionality required to support LCS. In
one PLMN, there may be more than one GMLC. A GMLC is the first node an
external LCS client accesses in a PLMN (i.e. the Le reference point is supported by
the GMLC). AFs and NFs may access GMLC directly or via NEF. The GMLC may
15 request routing information and/or target UE privacy information from the UDM
via the Nudm interface. After performing authorization of an external LCS Client
or AF and verifying target UE privacy, a GMLC forwards a location request to
either a serving AMF using Namf interface or to a GMLC in another PLMN using
the Ngmlc interface in the case of a roaming UE.
20
[0057] 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 also implement a method for
25 reducing request failure between a gateway mobile location centre (GMLC) node
and one or more network nodes in a network utilising the system. In another implementation, the computing device [200] itself implements the method for reducing request failure between a gateway mobile location centre (GMLC) node and one or more network nodes in a network, using one or more units configured
30 within the computing device [200], wherein said one or more units are capable of
implementing the features as disclosed in the present disclosure.
15

[0058] The computing device [200] may include a bus [202] or other
communication mechanism for communicating information, and a hardware
processor [204] coupled with bus [202] for processing information. The hardware
processor [204] may be, for example, a general purpose microprocessor. The
5 computing device [200] may also include a main memory [206], such as a random
access memory (RAM), or other dynamic storage device, coupled to the bus [202] 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
10 processor [204]. Such 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
15 information and instructions for the processor [204].
[0059] 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.
16

[0060] 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 [0061] 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.
[0062] 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 ISP [226], the local network [222], a host [224], and the communication interface
17

[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 [0063] Referring to FIG. 3, an exemplary block diagram of a system [300] for
reducing request failure between a gateway mobile location centre (GMLC) node and one or more network nodes in a network, is shown, in accordance with the exemplary implementations of the present disclosure. The system [300] comprises at least one testing unit [302], at least one GMLC node [304], at least one database
10 [306] (or as used herein, one or more databases [306]), at least one processing unit
[308], at least one network repository function (NRF) node [310] and at least one service communication proxy (SCP) server [312]. 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 shown within the system should
15 also be assumed to be connected to each other. Also, in Fig. 3 only a few units are
shown, however, the system [300] may comprise multiple such units or the system [300] may comprise any such numbers of said units, as required to implement the features of the present disclosure. Further, in an implementation, the system [300] may be independent of but in communication with the user device (may also
20 referred herein as a UE). In another implementation, the system [300] may reside
in a server or a network entity.
[0064] The system [300] is configured for reducing request failure between the
gateway mobile location centre (GMLC) node [304] and one or more network
25 nodes in a network, with the help of the interconnection between the
components/units of the system [300].
[0065] As noted above in this disclosure, when an application hosted by a server in
a communication network is up and running, it may register its information with
30 the network repository function (NRF) node [310]. Once this registration is
successful, the server on which the application is hosted may start sending heartbeat request and/or ping pong request. Also, the GMLC node [304] may be a producer
18

node for other nodes (or network functions (NFs)), for example, for an access and
mobility management function (AMF), a unified data management (UDM)
function, a network exposure function (NEF), etc. In an implementation, the
heartbeat request and/or ping pong request may be sent by a node to the NRF node
5 [310] directly. In another implementation, the heartbeat request and/or ping pong
request may be sent to the SCP server [312] when the SCP server [312] is present in the server, and the NRF node [310] may receive the heartbeat request and/or ping pong request via the SCP server [312].
10 [0066] The testing unit [302] may be located at the network repository function
(NRF) node [310], or the testing unit [302] may be associated with the NRF node [310]. Pertinently, the phrase ‘testing unit [302] at the NRF [310]’ should be construed as the testing unit [302] being present at the NRF [310] or being associated with the NRF [310]. The testing unit [302] is configured to check a
15 connection of the GMLC node [304] with the one or more databases [306]. If the
one or more databases [306] associated with the GMLC node [304] are down, then other nodes may not know that the GMLC node [304] will not be able to serve the request. To ensure that no other nodes send the request to find the GMLC node [304], it is needed to determine that the databases associated with the GMLC node
20 [304] are not functioning properly and are disconnected with the GMLC [304]. This
will reduce the failure rate of serving the requests, meaning that the rate of receiving the requests by the GMLC node [304] and not being able to serve those requests. In an implementation, the connection of the GMLC node [304] with the one or more databases [306] is checked periodically at a pre-defined interval of time. Also, in
25 an implementation, this pre-defined interval of time lies in the range of 1 second
and 60 seconds.
[0067] For example, if two nodes want to communicate with each other, they may
need profile of each other to communicate. The profile comprises information of
30 NF such as services provided by the NF, the IP address of the NF. For example, a
network node, say an AMF node wants to communicate with the GMLC node [304], then the AMF node sends discovery request to the NRF node [310]. This discovery
19

request is associated with the GMLC node [304] information to find/discover the GMLC node [304]. Once the AMF node receives the profile of the GMLC node [304], then the AMF node communicates with the GMLC node [304].
5 [0068] Further, the processing unit [308] may be located at the NRF node [310], or
the processing unit [308] may be associated with the NRF node [310]. Pertinently, the phrase ‘processing unit [308] at the NRF [310]’ should be construed as the processing unit [308] being present at the NRF [310] or being associated with the NRF [310]. The processing unit [308] is configured to determine the GMLC node
10 [304] as one of: an available GMLC node, and an unavailable GMLC node, wherein
the GMLC node [304] is determined as the available GMLC node in an event the connection of the GMLC node [304] with the one or more databases [306] (or as used herein, the atleast one database [306]) is healthy, and the GMLC node [304] is determined as the unavailable GMLC node in an event the connection of the
15 GMLC node [304] with the one or more databases [306] is broken. This means that
in case the connection of the database, i.e., the one or more databases [306], connected to the GMLC node [304] is not broken, meaning that the one or more databases [306] and the GMLC node [304] are able to communicate with each other, then the GMLC node [304] is determined as an available node (here, a healthy
20 connection between 2 entities means that the 2 entities are connected to each other
in a way that they are able to communicate with each other). This determination may be made by the processing unit [308]. Once this determination of healthy connection is made, in an implementation, the NRF node [310] marks the GMLC node [304] as ‘available’ and allows the heartbeat request to be communicated to
25 the NRF node [310] and/or ping pong request to be communicated to the SCP server
[312]. On the other hand, once the determination of broken connection is made, in an implementation, the NRF node [310] marks the GMLC node as ‘unavailable’ so as to further restrict the heartbeat request to be communicated to the NRF node [310] and/or ping pong request to be communicated to the SCP server [312] (here,
30 a broken connection between 2 entities means that the 2 entities are either
20

disconnected, or connected to each other in a way that they are not able to communicate with each other).
[0069] Further, the processing unit [308] is configured to perform a restriction
5 procedure in an event the GMLC node [304] is determined as the unavailable
GMLC node. The restriction procedure comprises restricting, by the processing unit [308], sending a ping-pong request to the service communication proxy (SCP) server [312] and the heartbeat request to the network repository function (NRF) node [310]. Pertinently, the heartbeat request is a 3GPP based request that is sent
10 to inform the NRF node [310] that the GMLC node [304] is up and running. Also,
a transmission control protocol (TCP) based connection is maintained between the SCP server [312] and the NRF node [310]. Further, the TCP connection may also be maintained between the GMLC node [304] and the NRF node [310], and/or the GMLC node [304] and the SCP server [312]. The ping pong request is the TCP
15 based request that is sent to check whether the connection between the GMLC node
[304] and the NRF node [310], and/or the GMLC node [304] and the SCP server [312] is healthy or broken. In an implementation, the restriction procedure is performed automatically based on the periodic checking at the pre-defined interval of time. As a result of this restriction procedure, the unavailable GMLC node is not
20 discoverable by any other node in the network. In an example where a network node
wants to communicate with the GMLC node [304], but the GMLC node [304] is unable to serve any request by any server due to broken connection with its associated database(s), the network node may try to communicate with the GMLC node [304]. However, due to poor connection with the database(s), the request from
25 the network node is not served, and/or may be retried for a number of times. Finally,
the network node receives the error message informing broken connection of the GMLC node [304] with its database, and/or being unable to serve the request. Further, the network node may approach another GMLC node in the network to serve the request. Thus, a lot of time and resources may be wasted in the above
30 procedure in an event the GMLC node [304] is not marked/determined unavailable
by the NRF node [310]. When the NRF node [310] has already marked the GMLC
21

node [304] as unavailable, the heartbeat request and/or the ping pong request is already restricted and the network node, in that case, communicates the request to a GMLC node that is able to serve the requests.
5 [0070] Referring to FIG. 4, an exemplary method flow diagram [400] for reducing
request failure between a gateway mobile location centre (GMLC) node and one or
more network nodes in a network, in accordance with exemplary implementations
of the present disclosure is shown. In an implementation the method [400] is
performed by the system [300]. Also, as shown in Figure 4, the method [400] starts
10 at step [402].
[0071] At step 404, the method of the present disclosure comprises checking, by a testing unit [302] at a network repository function (NRF) node [310], a connection of a GMLC node [304] with one or more databases [306]. If the one or more
15 databases [306] associated with the GMLC node [304] are down, then other nodes
may not know that the GMLC node [304] will not be able to serve the request. To ensure that no other nodes send the request to find the GMLC node [304], it is needed to determine that the databases associated with the GMLC node [304] are not functioning properly and are disconnected with the GMLC [304]. This will
20 reduce the failure rate of serving the requests, meaning that the rate of receiving the
requests by the GMLC node [304] and not being able to serve those requests. In an implementation, the connection of the GMLC node [304] with the one or more databases [306] is checked periodically at a pre-defined interval of time. Also, in an implementation, this pre-defined interval of time lies in the range of 1 second
25 and 60 seconds.
[0072] For example, if two nodes want to communicate with each other, they may
need profile of each other to communicate. The profile comprises information of a
NF such as services provided by the NF, the IP address of the NF. For example, a
30 network node, say an AMF node wants to communicate with the GMLC node [304],
then the AMF node sends discovery request to the NRF node [310]. This discovery request is associated with the GMLC node [304] information to find/discover the
22

GMLC node [304]. Once the AMF node receives the profile of the GMLC node [304], then the AMF node communicates with the GMLC node [304].
[0073] Further, at step 406, the method of the present disclosure comprises
5 determining, by a processing unit [308] at the NRF node [310], the GMLC node
[304] as one of: an available GMLC node, and an unavailable GMLC node, wherein the GMLC node [304] is determined as the available GMLC node in an event the connection of the GMLC node [304] with the one or more databases [306] is healthy, and the GMLC node [304] is determined as the unavailable GMLC node
10 in an event the connection of the GMLC node [304] with the one or more databases
[306] is broken. This means that in case the connection of the database, i.e., the one or more databases [306], connected to the GMLC node [304] is not broken, meaning that the one or more databases [306] and the GMLC node [304] are able to communicate with each other, then the GMLC node [304] is determined as an
15 available node. This determination may be made by the processing unit [308]. Once
this determination of healthy connection is made, in an implementation, the NRF node [310] marks the GMLC node [304] as ‘available’ and allows the heartbeat request to be communicated to the NRF node [310] and/or the ping pong request to be communicated to the SCP server [312]. On the other hand, once the
20 determination of broken connection is made, in an implementation, the NRF node
[310] marks the GMLC node [304] as ‘unavailable’ so as to further restrict the heartbeat request to be communicated to the NRF node [310] and/or ping pong request to be communicated to the SCP server [312].
25 [0074] Further, at step 408, the method of the present disclosure comprises
performing, by the processing unit [308] at the NRF node [310], a restriction procedure in an event the GMLC node [304] is determined as the unavailable GMLC node. The restriction procedure comprises restricting, by the processing unit [308], sending the ping-pong request to the service communication proxy (SCP)
30 server [312] and the heartbeat request to the network repository function (NRF)
node [310]. Pertinently, the heartbeat request is a 3GPP based request that is sent
23

to inform the NRF node [310] that GMLC node [304] is up and running. Also, a
transmission control protocol (TCP) based connection is maintained between the
SCP server [312] and the NRF node [310]. Further, the TCP connection may also
be maintained between the GMLC node [304] and the NRF node [310], and/or the
5 GMLC node [304] and the SCP server [312]. The ping pong request is the TCP
based request that is sent to check whether the connection between the GMLC node
[304] and the NRF node [310], and/or the GMLC node [304] and the SCP server
[312] is healthy or broken. In an implementation, the restriction procedure is
performed automatically based on the periodic checking at the pre-defined interval
10 of time. As a result of this restriction procedure, the unavailable GMLC node is not
discoverable by any other node in the network.
[0075] In an implementation, the method provides for reducing request failure between the gateway mobile location centre (GMLC) node [304] and one or more
15 network nodes in a network. The Gateway Mobile Location Centre (GMLC)
contains functionality required to support LCS. In one PLMN, there may be more than one GMLC. The GMLC is the first node an external LCS client accesses in the PLMN (i.e. the Le reference point is supported by the GMLC). AFs and NFs may access the GMLC directly or via NEF. The GMLC may request routing information
20 and/or target UE privacy information from the UDM via the Nudm interface. After
performing authorization of an external LCS Client or AF and verifying target UE privacy, the GMLC forwards a location request to either a serving AMF using Namf interface or to a GMLC in another PLMN using the Ngmlc interface in the case of a roaming UE. More than one GMLC in the HPLMN can serve the location requests
25 for a single UE. The GMLC discovery and selection functionality is supported by
AMF, LMF, NEF, LCS client and GMLC. The request may pertain to finding a GMLC for providing service to a network node in the network, for example, for finding location of a client. The LCS client may be configured with GMLC address(es). It may also determine the GMLC address by performing a DNS query.
30 A NEF, LMF, AMF or GMLC may be configured with GMLC address(es). Those
NF may also query the NRF to get GMLC address(es). An LCS client or AF may
24

or may not be authorised to retrieve the UE location, e.g. for commercial use. UE
LCS privacy is a feature which allows a UE and/or AF to control which LCS clients
and AFs are and are not allowed access to UE location information. UE LCS
privacy can be supported via subscription and via UE LCS privacy profile handling.
5 With subscription, privacy preferences for a UE are stored in a UE LCS privacy
profile as part of UE subscription data in the UDM and queried from the UDM by another NF such as GMLC or NEF. The location service provided by the GMLC enables an NF to request location determination for a target UE or to request relative locations, distance, or direction between UEs. Further, the location service of the
10 GMLC allows the consumer NF to request the current geodetic and optionally local
and/or civic location of a target UE, allows the consumer NF to subscribe/unsubscribe the geodetic and optionally local and/or civic location of a target UE for some certain events, allows the consumer NF to cancel an on-going periodic or triggered location request of a target UE, allows the consumer NF to get
15 notified about the geodetic and optionally local and/or civic location of a target UE
when some certain events are detected, and allows the consumer NF to request the relative locations, distance, or direction between UEs. The method comprises checking, by a testing unit [302] at a network repository function (NRF) node [310], a connection of a GMLC node [304] with one or more databases [306]. In an
20 implementation, the connection with the one or more databases [306] is checked
periodically at a pre-defined interval of time, which can range from 1 second to 60 seconds. Further, the method comprises determining, by a processing unit [308] at the NRF node [310], the GMLC node [304] as one of: an available GMLC node, and an unavailable GMLC node, wherein the GMLC node [304] is determined as
25 the available GMLC node in an event the connection of the GMLC node [304] with
the one or more databases [306] is healthy, and the GMLC node [304] is determined as the unavailable GMLC node in an event the connection of the GMLC node [304] with the one or more databases [306] is broken. If the GMLC node [304] is connected to the associated databases [306], that is, the GMLC node [304] is able
30 to communicate and exchange information with the databases [306], then it is
possible for the GMCL node [304] to provide location information, and/or serve the
25

request of the client. For example, a client requests the NRF node [310] to find a GMLC node [304] to serve the request of the client, but the GMLC node [304] has broken connection with the databases [306] and therefore cannot serve the request. In an example, The LMF selection functionality may also be supported by the GMLC and the GMLC provides the selected LMF ID to AMF. LMF reselection is a functionality supported by AMF when necessary, e.g. due to UE mobility. The LMF selection/reselection may be performed at the AMF or LMF or GMLC based on the locally available information i.e. LMF profiles are configured locally at AMF or LMF or GMLC, or by querying NRF. Then in a scenario, the client after sending the request will keep waiting for the GMLC node [304] to respond at least for a threshold period of time, and also the client may keep sending request for the same GMLC node [304] for a threshold number of times and will keep waiting for some time with each request made. In critical situations, this extra time can lead to unwanted results. Thus, it is important to save time under these critical circumstances at least, and is also favourable for better user experience in other circumstances. For this purpose, it is important to determine GMLC node [304] as available or unavailable so that the request is not made redundantly. Further, the method comprises performing, by the processing unit [308], a restriction procedure in an event the GMLC node [304] is determined as the unavailable GMLC node. The restriction procedure comprises restricting, by the processing unit [308], atleast one of: sending a ping-pong request to a service communication proxy (SCP) server [312] and a heartbeat request to the network repository function (NRF) node [310]. Also, in an implementation, the restriction procedure is performed automatically based on the periodic checking at the pre-defined interval of time, that is, in case the pre-defined interval of time is over and the GMLC node [304] indicates no connection, then the restriction procedure is automatically performed after this pre¬defined interval of time, as a result of which, the unavailable GMLC node is not discoverable by any node in the network.
[0076] The present disclosure further discloses a non-transitory computer readable storage medium storing one or more instructions for reducing request failure

between a gateway mobile location centre (GMLC) node and one or more network nodes in a network. The instructions include executable code which, when executed by one or more units of a system, causes: a testing unit [302] at a network repository function (NRF) node [310] to check a connection of a GMLC node [304] with one or more databases [306]. Further, the executable code, when executed, causes a processing unit [308] at the NRF node [310] to determine the GMLC node [304] as one of: an available GMLC node, and an unavailable GMLC node. The GMLC node [304] is determined as the available GMLC node in an event the connection of the GMLC node [304] with the one or more databases [306] is healthy, and the GMLC node [304] is determined as the unavailable GMLC node in an event the connection of the GMLC node with the one or more databases [306] is broken. Further, the executable code, when executed, causes the processing unit [308] to perform a restriction procedure in an event the GMLC node [304] is determined as the unavailable GMLC node. The restriction procedure comprises restricting, by the processing unit [308], sending a ping-pong request to a service communication proxy (SCP) server [312] and a heartbeat request to the network repository function (NRF) node. In an example where a network node wants to communicate with the GMLC node [304], but the GMLC node [304] is unable to serve any request by any server due to broken connection with its associated database(s), the network node may try to communicate with the GMLC node [304]. However, due to poor connection with the database(s), the request from the network node is not served, and/or may be retried for a number of times. Finally, the network node receives the error message informing broken connection of the GMLC node [304] with its database, and/or being unable to serve the request. Further, the network node may approach another GMLC node in the network to serve the request. Thus, a lot of time and resources may be wasted in the above procedure in an event the GMLC node [304] is not marked/determined unavailable by the NRF node [310]. When the NRF node [310] has already marked the GMLC node [304] as unavailable, the heartbeat request and/or the ping pong request is already restricted and the network node, in that case, communicates the request to the GMLC node [304] that is able to serve the requests.

[0077] As is evident from the above, the present disclosure provides a technically advanced solution for reducing request failure between a gateway mobile location centre (GMLC) node and one or more network nodes in a network. The present solution enables periodic checking of connection with database node(s). Further, the present solution facilitates in reducing delays in serving critical requests that may be made by a client. Further, the present solution facilitates in avoiding unnecessary use of processing resources.
[0078] 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 reducing request failure between a gateway mobile location
centre (GMLC) node and one or more network nodes in a network, the
method comprising:
- checking, by a testing unit [302] at a network repository function (NRF) node [310], a connection of a GMLC node [304] with one or more databases [306];
- determining, by a processing unit [308] at the NRF node [310], the GMLC node [304] as one of: an available GMLC node, and an unavailable GMLC node, wherein the GMLC node [304] is determined as the available GMLC node in an event the connection of the GMLC node [304] with the one or more databases [306] is healthy, and the GMLC node [304] is determined as the unavailable GMLC node in an event the connection of the GMLC node [304] with the one or more databases [306] is broken; and
- performing, by the processing unit [308], a restriction procedure in an event the GMLC node [304] is determined as the unavailable GMLC node,
wherein the restriction procedure comprises:
o restricting, by the processing unit [308], atleast one of: sending a ping-pong request to a service communication proxy (SCP) server [312] and a heartbeat request to the network repository function (NRF) node [310].
2. The method as claimed in claim 1, wherein the connection with the one or more databases [306] is checked periodically at a pre-defined interval of time.
3. The method as claimed in claim 2, wherein the restriction procedure is performed automatically based on the periodic checking at the pre-defined interval of time.

4. The method as claimed in claim 2, wherein the pre-defined interval of time is in a range of 1 second and 60 seconds.
5. The method as claimed in claim 1, wherein the unavailable GMLC node is not discoverable by any network node in the network.
6. A system for reducing request failure between a gateway mobile location centre (GMLC) node and one or more network nodes in a network, the system comprising:
- a testing unit [302] at a network repository function (NRF) node [310],
the testing unit [302] configured to:
o check a connection of a GMLC node [304] with one or more databases [306]; and
- a processing unit [308] at the NRF node [310], the processing unit
[308] configured to:
o determine the GMLC node [304] as one of: an available GMLC node, and an unavailable GMLC node, wherein the GMLC node [304] is determined as the available GMLC node in an event the connection of the GMLC node [304] with the one or more databases [306] is healthy, and the GMLC node [304] is determined as the unavailable GMLC node in an event the connection of the GMLC node [304] with the one or more databases [306] is broken; and
o perform a restriction procedure in an event the GMLC node [304] is determined as the unavailable GMLC node,
wherein the restriction procedure comprises:
o restricting, by the processing unit [308], atleast one of: sending a ping-pong request to a service communication proxy (SCP) server [312] and a heartbeat request to the network repository function (NRF) node [310].

7. The system as claimed in claim 6, wherein the connection with the one or more databases [306] is checked periodically at a pre-defined interval of time.
8. The system as claimed in claim 7, wherein the restriction procedure is performed automatically based on the periodic checking at the pre-defined interval of time.
9. The system as claimed in claim 7, wherein the pre-defined interval of time is in a range of 1 second and 60 seconds.
10. The system as claimed in claim 6, wherein the unavailable GMLC node is not discoverable by any network node in the network.

Documents

Application Documents

# Name Date
1 202321060045-STATEMENT OF UNDERTAKING (FORM 3) [06-09-2023(online)].pdf 2023-09-06
2 202321060045-PROVISIONAL SPECIFICATION [06-09-2023(online)].pdf 2023-09-06
3 202321060045-POWER OF AUTHORITY [06-09-2023(online)].pdf 2023-09-06
4 202321060045-FORM 1 [06-09-2023(online)].pdf 2023-09-06
5 202321060045-FIGURE OF ABSTRACT [06-09-2023(online)].pdf 2023-09-06
6 202321060045-DRAWINGS [06-09-2023(online)].pdf 2023-09-06
7 202321060045-Proof of Right [11-01-2024(online)].pdf 2024-01-11
8 202321060045-ORIGINAL UR 6(1A) FORM 1 & 26-050424.pdf 2024-04-15
9 202321060045-FORM-5 [04-09-2024(online)].pdf 2024-09-04
10 202321060045-ENDORSEMENT BY INVENTORS [04-09-2024(online)].pdf 2024-09-04
11 202321060045-DRAWING [04-09-2024(online)].pdf 2024-09-04
12 202321060045-CORRESPONDENCE-OTHERS [04-09-2024(online)].pdf 2024-09-04
13 202321060045-COMPLETE SPECIFICATION [04-09-2024(online)].pdf 2024-09-04
14 202321060045-Request Letter-Correspondence [09-09-2024(online)].pdf 2024-09-09
15 202321060045-Power of Attorney [09-09-2024(online)].pdf 2024-09-09
16 202321060045-Form 1 (Submitted on date of filing) [09-09-2024(online)].pdf 2024-09-09
17 202321060045-Covering Letter [09-09-2024(online)].pdf 2024-09-09
18 202321060045-CERTIFIED COPIES TRANSMISSION TO IB [09-09-2024(online)].pdf 2024-09-09
19 Abstract 1.jpg 2024-09-27
20 202321060045-FORM 3 [08-10-2024(online)].pdf 2024-10-08
21 202321060045-FORM-9 [31-12-2024(online)].pdf 2024-12-31
22 202321060045-FORM 18A [01-01-2025(online)].pdf 2025-01-01
23 202321060045-FER.pdf 2025-01-22
24 202321060045-FER_SER_REPLY [21-02-2025(online)].pdf 2025-02-21
25 202321060045-SER.pdf 2025-05-21
26 202321060045-FER_SER_REPLY [23-06-2025(online)].pdf 2025-06-23
27 202321060045-US(14)-HearingNotice-(HearingDate-14-08-2025).pdf 2025-07-09
28 202321060045-FORM-26 [06-08-2025(online)].pdf 2025-08-06
29 202321060045-Correspondence to notify the Controller [06-08-2025(online)].pdf 2025-08-06
30 202321060045-Written submissions and relevant documents [26-08-2025(online)].pdf 2025-08-26

Search Strategy

1 202321060045_SearchStrategyAmended_E_202321060045AE_08-05-2025.pdf
2 202321060045E_14-01-2025.pdf