The subject matter described herein relates to identifying PCRF nodes in communications networks. More particularly, the subject matter described herein relates to PCRF node selection in a network with plural PCRFs and/or plural diameter relay agents (DRAs) or other nodes that perform PCRF node selection.
In communications networks, such as long term evolution (LTE) networks, the PCRF is the node that executes user policies that control aspects of a user's network services, such as authentication, authorization, bandwidth, other quality of service features, etc. A PCRF may obtain the policies for subscribers from another node referred to as a subscription profile repository (SPR), which may be co-located with a home subscriber server (HSS). The PCRF may communicate with a policy and charging enforcement function (PCEF), which enforces policies for subscriber terminals. When a user first communicates with a network, the user is assigned to a PCRF. Once a PCRF has been assigned, subsequent session related traffic for the user must be sent to the same PCRF because the PCRF stores policy state for the user. For example, the PCRF may store the volume of data accessed by the user while the user is attached to the network. The user's policy maintained by the PCRF may specify that the user's network access bandwidth is to be adjusted once the volume of accessed data reaches a threshold level. In order to manage such a policy, all traffic intended for the user during a particular network attachment must traverse the same PCRF.
More generally, when a node seeks to establish a session with the user, the node may contact the PCRF to request a particular level or quality of service for the session. The PCRF may execute the user's policy and respond to the request, indicating the quality of service that will be provided for the session. The PCRF may instruct the PCEF to enforce the policy as communicated to the requesting node.
Another function performed by the PCRF is charging. The PCRF may implement charging on a per packet flow basis. Packets matching filters of a particular policy rule are referred to as a service data flow (SDF). By identifying all packets associated with the same flow, the PCRF may charge for the flow in accordance with policy rules defined for the subscriber.
A DRA is responsible for routing or relaying Diameter signaling messages between Diameter nodes. In networks with very few Diameter nodes (such as PCRFs), there may be little need for a DRA. However, as the number of subscribers served by a network increases, it is necessary to scale the policy control functionality of the network and thus to add PCRFs and other Diameter nodes to the network. With plural PCRFs, it may be necessary to add plural DRAs to the network. While DRAs route Diameter signaling messages based on Diameter parameters, the base Diameter protocol specified in IETF RFC 3588 does not specify a methodology for selecting a PCRF in a network with plural PCRFs. As set forth above, there is a need to assign a PCRF to a user when the user first connects or attaches to the network and to ensure that subsequent session related traffic for the user is routed to the same PCRF. When there are plural DRAs and/or PCRFs in a network, optimally assigning subscribers to a PCRF and ensuring the proper routing of signaling after assignment has been made become important.
Accordingly, there exists a need for methods, systems, and computer readable media for PCRF node selection.
The subject matter described herein includes methods, systems, and computer readable media for PCRF node selection. According to one aspect, a system for PCRF node selection is provided. The system includes a first PCRF selection node for receiving a first request message for which PCRF node selection is required. The first PCRF selection node determines whether to select the PCRF or to delegate selection of the PCRF. In response to a determination to delegate selection of the PCRF, the first PCRF selection generates and sends a second request message related to the first request message. The system further includes a second PCRF node for, in response to receiving the second request message from the first PCRF selection node, determining whether to select the PCRF or to delegate selection of the PCRF. In response to determining to select the PCRF, the second PCRF selection node selects the PCRF.
As used herein, the term “node” refers to a physical entity, such as a computing platform having one or more processors, memory, and one or more network interfaces.
The subject matter described herein for PCRF node selection may be implemented using a non-transitory computer readable medium having stored thereon executable instructions that when executed by the processor of a computer control the computer to perform steps. Exemplary computer readable media suitable for implementing the subject matter described herein include 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 plural devices or computing platforms.
Preferred embodiments of the subject matter described herein will now be described with reference to the accompanying drawings of which:
Methods, systems, and computer readable media for PCRF node selection are provided.
The network illustrated in
P-CSCFs 114 and 116 perform proxy call session control functions for subscriber terminals and communicate with PCRF selection nodes 100, 102, and 103 via Rx interfaces. The P-CSCF is the key element in an IMS network in that the P-CSCF handles signaling for voice over IP (VoIP) calls. One function that must be performed by each P-CSCF in establishing a VoIP call is to obtain authorization from a PCRF to connect the call. Rather than having every P-CSCF programmed to select a PCRF for a given call, the subject matter described herein allows the P-CSCF to offload the functionality of selecting a PCRF for a particular call to PCRF selection nodes 100, 102, and 103.
According to one embodiment of the subject matter described herein, a PCRF selection node may select a PCRF based on a subscriber identifier, such as an international mobile station identifier (IMSI). The IMSI-based approach is a static approach in that the same IMSI will always hash to the same PCRF. In this embodiment, it is assumed that the P-CSCFs 114 and 116 can provide a subscriber's IMSI over the Rx interfaces and that PGW/HSGWs 110 and 112 provide the IMSI over the Gx and Gxx interfaces so the same user identity will be used across all policy and charging control (PCC) client interfaces (Gx, Gxx, and Rx). Each PCRF selection node 100, 102, and 103 may be configured with the same IMSI hashing function to determine which PCRF selection node is performing the actual PCRF selection. The hashing algorithm used in selecting the PCRF selection node that performs PCRF selection may be a truncation algorithm where the last seven digits of the IMSI are truncated, leaving the first three digits. Using a truncation algorithm where predetermined digits of a subscriber or mobile station identifier are used to determine which node will perform the PCRF selection may allow delegation of PCRF node selection on a geographic basis. For example, subscribers within a particular geographic region may have IMSIs with the same first three digits. As a result, PCRF selection for these nodes may be performed by a PCRF selection node/DRA that serves that particular geographic region. The subject matter described herein is not limited to performing PCRF node selection based on the IMSI. Any subscriber identifier that appears on the Gx, Gxx, and Rx interfaces may be used. In alternate implementation, the subscriber's telephone number can be used.
During session establishment over the Gx, Gxx, or Rx interface, a PCRF selection node receiving an establishment request, will, based on the IMSI in the request and the hash algorithm, either process the request and identify the PCRF to which the request should be routed or delegate the PCRF selection function to another PCRF selection node responsible for the IMSI.
If the PCRF selection node that receives a request determines that it is responsible for PCRF selection based on hashing of the IMSI, the PCRF selection node will, in response to the signaling over the Gx or Gxx interface, whichever occurs first, select a PCRF in its region based on any suitable algorithm, such as a load balancing or node availability algorithm. The subject matter described herein is not limited to performing PCRF node selection using a load balancing or node availability algorithm. In an alternate implementation, a subscriber or mobile station identifier, such as the IMSI, can also be used to select a PCRF. For example, if the first three digits of the IMSI are used to select a PCRF selection node, some or all of the remaining digits of the IMSI may be used by the PCRF selection node to select the PCRF. The PCRF selection node may also maintain local state about the selected PCRF so that selection may only be required to occur once per attachment.
Once a PCRF selection node has selected a PCRF, subsequent session establishment requests will be routed to the assigned PCRF selection node based on the IMSI. The requests will then be routed by the assigned PCRF selection node to the selected PCRF based on the PCRF selection state maintained by the assigned PCRF selection node.
Session updates and terminations may be delivered to the assigned PCRF based on a combination of destination-realm and destination-host as per RFC 3588. The destination-host or destination-realm parameter in a message may contain the identity of the PCRF handling the session. If the destination-host or destination-realm parameter in a message contains Diameter routing information that allows a node to identify the PCRF assigned to a subscriber, these parameters may be used to route the message to the proper PCRF. Upon detachment (i.e., when all Gx and Gxx sessions for the subscriber are terminated), the PCRF selection node may remove local state about the selected PCRF.
Once attachment occurs, HSGW 110A needs to establish a Gxx session with a local PCRF. However, rather than contacting a PCRF directly, HSGW 110A signals PCRF selection node 100, which may be implemented by a DRA local to HSGW 110A. In line 2, PCRF selection node 100 performs a hash algorithm on the IMSI in the CCR message, determines that PCRF selection node 100 should be the node that selects the PCRF, and selects PCRF 1041, based on any suitable criteria, such as load balancing, node availability, and/or the IMSI. Accordingly, in line 3, PCRF selection node 100 sends a Gxx CCR message to PCRF 1041. In line 4, PCRF 1041 queries home subscriber server (HSS) 200 to obtain the subscriber's policy. In line 5, PCRF 1041 sends a credit control answer (CCA) message to PCRF selection node 100. In line 6, PCRF selection node 100 sends a Gx CCA message to HSGW 110A.
In line 7, packet gateway (PGW) 110B sends a CCR message over the Gx interface to PCRF selection node 100. PGW 110B may generate the CCR message to establish a Gx session for the subscriber with the assigned PCRF. However, rather than communicating directly with the assigned PCRF, PGW 110B, which does not know which PCRF has been assigned, contacts its local DRA/PCRF selection node 100. In line 8, PCRF selection node 100 determines that PCRF 1041 has already been selected for the IMSI in the CCR message and, in line 9, sends a CCR message to the selected PCRF 1041. In line 10, PCRF 1041 sends a Gx CCA message to PCRF selection node 100. In line 11, PCRF selection node 100 sends a Gx CCA message to packet gateway 110B.
In line 10 of the message flow diagram, packet gateway 110B sends a CCR message to PCRF selection node 100 to initiate a Gx session for the subscriber. In line 11, PCRF selection node 100 performs the hash function based on the IMSI in the CCR message and determines that the CCR message should be routed to PCRF selection node 102. In line 12, PCRF selection node 100 sends a CCR message to PCRF selection node 102. In line 13, PCRF selection node 102 determines that PCRF 1061 has already been selected for the IMSI. Accordingly, in line 14, PORE selection node 102 sends a CCR message to the selected PCRF 1061. In line 15, PCRF 1061 sends a CCA message to PCRF selection node 102. In line 16, PCRF selection node 102 sends a CCA message to PCRF selection node 100. In line 17, PCRF selection node 100 sends a CCA message to packet gateway 110B.
According to another embodiment of the subject matter described herein, dynamic PCRF node selection is provided. According to dynamic PCRF selection, the node that performs PCRF node selection is determined based on dynamic criteria, such as load balancing and/or node availability, rather than based on static criteria, such as the IMSI. Once a PCRF selection node has been assigned and has selected a PCRF, the PCRF selection node may store its identity and/or the identity of the selected PCRF in a database node, such as an HSS. Other PCRF selection nodes can retrieve the selected PCRF information from the database node. According to this embodiment, during session establishment over the Gx, Gxx, or Rx interfaces, a PCRF selection node that receives a session establishment request will determine whether the receiving PCRF selection node or another PCRF selection node will be responsible for selecting the PCRF handling the session. In contrast to the static embodiment described above where the decision as to whether to select the PCRF locally or delegate the selection is based on static criteria, in this embodiment, the determination as to whether to perform such delegation may be based on dynamic criteria, such as load balancing and/or node availability. In such an embodiment, assignment of a PCRF selection node and/or a PCRF based on home or geographic indicators associated with a subscriber identifier may be avoided. Instead, the selection of a PCRF selection node to perform the PCRF node selection and selection of the corresponding PCRF may be done based on domains of responsibility that may be assigned by the network operator.
If a PCRF selection node that receives a session establishment request has already selected a PCRF for the user, it will route the request to the selected PCRF. Otherwise, it will query the HSS or other database to determine if a PCRF has already been selected. If the result of the query indicates that a PCRF has already been selected, the PCRF selection node will route the request to the PCRF via the PCRF's DRA/PCRF selection node. If a PCRF was not previously selected, the PCRF selection node will dynamically determine (e.g., using load balancing and/or node availability information) a PCRF selection node that will be responsible for PCRF selection and will route the request to that node. The request to the receiving PCRF selection node may include a token or parameter that indicates to the receiving PCRF selection node that it is the last node in a hierarchy of PCRF selection nodes and that the PCRF selection node should perform, rather than delegate, the PCRF selection. The PCRF selection node that receives the request will select the PCRF and write the HSS or other database its identity and optionally the identity of the selected PCRF. The PCRF selection node that performed the selection may store the identity of the selected PCRF locally to shield the HSS or other database from subsequent queries to determine the assigned PCRF.
As stated above, a PCRF selection node may perform PCRF selection within its domain of responsibility using a load balancing and/or node availability algorithm. The PCRF selection node may maintain local state about the local PCRF to minimize interaction with the HSS. Session updates and terminations may be delivered to the proper PCRF based on a combination of destination-realm and destination-host, as specified in RFC 3588. The destination-host parameter in a message may contain the identity of the PCRF handling this session. Upon detachment (i.e., when all Gx and Gxx session for subscriber are terminated) the PCRF selection node may delete the selected PCRF and/or DRA/PCRF selection node data in the HSS and remove the corresponding local state.
In line 4, PCRF selection node 100 determines that no PCRF has been selected, so PCRF selection node 100 dynamically determines that PCRF selection node 100 is the PCRF selection node responsible for selecting the PCRF and selects PCRF selection node 1041. As set forth above, the determination as to whether to perform PCRF selection locally may be based on dynamic criteria, such as load balancing and/or node availability. Other dynamic criteria that may be used may include PCRF selection delegation token in a message received from another DRA/PCRF selection node.
In line 5, PCRF selection node 100 sends a CCR message to the selected PCRF 1041 over the Gxx interface. In line 6, the selected PCRF 1041 queries HSS 200 to obtain a policy for the subscriber. In line 7, PCRF node 1041 sends a CCA message to PCRF selection node 100 over the Gxx interface. In line 8, PCRF selection node 100 writes the identifier of the selected PCRF for the user equipment to HSS 200. As set forth above, it may not be necessary for the identifier of selected PCRF to be written to the HSS. In an alternate implementation, only the identifier of the PCRF selection node/DRA that performs the selection may be written to the HSS. Since the PCRF selection node/DRA that performs the selection stores the PCRF selection state, subsequent queries to the HSS will yield the PCRF selection node/DRA, and the PCRF selection node/DRA will route the signaling to the proper PCRF. In line 9, PCRF selection node 100 sends a CCA message to HS gateway 110A. In line 10, packet gateway 110B sends a CCR message to PCRF selection node 100 to establish a Gx session for the UE. In line 11, PCRF selection node 100 determines whether a PCRF has already been selected by PCRF selection node 100 for the UE. Because PCRF 1041 has already been selected by PCRF selection node 100, in line 12, PCRF selection node 100 sends a CCR message to PCRF 1041 over the Gx interface. In line 13, PCRF 1041 sends a CCA message to PCRF selection node 100 over the Gx interface. In line 14, PCRF selection node 100 sends a Gx CCA message to packet gateway 110B.
Referring to
In line 13, PGW 110B sends a CCR message to PCRF selection node 100 to establish a Gx session for the UE. In line 14, PCRF selection node 100 determines whether a PCRF has already been selected for this session. In this example, PCRF selection node 100 does not know whether a PCRF has been selected, because PCRF selection node 100 did not perform the selection and store the selection state locally. Accordingly, PCRF selection node 100 sends a PCRF selection query to HSS 200. In line 16, PCRF selection node 100 determines, from the response from the HSS 200, that PCRF 1061 is selected and determines that the CCR message should be routed to PCRF 1061 via PCRF selection node 102. In line 17, PCRF selection node 100 sends a CCR message to PCRF selection node 102 via the Gx interface. In line 18, PCRF selection node 102 determines, using locally stored PCRF selection state, that PCRF 1061 has already been selected for the UE. Accordingly, in line 19, PCRF selection node 102 sends a CCR message to the selected PCRF 1061. In line 20, PCRF 1061 sends a CCA message to PCRF selection node 102 over the Gx interface. In line 21, PCRF selection node 102 sends a CCA message to PCRF selection node 100 over the Gx interface. In line 22, PCRF selection node 100 sends a CCA message to PGW 110B over the Gx interface.
Returning to step 1002, if the first PCRF selection node determines to delegate the PCRF selection, control proceeds to step 1006 where the first PCRF selection node sends a second request message related to the first request message to a second PCRF selection node. The second PCRF node may execute the same algorithm illustrated in
It will be understood that various details of the presently disclosed subject matter may be changed without departing from the scope of the presently disclosed subject matter. Furthermore, the foregoing description is for the purpose of illustration only, and not for the purpose of limitation.
This application claims the benefit of U.S. Provisional Patent Application Ser. No. 61/292,062, filed Jan. 4, 2010 and U.S. Provisional Patent Application Ser. No. 61/405,629, filed Oct. 21, 2010; the disclosure of each of which is incorporated herein by reference in its entirety.
Number | Name | Date | Kind |
---|---|---|---|
1872857 | Wesson et al. | Apr 1931 | A |
6298383 | Gutman et al. | Oct 2001 | B1 |
7292592 | Rune | Nov 2007 | B2 |
7551926 | Rune | Jun 2009 | B2 |
8015293 | Schaedler et al. | Sep 2011 | B2 |
20020147845 | Sanchez-Herrero | Oct 2002 | A1 |
20020194378 | Foti | Dec 2002 | A1 |
20020196775 | Tuohino et al. | Dec 2002 | A1 |
20030040280 | Koskelainen | Feb 2003 | A1 |
20030131151 | Roach et al. | Jul 2003 | A1 |
20040103157 | Requena et al. | May 2004 | A1 |
20040152469 | Yla-Outinen et al. | Aug 2004 | A1 |
20040205212 | Huotari et al. | Oct 2004 | A1 |
20040223489 | Rotsten et al. | Nov 2004 | A1 |
20040225878 | Costa-Requena et al. | Nov 2004 | A1 |
20040246965 | Westman et al. | Dec 2004 | A1 |
20050007984 | Shaheen et al. | Jan 2005 | A1 |
20050058125 | Mutikainen et al. | Mar 2005 | A1 |
20050078642 | Mayer et al. | Apr 2005 | A1 |
20050094594 | Roh | May 2005 | A1 |
20050124341 | Myllymaki et al. | Jun 2005 | A1 |
20050155036 | Tiainen et al. | Jul 2005 | A1 |
20050159156 | Bajko et al. | Jul 2005 | A1 |
20050235000 | Keil | Oct 2005 | A1 |
20060030320 | Tammi et al. | Feb 2006 | A1 |
20060045249 | Li et al. | Mar 2006 | A1 |
20060068816 | Pelaez et al. | Mar 2006 | A1 |
20060077926 | Rune | Apr 2006 | A1 |
20060078119 | Jee et al. | Apr 2006 | A1 |
20060136557 | Schaedler et al. | Jun 2006 | A1 |
20060161512 | Schaedler et al. | Jul 2006 | A1 |
20060172730 | Matsuda | Aug 2006 | A1 |
20060221972 | Bhargava et al. | Oct 2006 | A1 |
20060259759 | Maino et al. | Nov 2006 | A1 |
20060274744 | Nagai et al. | Dec 2006 | A1 |
20070121596 | Kurapati et al. | May 2007 | A1 |
20070242637 | Dynarski et al. | Oct 2007 | A1 |
20070297419 | Askerup et al. | Dec 2007 | A1 |
20080039104 | Gu et al. | Feb 2008 | A1 |
20090080440 | Balyan et al. | Mar 2009 | A1 |
20090129271 | Ramankutty et al. | May 2009 | A1 |
20090196231 | Giaretta et al. | Aug 2009 | A1 |
20090196290 | Zhao et al. | Aug 2009 | A1 |
20090232011 | Li et al. | Sep 2009 | A1 |
20090264097 | Cai et al. | Oct 2009 | A1 |
20090265467 | Peles | Oct 2009 | A1 |
20090305684 | Jones et al. | Dec 2009 | A1 |
20090313379 | Rydnell et al. | Dec 2009 | A1 |
20100290392 | Rasanen et al. | Nov 2010 | A1 |
20100291923 | Zhou et al. | Nov 2010 | A1 |
20100299451 | Yigang et al. | Nov 2010 | A1 |
20100311392 | Stenfelt et al. | Dec 2010 | A1 |
20100331023 | Cai et al. | Dec 2010 | A1 |
20110116378 | Ramankutty et al. | May 2011 | A1 |
20110116382 | McCann et al. | May 2011 | A1 |
20110199906 | Kanode et al. | Aug 2011 | A1 |
20110200053 | Kanode et al. | Aug 2011 | A1 |
20110202612 | Craig et al. | Aug 2011 | A1 |
20110202614 | Craig et al. | Aug 2011 | A1 |
20110202676 | Craig et al. | Aug 2011 | A1 |
20110225113 | Mann | Sep 2011 | A1 |
20110225280 | Delsesto et al. | Sep 2011 | A1 |
20110225306 | Delsesto et al. | Sep 2011 | A1 |
20110282904 | Schaedler et al. | Nov 2011 | A1 |
20110302244 | McCann et al. | Dec 2011 | A1 |
20110314178 | Kanode et al. | Dec 2011 | A1 |
20120096177 | Rasanen | Apr 2012 | A1 |
20120124220 | Zhou et al. | May 2012 | A1 |
20120155389 | McNamee et al. | Jun 2012 | A1 |
20120155470 | McNamee et al. | Jun 2012 | A1 |
20120202550 | Marsico | Aug 2012 | A1 |
20120224524 | Marsico | Sep 2012 | A1 |
20120224531 | Karuturi et al. | Sep 2012 | A1 |
20120225679 | McCann et al. | Sep 2012 | A1 |
20120226758 | Sprague et al. | Sep 2012 | A1 |
20120226814 | Stucker | Sep 2012 | A1 |
20120239771 | Rasanen | Sep 2012 | A1 |
20120311064 | Deo | Dec 2012 | A1 |
Number | Date | Country |
---|---|---|
1 357 720 | Oct 2003 | EP |
2 242 205 | Oct 2010 | EP |
2 220 841 | Sep 2011 | EP |
1 846 832 | Apr 2012 | EP |
WO 2006066149 | Jun 2006 | WO |
WO 2010139360 | Dec 2010 | WO |
WO 2011156274 | Dec 2011 | WO |
WO 2012106710 | Aug 2012 | WO |
WO 2012118959 | Sep 2012 | WO |
WO 2012118963 | Sep 2012 | WO |
WO 2012118967 | Sep 2012 | WO |
WO 2012119147 | Sep 2012 | WO |
WO 2012154674 | Nov 2012 | WO |
Entry |
---|
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 13/366,923 (Jan. 7, 2013). |
Non-Final Office Action for U.S. Appl. No. 13/192,410 (Dec. 20, 2012). |
Non-Final Office Action for U.S. Appl. No. 13/409,893 (Dec. 13, 2012). |
Commonly-assigned, co-pending U.S. Appl. No. 13/712,481 for “Methods, Systems, and Computer Readable Media for Encrypting Diameter Identification Information in a Communication Network,” (Unpublished,filed Dec. 12, 2012). |
Calhoun et al., “Diameter Base Protocol,”draft-ietf-aaa-diameter-07, Section 6.3, p. 68 (Jul. 2001). |
Final Office Action for U.S. Appl. No. 13/409,893 (Jul. 1, 2013). |
Non-Final Office Action for U.S. Appl. No. 12/409,914 (Jun. 7, 2013). |
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 13/412,352 (May 28, 2013). |
Non-Final Office Action for U.S. Appl. No. 13/366,928 (Mar. 26, 2013). |
Non-Final Office Action for U.S. Appl. No. 13/409,949 (Feb. 15, 2013). |
Rouse, “Platform,” http://searchservervirtualization.techtarget.com/definition/platform, pp. 1-2 (2006-2009). |
Notification of Transmital of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration for International Patent Application No. PCT/US2012/027281 (Jun. 15, 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/US2012/027263 (Jun. 14, 2012). |
Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration for International Patent Application No. PCT/US2012/027736 (Jun. 12, 2012). |
Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration for International Patent Application No. PCT/US2012/023971 (Jun. 11, 2012). |
Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration for International Patent Application No. PCT/US2012/027269 (Jun. 11, 2012). |
Commonly-assigned, co-pending International Application No. PCT/US12/27736 for “Methods, Systems, and Computer Readable Media for Enriching a Diameter Signaling Message,” (Unpublished, filed Mar. 5, 2012). |
Commonly-assigned, co-pending U.S. Appl. No. 13/412,352 titled “Methods, Systems, and Computer Readable Media for Enriching a Diameter Signaling Message,” (Unpublished, filed Mar. 5, 2012). |
Commonly-assigned, co-pending International Application No. PCT/US12/27281 for “Methods, Systems, and Computer Readable Media for Hybrid Session Based Diameter Routing,” (Unpublished, filed Mar. 1, 2012). |
Commonly-assigned, co-pending U.S. Appl. No. 13/409,949 titled “Methods, Systems, and Computer Readable Media for Hybrid Session Based Diameter Routing,” (Unpublished, filed Mar. 1, 2012). |
Commonly-assigned, co-pending International Application No. PCT/US12/27269 for “Methods, Systems, and Computer Readable Media for Dynamically Learning Diameter Binding Information,” (Unpublished, filed Mar. 1, 2012). |
Commonly-assigned, co-pending U.S. Appl. No. 13/409,914 titled “Methods, Systems, and Computer Readable Media for Dynamically Learning Diameter Binding Information,” (Unpublished, filed Mar. 1, 2012). |
Commonly-assigned, co-pending International Application No. PCT/US12/27263 for “Methods, Systems, and Computer Readable Media for Sharing Diameter Binding Data,” (Unpublished, filed Mar. 1, 2012). |
Commonly-assigned, co-pending U.S. Appl. No. 13/409,893 for “Methods, Systems, and Computer Readable Media for Sharing Diameter Binding Data,” (Unpublished, filed Mar. 1, 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/039285 (Feb. 9, 2012). |
Commonly-assigned, co-pending International Application No. PCT/US12/23971 for “Methods, Systems, and Computer Readable Media for Provisioning a Diameter Binding Repository,” (Unpublished, filed Feb. 6, 2012). |
Commonly-assigned, co-pending U.S. Appl. No. 13/366,928 titled “Methods, Systems, and Computer Readable Media for Provisioning a Diameter Binding Repository,” (Unpublished, filed Feb. 6, 2012). |
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/US2010/061934 (Oct. 25, 2011). |
“3rd Generation Partnership Project; Technical Specification Group Core Network and Terminals; Evolved Packet System (EPS); Mobility Management Entity (MME) and Serving GPRS Support Node (SGSN) related interfaces based on Diameter protocol (Release 10),” 3GPP TS 29.272, V10.2.0, pp. 1-95 (Mar. 2011). |
3GPP, “3rd Generation Partnership Project; Technical Specification Group Services and System Aspects; Policy and Charging Control Architecture (Release 11),” 3GPP TS 23.203 V11.0.1, pp. 1-137 (Jan. 2011). |
“Digital cellular telecommunications system (Phase 2+); Universal Mobile Telecommunications System (UMTS); LTE; IP Multimedia Subsystem (IMS); Stage 2 (3GPP TS 23.228 version 9.4.0 Release 9),” ETSI TS 123 228, V9.4.0 (Oct. 2010). |
“Digital cellular telecommunications system (Phase 2+); Universal Mobile Telecommunications System (UMTS); LTE; End-to-end Quality of Service (QoS) concept and architecture (3GPP TS 23.207 version 9.0.0 Release 9),” ETSI TS 123 207 V9.0.0 (Oct. 2010). |
“3rd Generation Partnership Project; Technical Specification Group Services and System Aspects; Telecommunication management; Charging management; Packet Switched (PS) domain charging (Release 9),” 3GPP TS 32.251, V9.4.0 (Oct. 2010). |
“3rd Generation Partnership Project; Technical Specification Group Services and System Aspects; Telecommunication management; Charging management; Diameter charging applications (Release 9),” 3GPP TS 32.299, V9.4.0 (Jun. 2010). |
“3rd Generation Partnership Project; Technical Specification Group Services and System Aspects; Telecommunication management; Charging management; Charging architecture and principles (Release 9),” 3GPP TS 32.240, V9.1.0 (Jun. 2010). |
Znaty, “Diameter, GPRS, (LTE + ePC = EPS), IMS, PCC and SDM,” EFORT, pp. 1-229 (Part 1 of 2) (May 2010). |
Znaty, “Diameter, GPRS, (LTE + ePC = EPS), IMS, PCC and SDM,” EFORT pp. 230-461 (Part 2 of 2) (May 2010). |
3GPP, “3rd Generation Partnership Project; Technical Specification Group Core Network and Terminals; Policy and Charging Control signalling flows and Quality of Service (QoS) parameter mapping (Release 9),” 3rd Generation Partnership Project, TS 29.213 V9.2.0, pp. 1-129 (Mar. 2010). |
Hakala et al., “Diameter Credit-Control Application,” RFC 4006, pp. 1-114 (Aug. 2005). |
Calhoun et al., “Diameter Network Access Server Application,” RFC 4005, pp. 1-85 (Aug. 2005). |
Calhoun et al., “Diameter Mobile IPv4 Application,” RFC 4004, pp. 1-53 (Aug. 2005). |
“IMS Security Framework,” 3GPP2 S.R0086-0, Version 1.0, pp. 1-39 (Dec. 11, 2003). |
“IP Multimedia Subsystem—Accounting Information Flows and Protocol,” 3GPP2 X.S0013-008-0, Version 1.0, pp. 1-42 (Dec. 2003). |
“IP Multimedia Subsystem—Charging Architecture,” 3GPP2 X.S0013-007-0, Version 1.0, pp. 1-16 (Dec. 2003). |
Olson et al., “Support for IPv6 in Session Description Protocol (SDP),” RFC 3266, pp. 1-5 (Jun. 2002). |
Non-Final Official Action for U.S. Appl. No. 12/409,914 (Nov. 6, 2012). |
Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration for International Patent Application No. PCT/US2012/036784 (Nov. 1, 2012). |
Non-Final Official Action for U.S. Appl. No. 13/412,352 (Oct. 26, 2012). |
Communication of European publication number and information on the application of Article 67(3) EPC for European Patent Application No. 10841605.8 (Oct. 17, 2012). |
Commonly-assigned, co-pending U.S. Appl. No. 13/465,552 for “Methods, Systems, and Computer Readable Media for Caching Call Session Control Function (CSCF) Data at the Diameter Signaling Router (DSR),” (Unpublished, filed May 7, 2012). |
PCT International Patent Application No. PCT/US2012/036784, Titled, “Methods, Systems, and Computer Readable Media for Steering a Subscriber Between Access Networks,” (Unpublished, Filed May 7, 2012). |
Decision to grant a European patent pursuant to Article 97(1) EPC for European Application No. 05854512.0 (Mar. 15, 2012). |
Communication under Rule 71(3) EPC for European application No. 05854512.0 (Nov. 11, 2011). |
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 11/303,757 (May 11, 2011). |
Official Action for U.S. Appl No. 11/303,757 (Dec. 22, 2010) |
3GPP, “3rd Generation Partnership Project; Technical Specification Group Core Networks and Terminals; Sh Interface based on the Diameter protocol; Protocol details (Release 8),” 3GPP TS 29.329, V8.8.0 (Dec. 2010). |
Communication pursuant to Article 94(3) EPC for European Application No. 05 854 512.0 (Oct. 12, 2010). |
Communication pursuant to Article 94(3) EPC for European Application No. 05854512.0 (Feb. 8, 2010) |
Final Official Action for U.S. Appl. No. 11/303,757 (Dec. 9, 2009). |
Supplementary European Search Report for European Application No. 05854512.0 (Nov. 17, 2009). |
Official Action for U.S. Appl. No. 11/303,757 (May 28, 2009). |
Final Official Action for U.S. Appl. No. 11/303,757 (Oct. 6, 2008). |
Official Action for U.S. Appl. No. 11/303,757 (May 7, 2008). |
Notification of Transmittal of the International Search Report and the Written Opinion corresponding to International Application No. PCT/US05/45813 (Mar. 24, 2008). |
Official Action for U.S. Appl. No. 11/303,757 (Feb. 21, 2008). |
Restriction Requirment for U.S. Appl. No. 11/303,757 (Oct. 4, 2007). |
“Tekelec Announces TekCore IMS Core Platform,” (Jun. 5, 2006). |
“Operator Guidebook to IMS and New Generation Networks and Services,” www.morianagroup.com, Second Edition (Feb. 2006). |
“Operator Guidebook to IMS and New Generation Networks and Services,” www.morianagroup.com, First Edition, pp. 1-450 (Aug. 2005) (Part 1 of 2). |
“Operator Guidebook to IMS and New Generation Networks and Services,” www.morianagroup.com, First Edition, pp. 451-934 (Aug. 2005) (Part 2 of 2). |
Gonzalo et al., “The 3G IP Multimedia Subsystem,” Chapter 3: General Principles of the IMS Architecture (Aug. 20, 2004). |
“IP Multimedia Subsystem IMS Over and Applications,” 3G Americas, pp. 1-17 (Jul. 2004). |
“3rd Generation Partnership Project; technical Specification Group Core Network; IP Multimedia (IM) Session Handling; IM Call Model; Stage 2 (Release 6),” 3GPP TS 23.218, V6.1.0, pp. 1-56 (Mar. 2004). |
“All-IP Core Network Multimedia Domain,” 3rd Generation Partnerships Project 2 (3GPP2), 3GPP2 X.S0013-000-0, Version 1.0, pp. i-ii and 1-14 (Dec. 2003). |
“3rd Generation Partnership Project; Technical Specification Group Core Network; Cx and Dx Interfaces Based on the Diameter Protocol; Protocol Details (Release 5),” 3GPP TS 29.229, V5.6.0, pp. 1-23 (Dec. 2003). |
“Digital Cellular Telecommunications System (Phase 2+); Universal Mobile Telecommunications System (UMTS); IP Multimedia Subsystem (IMS); Stage 2 (Release 5),” 3GPP TS 23.228, V5.7.0, pp. 1-130 (Dec. 2002). |
Rosenberg et al., “SIP: Session Initiation Protocol,” RFC 3261, pp. 1-252 (Jun. 2002). |
Howard, “Sipping IETF51 3GPP Security and Authentication,” http://www3.ietf.org/proceedings/01aug/slides/sipping-7/index.htm (Dowloaded from Internet on Dec. 16, 2005) (Sep. 13, 2001). |
Narten et al., “Privacy Extensions for Stateless Address Autoconfiguration in IPv6,” RFC 3041, pp. 1-16 (Jan. 2001). |
Faltstrom, “E.164 Number and DNS,” RFC 2916, pp. 1-10 (Sep. 2000). |
Vaha-Sipila, “URLs for Telephone Calls,” RFC 2806, pp. 1-20 (Apr. 2000). |
Aboba et al., “The Network Access Identifier,” RFC 2486, pp. 1-8 (Jan. 1999). |
Calhoun et al., “Diameter Proxy Server Extensions,” IETF Working Draft, draft-calhoun-diameter-proxy-01.txt (Aug. 1, 1998). |
Berners-Lee et al., “Uniform Resource Identifiers (URI): Generic Syntax,” RFC 2396, pp. 1-38 (Aug. 1998). |
Tekelec, “Eagle® Feature Guide,” P/N 910-1225-01 (Jan. 1998). |
Jalava, “Service Routing in 3GPP IP Multimedia Subsystem,” Nokia, pp. 1-16 (Publication Date Unknown). |
3GPP, “3rd Generation Parnership Project; Technical Specification Group Core Network and Terminals; Policy and Charging Control Over Gx Reference Point (Release 9),” 3GPP TS 29.212 V9.2.0, pp. 1-111 (Mar. 2010). |
Calhoun et al., “Diameter Base Protocol,” Network Working Group, RFC 3588, pp. 1-138 (Sep. 2003). |
Number | Date | Country | |
---|---|---|---|
20110165901 A1 | Jul 2011 | US |
Number | Date | Country | |
---|---|---|---|
61292062 | Jan 2010 | US | |
61405629 | Oct 2010 | US |