The subject matter described herein relates to methods and systems for selecting network functions in a telecommunications network. More particularly, the subject matter described herein relates to methods, systems, and computer readable media for rank processing for network function selection.
The 3rd Generation Partnership Project (3GPP) is a collaboration between groups of telecommunications standards associations. The 3GPP defined mobile phone system specifications for telecommunications networks including 3G, 4G, and Long Term Evolution (LTE) networks.
The next generation network for 3GPP is the 5G network. The 5G specifications target high data rates, reduced latency, energy saving, cost reduction, higher system capacity, and increasing numbers of connected devices.
The 3GPP has defined a service-based architecture for its next generation 5G core network. In a service-based architecture, services are provided to software components by application components, typically through a communication protocol over a data communications network. A service can be, e.g., a discrete function that can be accessed remotely and consumed and updated independently of other services in the system.
Different services can be used together to provide the functionality of a larger functional system such as a software application. The service-based architecture can integrate distributed and separately-maintained software components.
Accordingly, there exists a need for methods, systems, and computer readable media for rank processing for network function selection.
Methods, systems, and computer readable media for rank processing in network function selection. An example system includes at least one processor and memory storing instructions for the at least one processor. The system includes a network function discovery node implemented on the at least one processor.
The network function discovery node is configured for performing service discovery between network functions of a telecommunications core network. The network function discovery node is configured for periodically receiving, from each producer network function of a number of producer network functions, a current load value specifying a computing load carried by the producer network function.
The network function discovery node is configured for determining, for each producer network function, an available capacity for the producer network function based on the current load value and a published capacity of the producer network function. The network function discovery node is configured for responding to a network function discovery request from a consumer network function using the available capacity of each producer network function.
In some examples, the network function discovery node is configured for determining, for each producer network function, a current priority for the producer network function based on the available capacity of the produced network function. In some examples, the network function discovery node is configured for determining, for each instance of a plurality of network function instances, an instance available capacity, sorting the network function instances by instance available capacity, and assigning a current priority to each instance based on a sorted position of the instance.
In some examples, the network function discovery node is configured for determining, for each instance of a plurality of network function instances, an instance available capacity, determining a mean capacity of the instance available capacities, and categorizing each instance as a high priority instance if the instance available capacity is greater than the mean capacity and as a low priority instance if the instance available capacity is less than or equal to the mean capacity.
In some examples, the network function discovery node is configured for determining, for each producer network function, whether the current load for the producer network function exceeds a permissible load threshold and, if the current load exceeds the permissible load threshold, removing the producer network function from consideration in responding to at least one network function discovery request. In some examples, the network function discovery node is configured for reconsidering a removed producer network function in response to determining that the current load for the removed producer network function has dropped below an abatement load threshold.
In some examples, the network function discovery node is configured for registering each of the producer network functions and, during registration, receiving the published capacity of the producer network function and a published priority for the producer network function. In some examples, the network function discovery node is configured for registering each of the producer network functions and, during registration, receiving a load reporting interval specifying a rate of load reporting for the producer network function.
In some examples, the network function discovery node is a network function (NF) repository function (NRF) or a service communications proxy (SCP). In some examples, the network function discovery node is configured for determining available capacity of the producer network functions at a service level of the telecommunications network core network.
An example method for rank processing in network function selection includes periodically receiving, at a network function discovery node implemented on at least one processor, and from each producer network function of a plurality of producer network functions, a current load value specifying a computing load carried by the producer network function. The network function discovery node is configured for performing service discovery between a plurality of network functions of a telecommunications core network.
The method includes determining, at the network function discovery node, and for each producer network function, an available capacity for the producer network function based on the current load value and a published capacity of the producer network function. The method includes responding, at the network function discovery node, to a network function discovery request from a consumer network function using the available capacity of each producer network function.
In some examples, the method includes determining, for each producer network function, a current priority for the producer network function based on the available capacity of the produced network function. In some examples, the method includes determining, for each instance of a plurality of network function instances, an instance available capacity, sorting the network function instances by instance available capacity, and assigning a current priority to each instance based on a sorted position of the instance.
In some examples, the method includes determining, for each instance of a plurality of network function instances, an instance available capacity, determining a mean capacity of the instance available capacities, and categorizing each instance as a high priority instance if the instance available capacity is greater than the mean capacity and as a low priority instance if the instance available capacity is less than or equal to the mean capacity. In some examples, the method includes determining, for each producer network function, whether the current load for the producer network function exceeds a permissible load threshold and, if the current load exceeds the permissible load threshold, removing the producer network function from consideration in responding to at least one network function discovery request.
In some examples, the method includes reconsidering a removed producer network function in response to determining that the current load for the removed producer network function has dropped below an abatement load threshold. In some examples, the method includes registering each of the producer network functions and, during registration, receiving the published capacity of the producer network function and a published priority for the producer network function.
In some examples, the method includes registering each of the producer network functions and, during registration, receiving a load reporting interval specifying a rate of load reporting for the producer network function. In some examples, the network function discovery node is a network function (NF) repository function (NRF) or a service communications proxy (SCP). In some examples, the method includes determining available capacity of the producer network functions at a service level of the telecommunications network core network.
In some examples, a non-transitory computer readable medium having stored thereon executable instructions that when executed by a processor of a computer controls the computer to perform steps comprising: periodically receiving, at a network function discovery node implemented on at least one processor, and from each producer network function of a plurality of producer network functions, a current load value specifying a computing load carried by the producer network function, wherein the network function discovery node is configured for performing service discovery between a plurality of network functions of a telecommunications core network; determining, at the network function discovery node, and for each producer network function, an available capacity for the producer network function based on the current load value and a published capacity of the producer network function; and responding, at the network function discovery node, to a network function discovery request from a consumer network function using the available capacity of each producer network function.
The subject matter described herein can be implemented in software in combination with hardware and/or firmware. For example, the subject matter described herein can be implemented in software executed by a processor. In one example implementation, the subject matter described herein may be implemented using a computer readable medium having stored thereon computer executable instructions that when executed by the processor of a computer control the computer to perform steps.
Example computer readable media suitable for implementing the subject matter described herein include non-transitory devices, such as disk memory devices, chip memory devices, programmable logic devices, and application specific integrated circuits. In addition, a computer readable medium that implements the subject matter described herein may be located on a single device or computing platform or may be distributed across multiple devices or computing platforms.
Methods, systems, and computer readable media for rank processing in network function selection in a telecommunications network core. In particular, the disclosed subject matter includes a network function discovery node configured for performing service discovery between network functions of a telecommunications network core.
The 3GPP 5G specifications specify the way that components in the telecommunication network core communicate with each other. The core network in 5G follows a service-based architecture where network elements advertise and provide services which can be consumed using, for example, REST APIs by other network elements in the telecommunications network core. This allows for the adoption of web scale technologies and software in telecommunications networks.
In the 5G architecture, the focus is on loosely coupled services as opposed to tightly coupled functions and point-to-point interfaces. HTTP/2, for example, is used as a service-based application layer protocol. The 5G architecture supports native control and user plane separation. The 5G architecture supports the unified data management framework, an expanded and unified policy framework, and an expanded network exposure functionality.
The network functions in the telecommunication network core can be considered as producer network functions and consumer network functions. Producer network functions provide services for consumer network functions that consume the services. Some network functions will act as consumer network functions at sometimes and as producer network functions at other times.
The 3GPP specifications provide multiple parameters to select preferable producer network functions. From the perspective of a producer network function:
Consumer network functions may select producer network functions based on priority as reported by the NRF. The network function priority information, however, can be static information. Static information may be less useful than dynamic information in selecting an appropriate producer function.
The systems described in this specification can be configured for calculating available capacity and, in turn, providing dynamic priority information.
In some examples, producer network functions report their capacity and priority during registration. Producer network functions may optionally choose to update their capacity and priority after registration.
Then, producer network functions periodically report load information to the NRF. The NRF can use the load information in conjunction with the capacity and priority information stored during a network function discovery procedure.
The NRF can use a rank processing algorithm to calculate:
The NRF updates the discovery response based on available capacity and dynamically calculated priority. The procedure complies with the discovery query procedure as specified by the 3GPP specifications.
The rank processing algorithm enables the NRF to prioritize network functions based on their available capacity. In some examples, the NRF allows the following configurations:
The NRF can be configured to remove any producer network function with a current load above the permissible load threshold from network function discovery responses. The NRF can then consider any removed producer network functions when their current load goes below the abatement load threshold.
In some examples, the NRF processes the discovery procedure output and assigns an available capacity based on the current load of the producer network function as follows:
CA=PC−(PL*PC)
where,
In some examples, the NRF categorizes producer network function instances on the basis of available capacity as follows:
The NRF can then sort the list of producer network functions based on the available capacity (CA) and assign priority according to positions in the list. The rank processing algorithm can be applied at both the network function and the network function service level.
The systems described in this specification can provide one or more of the following benefits.
The networks functions illustrated in
As shown in
Some of the network functions shown in
NRF 108 can be a key component of the 5G Service Based Architecture. NRF 108 maintains an updated repository of all the 5G elements available in the operator's network along with the services provided by each of the elements in the 5G core that are expected to be instantiated, scaled and terminated without or minimal manual intervention. In addition to serving as a repository of the services, NRF 108 also supports discovery mechanisms that allows 5G elements to discover each other and get updated status of the desired elements.
In some examples, NRF 108 supports the following functions:
The NRF interacts with every other element in the 5G core network and it supports the above functions through the following services:
NRF 108 can be deployed in a cloud computing environment along side of the network functions to provide various services to facilitate a service-based architecture, e.g., routing control, resiliency, and observability to telecommunications network core 100.
NRF 108 can be implemented as a software layer that is separate and shared by other services deployed in a cloud computing environment.
NRF 108 can be configured for tasks such as load balancing. NRF 108 can store real-time information on, for example:
Storing such information at NRF 108 can lead to better network function selection decision making at NRF 108.
NRF 108, or another appropriate network function discovery node, can be configured for performing service discovery between network functions of a telecommunications core network. NRF 108 can periodically receive, from producer network functions, a current load value specifying a computing load carried by the producer network function. NRF 108 can determine, for each producer network function, an available capacity for the producer network function based on the current load value and a published capacity of the producer network function. NRF 108 can respond to a network function discovery request from a consumer network function using the available capacity of each producer network function.
Telecommunications network core 100 can include an SCP, which is a decentralized solution and composed of a control plane and a data plane. The SCP is deployed along side of 5G network functions for providing routing control, resiliency, and observability to the core network. In some examples, the SCP is deployed either as a default outbound proxy to network function instances or as a router model where SCP is configured as an outbound proxy at each network function in cloud native environments. SCP provides the following benefits to the 5G core network architecture:
Network function discovery node 202 includes a network function registration engine 212, a dynamic load receiver 214, and a discovery request handler 216. Network function discovery node 202 can execute a rank processing algorithm, for example, at the service level or at the instance level or both.
Network function registration engine 212 is configured for registering producer network functions 204. During registration, network function registration engine 212 can receive a load reporting interval specifying a rate of load reporting for the producer network function. Network function registration engine 212 can, during registration, receive a load reporting interval specifying a rate of load reporting for the producer network function. Registration can also include receiving, e.g., a published capacity, a permissible load threshold, an abatement load threshold, and any other appropriate information.
Dynamic load receiver 214 is configured for periodically receiving, from each producer network function, a current load value specifying a computing load carried by the producer network function. The period for receiving current load values may be a regular period, e.g., after a certain amount of time passes, or an irregular period, e.g., in response to a specified event being detected at the producer network function.
Dynamic load receiver 214 is configured for performing a rank processing algorithm by determining, for each producer network function, an available capacity for the producer network function based on the current load value and a published capacity of the producer network function.
In some examples, dynamic load receiver 214 assigns an available capacity based on the current load of the producer network function as follows:
CA=PC−(PL*PC)
where,
In some examples, dynamic load receiver 214 categorizes producer network function instances on the basis of available capacity as follows:
Dynamic load receiver 214 can then sort the list of producer network functions based on the available capacity (CA) and assign priority according to positions in the list.
In some examples, network function discovery node 202 allows the following configurations:
Network function discovery node 202 can be configured to remove any producer network function with a current load above the permissible load threshold from network function discovery responses. Network function discovery node 202 can then reconsider any removed producer network functions when their current load goes below the abatement load threshold.
Discovery request handler 216 is configured for responding to network function discovery requests from consumer network functions using the available capacity of each producer network function. For example, discovery request handler 216 may receive a producer network function discovery request from a consumer network function; determine a list of a producer network functions that are responsive to one or more criteria in the producer network function discovery request; and send a network function discovery response back to the consumer network function with a list of identifiers for the producer network functions. The list may be, for example, sorted by available capacity or priority, or the network function discovery response may include the available capacities and/or priority values for the producer network functions on the list.
In some examples, network function discovery node 202 is configured for determining, for each instance of some network function instances, an instance available capacity, sorting the network function instances by instance available capacity, and assigning a current priority to each instance based on a sorted position of the instance. In some examples, network function discovery node 202 is configured for determining, for each instance of some network function instances, an instance available capacity, determining a mean capacity of the instance available capacities, and categorizing each instance as a high priority instance if the instance available capacity is greater than the mean capacity and as a low priority instance if the instance available capacity is less than or equal to the mean capacity.
In some examples, network function discovery node 202 is configured for determining, for each producer network function, whether the current load for the producer network function exceeds a permissible load threshold and, if the current load exceeds the permissible load threshold, removing the producer network function from consideration in responding to at least one network function discovery request. Network function discovery node 202 can then be configured for reconsidering a removed producer network function in response to determining that the current load for the removed producer network function has dropped below an abatement load threshold.
Producer network function 304 sends capacity and priority values to NRF 302 during a registration procedure (for example, capacity: 700; priority: 1). Producer network function 306 also sends capacity and priority values to NRF 302 during registration (for example, capacity: 1000; priority: 2).
Producer network function 304 sends a current load value (for example, load: 40%) to NRF 302 in a first message 310. Producer network function 306 sends a current load value (for example, load: 40%) to NRF 302 in a second message 312.
NRF 302 performs the rank processing algorithm 314. For example, continuing with the example numbers given above, NRF 302 calculates the following values:
The example shown in
NRF 302 receives a network function discovery service request from consumer network function 308 in a third message 316. For example, message 316 can include a query parameter and a locality. NRF 302 determines a response using the priority values determined from performing rank processing algorithm 314.
NRF 302 responds to the network function discovery service request by sending a network function discovery response to consumer network function 308 in a fourth message 318. For example, message 318 can include the following information:
Consumer network function 308 can then select a producer network function using the dynamically determined available capacities or priority values. In this case, producer network function 304 initially has a higher priority value; however, based on the current load values, producer network function 306 has a higher priority value. Consumer network function 308 can determine to select producer network function 306 since it has more available capacity and a higher priority value.
Producer network function 304 and producer network function 306 can continue to periodically send messages to NRF 302 with current load values. NRF 302 can then continue to perform the rank processing algorithm to determine available capacities and priority values for producer network function 304 and producer network function 306. Consumer network functions that then send network function discovery requests can receive dynamic available capacity and priority values, which can, in turn, allow consumer network functions to choose producer network functions that may provide better service and alleviate overloading of producer network functions.
Method 400 includes registering producer network functions (402). During registration, method 400 can include receiving a load reporting interval specifying a rate of load reporting for the producer network function. Method 400 can include, during registration, receiving a load reporting interval specifying a rate of load reporting for the producer network function. Registration can also include receiving, e.g., a published capacity, a permissible load threshold, an abatement load threshold, and any other appropriate information.
Method 400 includes periodically receiving, from each producer network function of some producer network functions, a current load value specifying a computing load carried by the producer network function (404).
Method 400 includes determining, for each producer network function, an available capacity for the producer network function based on the current load value and a published capacity of the producer network function (406). In some examples, method 400 includes determining, for each producer network function, a current priority for the producer network function based on the available capacity of the produced network function.
In some examples, method 400 includes determining, for each instance of some network function instances, an instance available capacity, sorting the network function instances by instance available capacity, and assigning a current priority to each instance based on a sorted position of the instance. In some examples, method 400 includes determining, for each instance of some network function instances, an instance available capacity, determining a mean capacity of the instance available capacities, and categorizing each instance as a high priority instance if the instance available capacity is greater than the mean capacity and as a low priority instance if the instance available capacity is less than or equal to the mean capacity.
In some examples, method 400 includes determining, for each producer network function, whether the current load for the producer network function exceeds a permissible load threshold and, if the current load exceeds the permissible load threshold, removing the producer network function from consideration in responding to at least one network function discovery request. Method 400 can then include reconsidering a removed producer network function in response to determining that the current load for the removed producer network function has dropped below an abatement load threshold.
Method 400 includes responding to network function discovery requests from consumer network functions using the available capacity of each producer network function (408).
Method 400 can provide one or more of the following benefits.
Although specific examples and features have been described above, these examples and features are not intended to limit the scope of the present disclosure, even where only a single example is described with respect to a particular feature. Examples of features provided in the disclosure are intended to be illustrative rather than restrictive unless stated otherwise. The above description is intended to cover such alternatives, modifications, and equivalents as would be apparent to a person skilled in the art having the benefit of this disclosure.
The scope of the present disclosure includes any feature or combination of features disclosed in this specification (either explicitly or implicitly), or any generalization of features disclosed, whether or not such features or generalizations mitigate any or all of the problems described in this specification. Accordingly, new claims may be formulated during prosecution of this application (or an application claiming priority to this application) to any such combination of features.
In particular, with reference to the appended claims, features from dependent claims may be combined with those of the independent claims and features from respective independent claims may be combined in any appropriate manner and not merely in the specific combinations enumerated in the appended claims.
Number | Name | Date | Kind |
---|---|---|---|
5381413 | Tobagi et al. | Jan 1995 | A |
5592672 | Grewal et al. | Jan 1997 | A |
5719861 | Okanoue | Feb 1998 | A |
6014558 | Thomas | Jan 2000 | A |
6105034 | Buckler | Aug 2000 | A |
6725278 | Gonzalez | Apr 2004 | B1 |
6725401 | Lindhorst-Ko | Apr 2004 | B1 |
6735291 | Schmid et al. | May 2004 | B1 |
6748435 | Wang et al. | Jun 2004 | B1 |
7151945 | Myles et al. | Dec 2006 | B2 |
7308499 | Chavez | Dec 2007 | B2 |
7631093 | Sternagle | Dec 2009 | B2 |
7706822 | Emeott et al. | Apr 2010 | B2 |
7742421 | Bantukul et al. | Jun 2010 | B2 |
7782776 | Shankar et al. | Aug 2010 | B2 |
7929419 | Sprague | Apr 2011 | B2 |
8023482 | Gong et al. | Sep 2011 | B2 |
8300637 | Bennett, III et al. | Oct 2012 | B1 |
8306034 | Jang et al. | Nov 2012 | B2 |
8498202 | Kanode et al. | Jul 2013 | B2 |
8620858 | Backholm et al. | Dec 2013 | B2 |
8645565 | Sparks et al. | Feb 2014 | B2 |
8767705 | Göppner et al. | Jul 2014 | B2 |
8811228 | Lopez et al. | Aug 2014 | B2 |
8811372 | Li et al. | Aug 2014 | B2 |
8824449 | van der Wateren et al. | Sep 2014 | B2 |
8879431 | Ridel et al. | Nov 2014 | B2 |
8954080 | Janakiraman et al. | Feb 2015 | B2 |
9071512 | Marsico | Jun 2015 | B2 |
9124537 | Kolze | Sep 2015 | B2 |
9246762 | Watkins | Jan 2016 | B1 |
9386551 | Zhou et al. | Jul 2016 | B2 |
9667590 | Yan et al. | May 2017 | B2 |
10097504 | Backholm | Oct 2018 | B2 |
10285155 | Dodd-Noble et al. | May 2019 | B1 |
10299128 | Suthar et al. | May 2019 | B1 |
10313362 | Ahuja | Jun 2019 | B2 |
10361843 | Suthar et al. | Jul 2019 | B1 |
10595256 | Marupaduga et al. | Mar 2020 | B1 |
10609154 | Talebi Fard et al. | Mar 2020 | B2 |
10609530 | Patil et al. | Mar 2020 | B1 |
10616934 | Talebi Fard et al. | Apr 2020 | B2 |
10637753 | Taft et al. | Apr 2020 | B1 |
10652098 | Kim | May 2020 | B2 |
10772062 | Albasheir et al. | Sep 2020 | B1 |
10778527 | Assali et al. | Sep 2020 | B2 |
10791044 | Krishan et al. | Sep 2020 | B1 |
10819636 | Goel | Oct 2020 | B1 |
10833938 | Rajput et al. | Nov 2020 | B1 |
10880370 | Seenappa et al. | Dec 2020 | B2 |
11018971 | Mahalank et al. | May 2021 | B2 |
11082393 | Goel | Aug 2021 | B2 |
11109307 | Bartolomé | Aug 2021 | B2 |
11159359 | Goel | Oct 2021 | B2 |
11224009 | Krishan | Jan 2022 | B2 |
11271846 | Krishan | Mar 2022 | B2 |
11290549 | Krishan | Mar 2022 | B2 |
20010039585 | Primak et al. | Nov 2001 | A1 |
20030086410 | Eikkula | May 2003 | A1 |
20030174649 | Shankar et al. | Sep 2003 | A1 |
20030223414 | Wong | Dec 2003 | A1 |
20040003069 | Wong | Jan 2004 | A1 |
20040062278 | Hadzic et al. | Apr 2004 | A1 |
20040088424 | Park et al. | May 2004 | A1 |
20040114744 | Trossen | Jun 2004 | A1 |
20040141473 | Buot | Jul 2004 | A1 |
20040158606 | Tsai | Aug 2004 | A1 |
20040205190 | Chong et al. | Oct 2004 | A1 |
20040208183 | Balachandran et al. | Oct 2004 | A1 |
20040221061 | Chavez | Nov 2004 | A1 |
20050193096 | Yu et al. | Sep 2005 | A1 |
20050207402 | Kobayashi et al. | Sep 2005 | A1 |
20050227685 | Costa Requena et al. | Oct 2005 | A1 |
20050232407 | Craig et al. | Oct 2005 | A1 |
20060010224 | Sekar et al. | Jan 2006 | A1 |
20060010321 | Nakamura et al. | Jan 2006 | A1 |
20060069776 | Shim et al. | Mar 2006 | A1 |
20060101143 | Garcia et al. | May 2006 | A1 |
20060104210 | Nielsen | May 2006 | A1 |
20060253563 | Yang et al. | Nov 2006 | A1 |
20070050331 | Bauman et al. | Mar 2007 | A1 |
20070156909 | Osborn et al. | Jul 2007 | A1 |
20070191004 | Yamakawa et al. | Aug 2007 | A1 |
20070237311 | Ofir et al. | Oct 2007 | A1 |
20070242738 | Park et al. | Oct 2007 | A1 |
20080165761 | Goppner et al. | Jul 2008 | A1 |
20080280623 | Danne et al. | Nov 2008 | A1 |
20090006652 | Kasatani | Jan 2009 | A1 |
20090024727 | Jeon et al. | Jan 2009 | A1 |
20090040923 | Bantukul et al. | Feb 2009 | A1 |
20090055835 | Zhu | Feb 2009 | A1 |
20090141625 | Ghai et al. | Jun 2009 | A1 |
20090185494 | Li et al. | Jul 2009 | A1 |
20090222584 | Josefsberg et al. | Sep 2009 | A1 |
20090268723 | Przybysz | Oct 2009 | A1 |
20100261490 | Berry et al. | Oct 2010 | A1 |
20110078674 | Ershov | Mar 2011 | A1 |
20110202604 | Craig et al. | Aug 2011 | A1 |
20120079082 | Ding et al. | Mar 2012 | A1 |
20130029708 | Fox et al. | Jan 2013 | A1 |
20130039176 | Kanode et al. | Feb 2013 | A1 |
20130198269 | Fleischman et al. | Aug 2013 | A1 |
20130272123 | Lee et al. | Oct 2013 | A1 |
20140040975 | Raleigh et al. | Feb 2014 | A1 |
20140075004 | Van Dusen et al. | Mar 2014 | A1 |
20140379901 | Tseitlin et al. | Dec 2014 | A1 |
20150003296 | Fan et al. | Jan 2015 | A1 |
20150016266 | Dumitrescu et al. | Jan 2015 | A1 |
20150039560 | Barker et al. | Feb 2015 | A1 |
20150071074 | Zaidi et al. | Mar 2015 | A1 |
20150249588 | Leon et al. | Sep 2015 | A1 |
20150263987 | Klein et al. | Sep 2015 | A1 |
20150351084 | Werb | Dec 2015 | A1 |
20160142324 | Vihtari et al. | May 2016 | A1 |
20160149811 | Roch et al. | May 2016 | A1 |
20160156513 | Zhang et al. | Jun 2016 | A1 |
20160164788 | Goel et al. | Jun 2016 | A1 |
20160183156 | Chin et al. | Jun 2016 | A1 |
20160234119 | Zaidi et al. | Aug 2016 | A1 |
20160315743 | Nagaraj et al. | Oct 2016 | A1 |
20160344635 | Lee et al. | Nov 2016 | A1 |
20160350683 | Bester | Dec 2016 | A1 |
20160352588 | Subbarayan et al. | Dec 2016 | A1 |
20160380906 | Hodique et al. | Dec 2016 | A1 |
20170077751 | Forbes, Jr. | Mar 2017 | A1 |
20170187673 | Kaliski, Jr. et al. | Jun 2017 | A1 |
20170220367 | Li et al. | Aug 2017 | A1 |
20170221015 | June et al. | Aug 2017 | A1 |
20170353387 | Kwak et al. | Dec 2017 | A1 |
20180039494 | Lander et al. | Feb 2018 | A1 |
20180083882 | Krishan et al. | Mar 2018 | A1 |
20180159780 | Essigmann et al. | Jun 2018 | A1 |
20180183724 | Callard et al. | Jun 2018 | A1 |
20180213391 | Inoue | Jul 2018 | A1 |
20180227243 | Zhang et al. | Aug 2018 | A1 |
20180262592 | Zandi et al. | Sep 2018 | A1 |
20180262625 | McCarley et al. | Sep 2018 | A1 |
20180285794 | Gray-Donald et al. | Oct 2018 | A1 |
20180324247 | Hood et al. | Nov 2018 | A1 |
20180324646 | Lee et al. | Nov 2018 | A1 |
20180343567 | Ashrafi | Nov 2018 | A1 |
20190007366 | Voegele et al. | Jan 2019 | A1 |
20190036871 | Lapidous et al. | Jan 2019 | A1 |
20190045351 | Zee et al. | Feb 2019 | A1 |
20190075552 | Yu et al. | Mar 2019 | A1 |
20190116486 | Kim et al. | Apr 2019 | A1 |
20190116521 | Qiao et al. | Apr 2019 | A1 |
20190140895 | Ennis, Jr. et al. | May 2019 | A1 |
20190158364 | Zhang et al. | May 2019 | A1 |
20190173740 | Zhang et al. | Jun 2019 | A1 |
20190174561 | Sivavakeesar | Jun 2019 | A1 |
20190182875 | Talebi Fard et al. | Jun 2019 | A1 |
20190191348 | Futaki et al. | Jun 2019 | A1 |
20190191467 | Dao et al. | Jun 2019 | A1 |
20190222633 | Howes et al. | Jul 2019 | A1 |
20190223093 | Watfa et al. | Jul 2019 | A1 |
20190230556 | Lee | Jul 2019 | A1 |
20190238642 | Sesham et al. | Aug 2019 | A1 |
20190261244 | Jung et al. | Aug 2019 | A1 |
20190268270 | Fattah | Aug 2019 | A1 |
20190306251 | Talebi Fard et al. | Oct 2019 | A1 |
20190306907 | Andreoli-Fang et al. | Oct 2019 | A1 |
20190313236 | Lee et al. | Oct 2019 | A1 |
20190313437 | Jung et al. | Oct 2019 | A1 |
20190313469 | Karampatsis et al. | Oct 2019 | A1 |
20190335002 | Bogineni et al. | Oct 2019 | A1 |
20190335534 | Atarius et al. | Oct 2019 | A1 |
20190342229 | Khinvasara et al. | Nov 2019 | A1 |
20190342921 | Loehr et al. | Nov 2019 | A1 |
20190349901 | Basu Mallick et al. | Nov 2019 | A1 |
20190357092 | Jung et al. | Nov 2019 | A1 |
20190380031 | Suthar et al. | Dec 2019 | A1 |
20190394284 | Baghel et al. | Dec 2019 | A1 |
20190394624 | Karampatsis et al. | Dec 2019 | A1 |
20190394833 | Talebi Fard et al. | Dec 2019 | A1 |
20200007632 | Landais et al. | Jan 2020 | A1 |
20200008069 | Zhu et al. | Jan 2020 | A1 |
20200028920 | Livanos et al. | Jan 2020 | A1 |
20200029197 | Tandon et al. | Jan 2020 | A1 |
20200045753 | Dao et al. | Feb 2020 | A1 |
20200045767 | Velev et al. | Feb 2020 | A1 |
20200053670 | Jung et al. | Feb 2020 | A1 |
20200053724 | MolavianJazi et al. | Feb 2020 | A1 |
20200053828 | Bharatia et al. | Feb 2020 | A1 |
20200059420 | Abraham | Feb 2020 | A1 |
20200059856 | Cui et al. | Feb 2020 | A1 |
20200076764 | Robitzsch et al. | Mar 2020 | A1 |
20200084663 | Park et al. | Mar 2020 | A1 |
20200092423 | Qiao et al. | Mar 2020 | A1 |
20200092424 | Qiao et al. | Mar 2020 | A1 |
20200106812 | Verma et al. | Apr 2020 | A1 |
20200127916 | Krishan | Apr 2020 | A1 |
20200136911 | Assali et al. | Apr 2020 | A1 |
20200137174 | Stammers et al. | Apr 2020 | A1 |
20200177629 | Hooda et al. | Jun 2020 | A1 |
20200192725 | Feldkamp | Jun 2020 | A1 |
20200305033 | Keller et al. | Sep 2020 | A1 |
20200313996 | Krishan et al. | Oct 2020 | A1 |
20200314615 | Patil et al. | Oct 2020 | A1 |
20200336554 | Deshpande | Oct 2020 | A1 |
20200404608 | Albasheir et al. | Dec 2020 | A1 |
20200412597 | Goel et al. | Dec 2020 | A1 |
20210000723 | Strand et al. | Jan 2021 | A1 |
20210007023 | Umapathy et al. | Jan 2021 | A1 |
20210044481 | Xu et al. | Feb 2021 | A1 |
20210067480 | Goel | Mar 2021 | A1 |
20210067485 | Goel | Mar 2021 | A1 |
20210076248 | Kallam | Mar 2021 | A1 |
20210105214 | Goel | Apr 2021 | A1 |
20210111985 | Mahalank et al. | Apr 2021 | A1 |
20210168055 | Lair | Jun 2021 | A1 |
20210204200 | Krishan et al. | Jul 2021 | A1 |
20210235254 | Farooq | Jul 2021 | A1 |
20210273977 | Karasaridis et al. | Sep 2021 | A1 |
20210274392 | Dao et al. | Sep 2021 | A1 |
20210297935 | Belling et al. | Sep 2021 | A1 |
20210367916 | Belling et al. | Nov 2021 | A1 |
20220015023 | De-Gregorio-Rodriguez et al. | Jan 2022 | A1 |
20220022024 | Aravind | Jan 2022 | A1 |
20220038545 | Krishan | Feb 2022 | A1 |
20220070648 | Krishan | Mar 2022 | A1 |
Number | Date | Country |
---|---|---|
1700694 | Nov 2005 | CN |
101151861 | Mar 2008 | CN |
101366311 | Feb 2009 | CN |
101512971 | Aug 2009 | CN |
ZL 200780036907.1 | Feb 2012 | CN |
105635345 | Feb 2019 | CN |
109788078 | May 2019 | CN |
0 950 952 | Oct 1999 | EP |
1 175 074 | Jan 2002 | EP |
2 575 303 | Apr 2013 | EP |
333811 | Mar 2020 | IN |
2006-279805 | Oct 2006 | JP |
10-2004-0057858 | Jul 2004 | KR |
10-2005-0002335 | Jan 2005 | KR |
10-2006-0025869 | Mar 2006 | KR |
WO 0069140 | Nov 2000 | WO |
WO 0113228 | Feb 2001 | WO |
WO 2008019056 | Feb 2008 | WO |
WO 2008144927 | Dec 2008 | WO |
WO 2009018418 | Feb 2009 | WO |
WO 2011100629 | Aug 2011 | WO |
WO 2017143915 | Aug 2017 | WO |
WO 2018174021 | Sep 2018 | WO |
WO 2018174516 | Sep 2018 | WO |
WO 2019144321 | Jan 2019 | WO |
WO 2019034609 | Feb 2019 | WO |
WO 2019062596 | Apr 2019 | WO |
WO 2019076273 | Apr 2019 | WO |
WO 2019144321 | Aug 2019 | WO |
WO 2019215308 | Nov 2019 | WO |
WO 2019220172 | Nov 2019 | WO |
WO 2020091934 | May 2020 | WO |
WO 2020263486 | Dec 2020 | WO |
WO 2021040827 | Mar 2021 | WO |
WO 2021055998 | Mar 2021 | WO |
WO 2021138074 | Jul 2021 | WO |
WO 2022025987 | Feb 2022 | WO |
WO 2022050987 | Mar 2022 | WO |
Entry |
---|
Hearing Notice for Indian Patent Application Serial No. 7526/CHENP/2012 (Feb. 10, 2021). |
Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration for International Application No. PCT/US2021/033031 (dated May 18, 2021). |
Non-Final Office Action for U.S. Appl. No. 16/945,794 (dated Sep. 15, 2021). |
Commonly-assigned, co-pending U.S. Appl. No. 17/468,076 for “Methods, Systems, and Computer Readable Media for Using Service Communications Proxy (SCP) or Security Edge Protection Proxy (SEPP) to Apply or Override Preferred-Locality Attribute During Network Function (NF) Discovery” (Unpublished, filed Sep. 7, 2021). |
Commonly-assigned, co-pending U.S. Appl. No. 17/397,968 for “Methods, Systems, and Computer Readable Media for Processing Network Function (NF) Discovery Requests at NF Repository Function (NRF) Using Prioritized Lists of Preferred Locations,” (Unpublished, filed Aug. 9, 2021). |
Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration for International Application No. PCT/US2021/024000 (dated Jun. 24, 2021). |
Non-Final Office Action for U.S. Appl. No. 16/356,446 (dated Jun. 16, 2021). |
Commonly-assigned, co-pending U.S. Appl. No. 17/337,356 for “Methods, Systems, and Computer Readable Media for Applying or Overriding Preferred Locality Criteria in Processing Network Function (NF) Discovery Requests,” (Unpublished, filed Jun. 2, 2021). |
Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration for U.S. Patent Application Serial No. PCT/US2021/020120 (dated Jun. 1, 2021). |
“3rd Generation Partnership Project; Technical Specification Group Core Network and Terminals; 5G System; Network Function Repository Services; Stage 3 (Release 17),” 3GPP TS 29.510, V17.1.0, pp. 1-243 (Mar. 2021). |
“3rd Generation Partnership Project; Technical Specification Group Core Network and Terminals; 5G System; Technical Realization of Service Based Architecture; Stage 3 (Release 17),” 3GPP TS 29.500, V17.2.0, pp. 1-100 (Mar. 2021). |
“3rd Generation Partnership Project; Technical Specification Group Services and System Aspects; Security architecture and procedures for 5G system (Release 17),” 3GPP TS 33.501, V17.1.0, pp. 1-256 (Mar. 2021). |
“3rd Generation Partnership Project; Technical Specification Group Core Network and Terminals; 5G System; Public Land Mobile Network (PLMN) Interconnection; Stage 3 (Release 17),” 3GPP TS 29.573, V17.0.0, pp. 1-100 (Mar. 2021). |
“3rd Generation Partnership Project; Technical Specification Group Services and System Aspects; System architecture for the 5G System (5GS); Stage 2 (Release 17),” 3GPP TS 23.501, V17.0.0, pp. 1-489 (Mar. 2021). |
Commonly-assigned, co-pending U.S. Appl. No. 17/203,693 for “Methods, Systems, and Computer Readable Media for Hypertext Transfer Protocol (HTTP) Stream Tuning for Load and Overload Control,” (Unpublished, filed Mar. 16, 2021). |
Commonly-assigned, co-pending U.S. Appl. No. 17/200,777 for “Methods, Systems, and Computer Readable Media for Supporting Multiple Preferred Localities for Network Function (NF) Discovery and Selection Procedures” (Unpublished, filed Mar. 13, 2021). |
Nokia et al., “Discussion paper on authorization for Model D Indirect communications”, 3GPP TSG SA WG3; S3-194380 (Nov. 11, 2019). |
Commonly-assigned, co-pending U.S. Appl. No. 17/543,989 for “Methods, Systems, and Computer Readable Media for Dynamic Adjustment to Network Function Profile for Discovery Responses” (Unpublished, filed Dec. 17, 2021). |
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 17/074,553 (dated Dec. 29, 2021). |
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 17/001,599 (dated Nov. 17, 2021). |
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 17/102,404 (dated Oct. 7, 2021). |
Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration for International Application No. PCT/US2021/033031 (dated Sep. 16, 2021). |
“3rd Generation Partnership Project; Technical Specification Group Services and System Aspects; Security architecture and procedures for 5G system (Release 17),” 3GPP TS 33.501, V17.3.0, pp. 1-258 (Sep. 2021). |
“3rd Generation Partnership Project; Technical Specification Group Core Network and Terminals; 5G System; Network Function Repository Services; Stage 3 (Release 17),” 3GPP TS 29.510, V17.3.0, pp. 1-271 (Sep. 2021). |
“3rd Generation Partnership Project; Technical Specification Group Services and System Aspects; System architecture for the 5G System (5GS); Stage 2 (Release 17),” 3GPP TS 23.501, V17.2.0, pp. 1-542 (Sep. 2021). |
“3rd Generation Partnership Project; Technical Specification Group Core Network and Terminals; 5G System; Technical Realization of Service Based Architecture; Stage 3 (Release 17),” 3GPP TS 29.500, V17.4.0, pp. 1-109 (Sep. 2021). |
Non-Final Office Action for U.S. Appl. No. 17/074,553 (dated Aug. 18, 2021). |
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 16/730,799 (dated Aug. 16, 2021). |
Commonly-assigned, co-pending U.S. Appl. No. 17/392,288 for “Methods, Systems, and Computer Readable Media for Optimized Routing of Service Based Interface (SBI) Request Messages to Remote Network Function (NF) Repository Functions Using Indirect Communications Via Service Communications Proxy (SCP)” (Unpublished, filed Aug. 3, 2021). |
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 16/730,799 (dated Jul. 30, 2021). |
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 16/601,380 (dated Jan. 19, 2021). |
Non-Final Office Action for U.S. Appl. No. 16/601,380 (dated Sep. 15, 2020). |
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 16/176,920 (dated Apr. 16, 2020). |
Applicant-Initiated Interview Summary for U.S. Appl. No. 16/176,920 (dated Apr. 1, 2020). |
Non-Final Office Action for U.S. Appl. No. 16/176,920 (dated Mar. 6, 2020). |
Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration for International Application Serial No. PCT/US2019/053912 (dated Dec. 18, 2019). |
Commonly-assigned, co-pending U.S. Appl. No. 16/601,380 for “Methods, Systems, and Computer Readable Media for Distributing Network Function (NF) Topology Information Among Proxy Nodes and for Using the NF Topology Information for Inter-Proxy Node Message Routing,” (Unpublished, filed Oct. 14. |
Commonly-assigned, co-pending International Application No. PCT/US19/53912 for “Methods, Systems, and Computer Readable Media for Providing a Service Proxy Function in a Telecommunications Network Core Using a Service-Based Architecture.” (Unpublished filed Sep. 30 2019). |
Commonly-assigned, co-pending U.S. Appl. No. 16/176,920 for “Methods, Systems, and Computer Readable Media for Providing a Service Proxy Function in a Telecommunications Network Core Using a Service-Based Architecture,” (Unpublished filed Oct. 31, 2018). |
“3rd Generation Partnership Project; Technical Specification Group Core Network and Terminals; 5G System; Network Function Repository Services; Stage 3 (Release 16),” 3GPP TS 29.510, V16.0.0, pp. 1-135 (Jun. 2019). |
“3rd Generation Partnership Project; Technical Specification Group Services and System Aspects; Study on Enhancements to the Service-Based Architecture (Release 16),” 3GPP TR 23.742, V0.3.0, pp. 1-64 (Jul. 2018). |
“3rd Generation Partnership Project; Technical Specification Group Services and System Aspects; Study on Enhancements to the Service-Based Architecture (Release 16),” 3GPP TR 23.742, V0.2.0, pp. 1-39 (Jun. 2018). |
“5G; Procedures for the 5G System (3GPP TS 23.502 version 15.2.0 Release 15),” ETSI TS 123 502 V15.2.0, pp. 1-46 (Jun. 2018). |
Scholl et al., “An API First Approach to Microservices Development,” Oracle, https://blogs.oracle.com/developers/an-api-first-approach-to-microservices-development, pp. 1-12 (Nov. 8, 2017). |
“Pseudo-CR on Service Discovery and Registration using NRF service,” Ericsson, 3GPP TSG CT4 Meeting #79, 3GPP TR 29.891-v0.3.0, pp. 1-4 (Aug. 21-25, 2017). |
Hearing Notice for Indian Application No. 1106/CHENP/2009 (May 28, 2015). |
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 13/197,566 (dated Feb. 20, 2015). |
Notification of the Second Office Action for Chinese Application No. 201180013381.1 (dated Feb. 10, 2015). |
Notification of Reexamination for Chinese Application No. 200880109633.9 (dated Jan. 29, 2015). |
Extended European Search Report for European Patent Application No. 08796925.9 (dated Nov. 21, 2014). |
Non-Final Office Action for U.S. Appl. No. 13/197,566 (dated Aug. 27, 2014). |
Notification of Reexamination for Chinese Patent Application No. 200880109633.9 (dated Jul. 28, 2014). |
Notification of the First Office Action for Chinese Application No. 201180013381.1 (dated Jun. 5, 2014). |
First Examination Report for Indian Patent Application No. 1106/CHENP/2009 (dated Jan. 28, 2014). |
Extended European Search Report for European Application No. 07836478.3 (dated Nov. 18, 2013). |
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 13/026,153 (dated Apr. 15, 2013). |
Communication of European Publication Number and Information on the Application of Article 67(3) EPC for European Patent Application No. 11742923.3 (dated Nov. 21, 2012). |
First Office Action for Chinese Patent Application No. 200820109633.9 (dated May 3, 2012). |
Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration for International Application No. PCT/US2011/024645 (dated Oct. 28, 2011). |
Notice of Allowance for U.S. Appl. No. 11/510,284 (dated Dec. 9, 2010). |
Chinese Office Action for Chinese Patent Application No. 200780036907.1 (dated Oct. 11, 2010). |
Final Official Action for U.S. Appl. No. 11/510,284 (Jun. 22, 2010). |
Official Action for U.S. Appl. No. 11/510,284 (dated Feb. 23, 2010). |
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 12/183,406 (dated Feb. 12, 2010). |
3GPP, “3rd Generation Partnership Project; Technical Specification Group Core Network and Terminals; Diameter-based Protocols Usage and Recommendations in 3GPP (Release 9),” 3GPP TR 29.909 V9.0.0 (Dec. 2009). |
Tsou et al., “Realm-Based Redirection in Diameter,” Internet Engineering Task Force, draft-ietf-dime-realm-based-redirect-02, pp. 1-7 (Oct. 27, 2009). |
Final Official Action for U.S. Appl. No. 11/510,284 (dated Jul. 9, 2009). |
Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration for International Application No. PCT/US2008/071718 (dated Jan. 28, 2009). |
Official Action for U.S. Appl. No. 11/510,284 (dated Dec. 24, 2008). |
Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration for International Application No. PCT/US07/17329 (dated Feb. 15, 2008). |
A. B. Roach, “Session Initiation Protocol (SIP)-Specific Event Notification,” dynamicsoft, Network Working Group, pp. 1-38 (Jun. 2002). |
Rosenberg, “SIP Proxies,” www.dynamicsoft.com, pp. 1-30 (Jul. 2000). |
Wiesmann et al., “Understanding Replication in Databases and Distributed Systems,” IEEE, pp. 464-474 (Apr. 10, 2000). |
Wang et al., “A Signaling System Using Lightweight Call Sessions,” IEEE, pp. 697-706 (Mar. 26, 2000). |
Gribble et al., “The MultiSpace: an Evolutionary Platform for Infrastructural Services,” The University of California at Berkeley, pp. 157-170 (Jun. 6, 1999). |
Handley et al., “SIP: Session Initiation Protocol,” IETF RFC 2543, pp. 1-153 (Mar. 1999). |
Handley et al., “SDP: Session Description Protocol,” IETF RFC 2327, pp. 1-42 (Apr. 1998). |
S. Paul et al., “Reliable Multicast Transport Protocol (RMTP),” IEEE Journal on Selected Areas in Communications, vol. 15, No. 3, pp. 407-421 (Apr. 1997). |
Lin et al., “A Reliable Multicast Transport Protocol,” IEEE Infocom, pp. 1414-1424 (1996). |
Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration for International Application Serial No. PCT/US2020/065765 (dated Apr. 15, 2021). |
Ex Parte Quayle Action for U.S. Appl. No. 16/730,799 (Apr. 7, 2021). |
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 16/555,817 (dated Mar. 24, 2021). |
International Search Report and Written Opinion for Patent Cooperation Treaty Application Serial No. PCT/US2020/061885 (dated Feb. 4, 2021). |
International Search Report and Written Opinion for Patent Cooperation Treaty Application Serial No. PCT/US2020/057712 (dated Feb. 2, 2021). |
Cheshire, S. et al., “Apple's DNS Long-Lived Queries protocol draft-sekar-dns-llq-06,” Internet Engineering Task Force (IETF), pp. 1-26 (Aug. 23, 2019). |
Final Office Action for U.S. Appl. No. 16/697,021 (dated Feb. 2, 2021). |
Applicant-Initiated Interview Summary for U.S. Appl. No. 16/697,021 (dated Jan. 26, 2021). |
“3rd Generation Partnership Project; Technical Specification Group Services and System Aspects; Procedures for the 5G System (5GS); Stage 2 (Release 16),” 3GPP TS 23.502, V16.7.0, pp. 1-603 (Dec. 2020). |
“3rd Generation Partnership Project; Technical Specification Group Services and System Aspects; System architecture for the 5G System (5GS); Stage 2 (Release 16),” 3GPP TS 23.501, V16.7.0, pp. 1-450 (Dec. 2020). |
“3rd Generation Partnership Project; Technical Specification Group Core Network and Terminals; 5G System; Network Function Repository Services; Stage 3 (Release 17),” 3GPP TS 29.510, V17.0.0, pp. 1-245 (Dec. 2020). |
“3rd Generation Partnership Project; Technical Specification Group Core Network and Terminals; 5G System; Technical Realization of Service Based Architecture; Stage 3 (Release 17),” 3GPP TS 29.500, V17.1.0, pp. 1-90 (Dec. 2020). |
Advisory Action for U.S. Appl. No. 16/356,446 (dated Dec. 22, 2020). |
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 16/555,817 (dated Dec. 3, 2020). |
Commonly-assigned, co-pending Continuation-in-Part U.S. Appl. No. 17/102,404 for “Methods, Systems, and Computer Readable Media for Policing Access Point Name-Aggregate Maximum Bit Rate (APN-AMBR) Across Packet Data Network Gateway Data Plane (P-GW DP) Worker Instances,” (Unpublished, filed Nov. 23, 2020). |
Commonly-assigned, co-pending U.S. Appl. No. 17/156,149 for “Methods, Systems, and Computer Readable Media for Optimized Routing of Messages Relating to Existing Network Function (NF) Subscriptions Using an Intermediate Forwarding NF Repository Function (NRF),” (Unpublished, filed Nov. 9, 2020). |
Commonly-assigned, co-pending Continuation-in-Part U.S. Appl. No. 17/074,553 for “Methods, Systems, and Computer Readable Media for Actively Discovering and Tracking Addresses Associated with 4G Service Endpoints,” (Unpublished, filed Oct. 19, 2020). |
“P-GW Administration Guide, StarOS Release 21.20,” Cisco, pp. 1-1164 (Oct. 11, 2020). |
“3rd Generation Partnership Project; Technical Specification Group Core Network and Terminals; Non-Access-Stratum (NAS) protocol for Evolved Packet System (EPS); Stage 3 (Release 17),” 3GPP TS 24.301, V17.0.0, pp. 1-585 (Sep. 2020). |
3rd Generation Partnership Project; Technical Specification Group Services and System Aspects; Architecture enhancements to facilitate communications with packet data networks and applications (Release 16), 3GPP TS 23.682, V16.8.0, pp. 1-135 (Sep. 2020). |
Non-Final Office Action for U.S. Appl. No. 16/697,021 (dated Sep. 29, 2020). |
Commonly-assigned, co-pending continuation in part U.S. Appl. No. 17/102,404 for “Methods, Systems, and Computer Readable Media for Policing Access Point Name-Aggregate Maximum Bit Rate (APN-AMBR) Across Packet Data Network Gateway Data Plane (P-GW DP) Worker Instances,” (Unpublished, filed Sep. 23, 2020). |
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 16/527,988 (dated Sep. 17, 2020). |
Final Office Action for U.S. Appl. No. 16/356,446 (dated Sep. 8, 2020). |
Notice of Allowance and Fee(s) Due and Examiner-Initiated Interview Summary for U.S. Appl. No. 16/453,955 (dated Aug. 26, 2020). |
Commonly-assigned, co-pending U.S. Appl. No. 17/001,599 for “Methods, Systems, and Computer Readable Media for Optimized Network Function (NF) Discovery and Routing Using Service Communications Proxy (SCP) And NF Repository Function (NRF),” (Unpublished, filed Aug. 24, 2020). |
Notification of the Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration for International Application No. PCT/US2020/034723 (dated Aug. 17, 2020). |
Non-Final Office Action for U.S. Appl. No. 16/555,817 (dated Aug. 7, 2020). |
“3rd Generation Partnership Project; Technical Specification Group Services and System Aspects; System architecture for the 5G System (5GS); Stage 2 (Release 16),” 3GPP TS 23.501 V16.5.1, pp. 1-440 (Aug. 2020). |
Commonly-assigned, co-pending U.S. Appl. No. 16/945,794 for “Methods, Systems, And Computer Readable Media For Preferred Network Function (NF) Location Routing Using Service Communications Proxy (SCP),” (Unpublished, filed Jul. 31, 2020). |
Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration for International Application Serial No. PCT/US2020/035004 (Jul. 7, 2020). |
“3rd Generation Partnership Project; Technical Specification Group Core Network and Terminals; 5G System; Network Function Repository Services; Stage 3 (Release 16),” 3GPP TS 29.510 V16.4.0, pp. 1-206 (Jul. 2020). |
Ex Parte Quayle Action for U.S. Appl. No. 16/527,988 (Jun. 1, 2020). |
“3rd Generation Partnership Project; Technical Specification Group Core Network and Terminals; 5G System; Technical Realization of Service Based Architecture; Stage 3 (Release 16),” 3GPP TS 29.500 V16.4.0 pp. 1-79 (Jun. 2020). |
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 16/369,691 (dated May 12, 2020). |
Non-Final Office Action for U.S. Appl. No. 16/356,446 (dated May 11, 2020). |
“3rd Generation Partnership Project; Technical Specification Group Services and System Aspects; Procedures for the 5G System (5GS); Stage 2 (Release 16),” 3GPP TS 23.502 V16.4.0, pp. 1-582 (Mar. 2020). |
“3rd Generation Partnership Project; Technical Specification Group Services and System Aspects; System architecture for the 5G System (5GS); Stage 2 (Release 16),” 3GPP TS 23.501 V16.4.0, pp. 1-430 (Mar. 2020). |
Commonly-assigned, co-pending U.S. Appl. No. 16/697,021 for “Methods, Systems, and Computer Readable Media for Diameter-Peer-Wide Egress Rate Limiting at Diameter Relay Agent (DRA),” (Unpublished, filed Nov. 27, 2019). |
“5G; System architecture for the 5G System (5GS) (3GPP TS 23.501 version 15.6.0 Release 15),” ETSI TS 123 501, V15.6.0, pp. 1-168 (Oct. 2019). |
“5G; 5G System; Network function repository services; Stage 3 (3GPP TS 29.510 version 15.5.1 Release 15),” ETSI TS 129 510, V15.5.1, pp. 1-132 (Oct. 2019). |
“3rd Generation Partnership Project; Technical Specification Group Core Network and Terminals; 5G Systems; Network Function Repository Services; Stage 3 (Release 16),” 3GPP TS 29.510 V.16.1.1, pp. 1-150 (Oct. 2019). |
“3rd Generation Partnership Project; Technical Specification Group Core Network and Terminals; 5G System; Technical Realization of Service Based Architecture; Stage 3 (Release 16),” 3GPP TS 29.500 V16.1.0, pp. 1-43 (Sep. 2019). |
“3rd Generation Partnership Project; Technical Specification Group Service and System Aspects; System Architecture for the 5G System (5GS); Stage 2 (Release 16),” 3GPP TS 23.501 V16.2.0, pp. 1-391 (Sep. 2019). |
“3rd Generation Partnership Project; Technical Specification Group Services and System Aspects; Architecture enhancements to facilitate communications with packet data networks and applications (Release 16),” 3GPP TS 23.682, V16.4.0, pp. 1-30 (Sep. 2019). |
“5G; 5G System; Technical Realization of Service Based Architecture; Stage 3 (3GPP TS 29.500 version 15.5.0 Release 15),” ETSI TS 129 500, V15.5.0, pp. 1-40 (Sep. 2019). |
Cheshire et al., “Apple's DNS Long-Lived Queries protocol,” Network Working Group, Apple, Inc., pp. 1-26 (Aug. 22, 2019). |
“Diameter and Diameter Applications,” Alcatel-Lucent, http://infodoc.alcatel-lucent.com/html/0_add-h-f/93-0098-HTML/7750_SR_OS_Triple_Play_Guide/GX-PolicyMgmt.html, pp. 1-40 (Aug. 22, 2019). |
Commonly-assigned, co-pending U.S. Appl. No. 16/527,988 for “Methods, Systems, and Computer Readable Media for Network Function (NF) Topology Synchronization,” (Unpublished, filed Jul. 31, 2019). |
“3rd Generation Partnership Project; Technical Specification Group Radio Access Network; NG-RAN; NG Application Protocol (NGAP) (Release 15),” 3GPP TS 38.413, V15.4.0, pp. 1-328 (Jul. 2019). |
“3rd Generation Partnership Project; Technical Specification Group Core Network and Terminals; 5G System; Network Function Repository Services; Stage 3 (Release 15),” 3GPP TS 29.510, V15.4.0, pp. 1-127 (Jun. 2019). |
“3rd Generation Partnership Project; Technical Specification Group Core Network and Terminals; 5G System; Restoration Procedures (Release 16),” 3GPP TS 23.527, V16.0.0, pp. 1-19 (Jun. 2019). |
“3rd Generation Partnership Project; Technical Specification Group Core Network and Terminals; Numbering, addressing and identification (Release 15),” 3GPP TS 23.003, V15.7.0, pp. 1-131 (Jun. 2019). |
“Class of Service Feature Guide (Routers and EX9200 Switches),” Junos® OS, Juniper Networks, pp. 1-1530 (Apr. 10, 2019). |
“3rd Generation Partnership Project; Technical Specification Group Services and System Aspects; System Architecture and 5G; Stage 2 (Release 16),” 3GPP TS 23.501, V16.0.0, pp. 1-318 (Mar. 2019). |
Penttinen, “5G Explained: Security and Deployment of Advanced Mobile Communications,” Chapter 6, Section 6.3.8 NRF, 2 pages (Feb. 2019). |
“Oracle Communications Diameter Signaling Router,” Release Notice, Release 8.3, E93179 Revision 02, Oracle, pp. 1-98 (Dec. 2018). |
“3rd Generation Partnership Project; Technical Specification Group Network and Terminals; 5G Systems; Network Function Repository Services; Stage 3 (Release 15),” 3GPP TS 29.510, V15.2.0, pp. 1-113 (Dec. 2018). |
“3rd Generation Partnership Project; Technical Specification Group Network and Terminals; 5G Systems; Principles and Guidelines for Services Definition; Stage 3 (Release 15),” 3GPP TS 29.501, V15.2.0, pp. 1-66 (Dec. 2018). |
“3rd Generation Partnership Project; Technical Specification Group Services and System Aspects; Study on Enhancements to the Service-Based Architecture (Release 16),” 3GPP TR 23.742, V16.0.0, pp. 1-131 (Dec. 2018). |
“Addressing 5G Network Function Requirements,” Intel® FPGAs and Intel PAC 5G QoS and IPSec Benchmarking, White Paper, pp. 1-8 (Oct. 2018). |
“5G; 5G System; Network function repository services; Stage 3 (3GPP TS 29.510 version 15.1.0 Release 15),” ETSI TS 129 510, V15.1.0, pp. 1-87 (Oct. 2018). |
“5G; 5G System; Unified Data Repository Services; Stage 3 (3GPP TS 29.504 version 15.1.0 Release 15),” ETSI TS 129 504, V15.1.0, pp. 1-26 (Oct. 2018). |
“CPS vDRA Configuration Guide,” Release 18.3.0 (Restricted Release)(1), Cisco, pp. 1-130 (Sep. 14, 2018). |
“How To Do Rate Limiting of Diameter Messages Using NetScaler,” Citrix Systems Inc., pp. 1-3 (Sep. 4, 2018). |
“5G; 5G System; Technical Realization of Service Based Architecture; Stage 3 (3GPP TS 29.500 version 15.0.0 Release 15),” ETSI TS 129 500, V15.0.0, pp. 1-29 (Jul. 2018). |
“Cisco Ultra 5G Packet Core Solution,” Cisco, White paper, https://www.cisco.com/c/dam/en/us/products/collateral/routers/network-convergence-system-500-series-routers/white-paper-c11-740360.pdf, pp. 1-11 (2018). |
Li et al., “Mobile Edge Computing Platform Deployment in 4G LTE Networks: A Middlebox Approach,” https://www.usenix.org/system/files/conference/hotedge18/hotedge18-papers-li.pdf, 6 pages (2018). |
Mayer, “RESTful APIs for the 5G Service Based Architecture,” Journal of ICT, vol. 6_1&2, pp. 101-116 (2018). |
“5G Service Based Architecture (SBA),” 5G, pp. 1-61 (downloaded Dec. 24, 2018). |
Brown et al., “Service-Based Architecture for 5G Core Networks,” Huawei, Heavy Reading, https://www.3g4g.co.uk/5G/5Gtech_6004_2017_11_Service-Based-Architecture-for-5G-Core-Networks_HR_Huawei.pdf, pp. 1-12 (Nov. 2017). |
“3rd Generation Partnership Project; Technical Specification Group Services and System Aspects; System Architecture for the 5G System; Stage 2 (Release 15),” 3GPP TS 23.501, V1.5.0, pp. 1-170 (Nov. 2017). |
Carlton et al., “HTTP and DNS in a 5G World,” https://www.computerworld.com/article/3204594/http-and-dns-in-a-5g-world.html, pp. 1-5 (Jun. 30, 2017). |
Benacer et al., “A High-Speed Traffic Manager Architecture for Flow-Based Networking,” pp. 1-4 (2017). |
“Dynamically Reconfigurable Optical-Wireless Backhaul/Fronthaul with Cognitive Control Plane for Small Cells and Cloud-RANs: D3.1 Analysis of state of the art on scalable control plane design and techniques for user mobility awareness. Definition of 5G-XHaul control plane requirements,” European Commission, 5G-XHaul, pp. 1-107 (Jun. 31, 2016). |
“3rd Generation Partnership Project; Technical Specification Group Core Network and Terminals; Domain Name System Procedures; Stage 3 (Release 13),” 3GPP TS 29.303 V13.4.0, pp. 1-69 (Jun. 2016). |
“Multi-Layer Security Protection for Signaling Networks,” Oracle Communications, Oracle white paper, pp. 1-9 (Jan. 2016). |
Kantola et al., “Policy-based communications for 5G mobile with customer edge switching,” Security and Communication Networks, vol. 9, pp. 3070-3082 (2016). |
Fielding et al. “Hypertext Transfer Protocol (HTTP/1.1): Semantics and Content”, Internet Engineering Taskforce (IETF) Request for Comments: 7231, IEFT RFC 7231, pp. 1-102 (Jun. 2014). |
Abley et al., “A Mechanism for Remote-Triggered DNS Cache Flushes (DNS Flush),” Network Working Group, Google, pp. 1-12 (Jun. 24, 2013). |
Preston-Werner, “Semantic Versioning 2.0.0”, Oracle, pp. 1-5 (Jun. 2013). |
“LTE and Beyond,” https://ytd2525.wordpress.com/2013/03/06/lte-and-beyond/, 3 pages (2013). |
Fajardo et al., “Diameter Based Protocol,” Internet Engineering Task Force (IETF) Request for Comments: 6733, pp. 1-152 (Oct. 2012). |
Gulbrandsen et al., “A DNS RR for specifying the location of services (DNS SRV),” RFC 2782, pp. 1-12 (Feb. 2000). |
Nichols et al., “Definition of the Differentiated Services Field (DS Field) in the IPv4 and IPv6 Headers,” Internet Engineering Task Force (IEFT) Netwok Working Group Request for Comments (RFC) 2474, The Internet Society, pp. 1-20 (Dec. 1998). |
Final Office Action for U.S. Appl. No. 16/945,794 (dated Feb. 8, 2022). |
Commonly-assigned, co-pending U.S. Appl. No. 17/356,461 for “Methods, Systems and Computer Readable Media for Optimizing Network Traffic Distribution using Timeslot-Based Tracked Producer Network Function (NF) Performance During Producer NF Selection” (Unpublished, filed Jun. 23, 2021). |
Commonly-assigned, co-pending U.S. Appl. No. 17/485,284 for “Methods, Systems and Computer Readable Media For Providing Priority Resolver for Resolving Priorities and Network Function (NF) Instances” (Unpublished, filed Sep. 24, 2021). |
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 16/356,446 (dated Sep. 30, 2021). |
Commonly-assigned, co-pending U.S. Appl. No. 17/487,142 for “Methods, Systems, and Computer Readable Media for Network Function Discovery Using Preferred-Locality Information” (Unpublished, filed Sep. 28, 2021). |
“3rd Generation Partnership Project; Technical Specification Group Core Network and Terminals; Numbering, addressing and identification; (Release 17),” 3GPP TS 23.003, V17.1.0, pp. 1-143 (Mar. 2021). |
“3rd Generation Partnership Project; Technical Specification Group Core Network and Terminals; 5G System; Session Management Services; Stage 3 (Release 17),” 3GPP 29.502, V17.1.0, pp. 1-299 (Jun. 2021). |
“3rd Generation Partnership Project; Technical Specification Group Core Network and Terminals; 5G System; Principles and Guidelines for Services Definition; Stage 3 (Release 17),” 3GPP TS 29.501, V17.2.0, pp. 1-78 (Jun. 2021). |
“3rd Generation Partnership Project; Technical Specification Group Services and System Aspects; Procedures for the 5G System (5GS); Stage 2 (Release 17),” 3GPP TS 23.502, V17.0.0, pp. 1-646. |
Vixie et al., “Dynamic Updates in the Domain Name System (DNS Update),” Network Working Group, RFC 2136, pp. 1-26 (Apr. 1997). |
Notice of Allowance for U.S. Appl. No. 17/156,149 (dated Apr. 19, 2022). |
Communication of European Publication Number and Information on the Applicatoin of Article 67(3) EPC for European Patent Application Serial No. 20732441.9 (dated Apr. 6, 2022). |
Non-Final Office Action for Chinese Patent Application Serial No. 201980067968.7 (dated Mar. 3, 2022). |
First Examination Report for Indian Patent Application Serial No. 202147011137 (dated Mar. 9, 2022). |
Commonly-assigned, co-pending U.S. Appl. No. 17/497,879 for “Methods, Systems, and Computer Readable Media for Routing Inter-Public Land Mobile Network (Inter-PLMN) Messages Related to Existing Subscriptions with Network Function (NF) Repository Function (NRF) Using Security Edge Protection Proxy (SEPP)” (Unpublished, filed Oct. 21, 2021). |
Commonly-assigned, co-pending U.S. Appl. No. 17/356,451 for “Methods, Systems, and Computer Readable Media for Resolution of Inter-Network Domain Names” (Unpublished, filed Jun. 23, 2021). |
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 16/697,021 (dated Jun. 21, 2021). |
Notice of Publication for International Application Serial No. PCT/US2020/061885 (dated Jun. 3, 2021). |
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 17/001,599 (dated May 17, 2021). |
Advisory Action for U.S. Appl. No. 16/697,021 (dated May 7, 2021). |
Applicant-Initiated Interview Summary for U.S. Appl. No. 17/001,599 (dated May 5, 2021). |
Commonly-assigned, co-pending U.S. Appl. No. 17/009,725 for “Methods, Systems, and Computer Readable Media for Service Communications Proxy (SCP)-Specific Prioritized Network Function (NF) Discovery and Routing,” (Unpublished, filed Sep. 1, 2020). |
Huawei, “eSBA: reselection of producer instance,” 3GPP TSG-SA2 Meeting #132, pp. 1-2 (Apr. 12, 2019). |
Docomo, “Update Solution 4 for implicit registration,” SA WG2 Meeting #129, pp. 1-2 (Oct. 15-19, 2018). |
“Implementing Quality of Service Policies with DSCP,” Cisco, pp. 1-7 (Feb. 15, 2008). |
Communication of European publication number and information on the application of Article 67(3) EPC for European Patent Application Serial No. 19791391.6 (dated Aug. 11, 2021). |
Decision for Refusal for Indian Patent Application Serial No. 7526/CHENP/2012 (dated Jul. 22, 2021). |
Number | Date | Country | |
---|---|---|---|
20220131945 A1 | Apr 2022 | US |