The subject matter described herein relates to detection of traffic relating to services. More particularly, the subject matter described herein relates to methods, systems, and computer readable media for enhanced service detection and policy rule determination.
In fixed and mobile communications networks, the ability to detect and act on traffic relating to specific services can be limited by the nodes that manage traffic relating to those services. For example, in mobile communications networks, the gateway GPRS support node (GGSN) may only be capable of detecting traffic of open systems interconnect (OSI) layer 4 and below and implementing policy rules based on those layers. Thus, the ability of such GGSN nodes to detect higher layer traffic, such as web application traffic, Skype traffic, YouTube traffic, or voice over IP traffic may be limited. As a result, a network operator may be unable to provision specific policies related to traffic of a particular application type.
Other GGSN nodes may be capable of detecting OSI layer 5 and higher traffic. However, there is no current mechanism for the GGSN to dynamically obtain a policy enforcement rule in response to detecting traffic relating to a specific application or service. Accordingly, there exists a need for methods, systems, and computer readable media for enhanced service detection and policy rule determination.
Methods, systems, and computer readable media for enhanced service detection and policy rule determination are disclosed. According to one method, a policy and charging rules function (PCRF) node requests, from a deep packet inspection (DPI) node notification of detection of traffic relating to a service. The DPI node identifies at least one traffic classifier usable to detect traffic corresponding to the service, uses the at least one traffic classifier to detect traffic corresponding to the service, and notifies the PCRF of the detection and of the at least one traffic classifier. The PCRF node receives the at least one traffic classifier, determines a policy rule based on the at least one traffic classifier, and communicates the policy rule to a policy enforcement node.
As used herein, the term “node” refers to a physical computing platform including one or more processors and memory.
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 exemplary implementation, the subject matter described herein can be implemented using a non-transitory computer readable medium having stored thereon computer 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 non-transitory computer-readable media, 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.
The subject matter described herein will now be explained with reference to the accompanying drawings of which:
Methods, systems, and computer readable media for enhanced service detection and policy rule determination are disclosed.
Network environment 100 may further include a carrier network 108. Carrier network 108 may include different types of nodes such as a bearer binding and event reporting function (BBERF) node and/or an application function (AF) node (not shown). An AF node may be, for example, an application server (AS), a multimedia resource function (MRF), or a proxy call session control function (P-CSCF).
Carrier network 108 may also include a PCRF node 110. PCRF node 110 is a centralized node that can act as a policy decision point for carrier network 108. PCRF node 110 may take operator defined service policies, subscription information pertaining to a user, and other data into account to build policy decisions. Policy decisions may be formulated as policy control and charging (PCC) rules. PCC rules may contain information about user plane traffic expressed as a packet classifier, or filter. For example, a packet classifier make take the form of an IP five-tuple specifying: (1) source IP address(es), (2) destination IP address(es), (3) source port number(s), (4) destination port number(s), and (5) application protocol(s) (e.g., transmission control protocol (TCP), user datagram protocol (UDP)). All IP packets matching a packet classifier of a PCC rule may be designated a service data flow (SDF) or service event.
According to an aspect of the subject matter described herein, PCRF node 110 may store identifiers for services without knowing the signatures or traffic classifiers for those services. For example, PCRF node 110 may be provisioned with the following service identifiers:
In Table 1, it can be seen that PCRF node 110 may store identifiers for services that are of OSI layer 5 and higher. However, PCRF node 110 may not be provisioned with the signatures, i.e., the traffic classifiers, for detecting traffic relating to such services.
Accordingly, deep packet inspection (DPI) node 112 may store a table that maps service identifiers, such as those illustrated in Table 1, to traffic classifiers or signatures relating to such services. Table 2 shown below illustrates exemplary traffic classifier data that may be stored and/or dynamically determined by DPI node 112.
As can be seen from Table 2 above, DPI node 112 may determine and/or store mappings between service identifiers that are used by PCRF node 110 and the corresponding traffic classifiers that may be used to detect such traffic and to generate policy rules based on such traffic that are enforceable by a policy enforcement node, such as policy charging and enforcement function (PCEF) node 114 illustrated in
In Table 2, the traffic classifiers for the service identifier “VoIP” may be determined dynamically by DPI node 112 through analysis of SDP signaling used to set up a VoIP call involving a specific user. The traffic classifier for the service identifier “YouTube” is the URL for YouTube, which may be a static traffic classifier stored by DPI node 112. The traffic classifiers for the service identifier “Skype” may include the dynamically changing endpoint IP addresses and ports that are associated with the Skype call. Because the IP addresses and ports change during a Skype call, DPI node 112 may continually update its traffic classifiers to detect the traffic and to communicate updated traffic classifiers to PCRF node 110.
PCRF node 110 can instruct DPI node 112 to notify PCRF node 110 when DPI node 112 detects traffic relating to a specific service type. DPI node 112 would then use its stored or dynamically determined traffic classifiers to detect traffic relating to the specific service type. Once DPI node 112 detects traffic relating to the service type, DPI node 112 may communicate an indication that the traffic has been detected and traffic classifiers corresponding to the traffic to PCRF node 110. Upon receiving the notification and the traffic classifiers, PCRF node 110 can dynamically formulate a rule for that service using the traffic classifiers and communicate the rule to PCEF node 114. PCEF node 114 can then enforce policies specific to service type. For example, PCEF node 114 may enforce policies based on the website that a user accesses in Internet 118 to provide different bandwidths for different websites.
Also illustrated in
PCEF node 114 may be a GGSN or other node that controls user access in a particular geographic area. In response to receiving the IP CAN request message, PCEF node 114 sends a Diameter credit control request (CCR)-I (initial) message to PCRF node 110. The purpose of the CCR-I message is to determine whether to allow the user to access the network and the policy to be applied to the user.
In step 2, in response to receiving the CCR-I message, PCRF node 110 queries SPR 120 to determine the policies to be applied to the subscriber. In step 3, the PCRF node 110 sends a Diameter credit control answer (CCA)-I message to PCEF node 114 approving the subscriber's attachment to the network and communicating the policies to apply to the subscriber. In step 4, PCEF node 114 notifies UE 104 that the IP CAN session can be established.
DPI node 112 may monitor traffic between the access network and domain, such as the Internet. When DPI node 112 detects traffic from a new IP address, this may trigger DPI node 112 to notify PCRF node 110 of the detection and to request further instructions. Accordingly, in step 5, it is assumed that DPI node 112 has detected traffic with a new IP address, and, in response, DPI node 112 sends a Diameter CCR-I message to PCRF node 110 notifying PCRF node 110 of the traffic. PCRF node 110 may not know the specific service to which the traffic relates, but may request information from DPI node 112 regarding the specific service. Accordingly, PCRF node 110 sends a CCA-I message to DPI node 112 requesting that DPI node 112 notify PCRF node 110 about traffic relating to a specific service and requesting classifiers for that service if such classifiers are available. In one example, PCRF node 110 may request notification of voice over IP traffic concerning a specific user.
Upon receiving the request, DPI node 112 may map the service identifier in the request to traffic classifiers usable to detect traffic corresponding to the service using data such as that illustrated above in Table 2 and monitor traffic on the access network using the identified traffic classifiers. When DPI node 112 detects traffic matching the traffic classifiers, DPI node 112 may communicate this fact along with the traffic classifiers to PCRF node 110, as illustrated by the Diameter CCR-U (update) message in step 6. If the service is voice over IP service, the traffic classifiers may be the endpoint IP addresses and port numbers. Such classifiers can be determined from the session description protocol (SDP) signaling communicated over the access network and monitored by DPI node 112. Thus, in such a case, DPI node 112 takes a layer 5 or higher service identifier (e.g., “VoIP”) and maps that service identifier to layer 3 and 4 traffic classifiers (e.g., the endpoint IP addresses and port numbers) that are communicated to PCRF node 110.
In another example, PCRF node 110 may request notification of traffic relating to a specific website, such as YouTube. DPI node 112 may map the service identifier “YouTube” to the IP address and port number or the URL used by UE 104 to contact the website. PCRF node 110, upon receiving the notification that the traffic has been detected and the classifiers, may dynamically formulate a policy rule based on the classifiers and may communicate the policy rule to PCEF node 114, as illustrated by the Diameter re-authentication request (RAR) message in step 7. The policy rule may be specific to the detected service. For example, the user may be granted a guaranteed bandwidth of 3 Mbps for the duration of the voice over IP call. In another example, the user may be granted free uploads or downloads up to a predetermined volume of traffic and then be required to pay for additional uploads or downloads once the amount of traffic relating to the specific service exceeds the volume threshold. PCEF node 114 installs the rule and may upgrade or downgrade the user's service based on the policy rule. In the illustrated example, the user traffic receives an upgrade from the previously provided quality of service based on the identity of the service.
In step 302, the DPI node receives the request, identifies at least one traffic classifier usable to detect traffic corresponding to the service, uses the at least one traffic classifier to detect traffic corresponding to the service and notifies the PCRF node of the detection and of the at least one traffic classifiers. For example, DPI node 112 may map the service identifier received from PCRF node 110 into a signature to the traffic. The signature may include IP addresses and port numbers, URLs, or other signature. The signature may be dynamically determined through analysis of signaling messages relating to the service or statically determined using data stored by DPI node 112. DPI node 112 may use the signature to detect traffic relating to a service and to communicate an indication of the notification and at least some of the traffic classifiers to PCRF node 110.
In step 304, at the PCRF node, a policy rule specific to the service is determined and communicated to a policy enforcement node. For example, PCRF node 110 may dynamically formulate a policy rule specific to the detected service and communicate the policy rule to PCEF node 114. PCEF node 114 may then enhance, downgrade, or perform another action related to traffic for the particular service based on the policy rule received from PCRF node 110.
In the examples described above, DPI node 112 is shown as being separate from PCEF node 114. However, the subject matter described herein is not limited to having a DPI node that is separate from the PCEF node. In an alternate example, DPI node 112 may be integrated with PCEF node 114. In one exemplary configuration, PCEF node 114 may be a GGSN with an integrated DPI. In addition, the subject matter described herein is not limited to GGSNs that are not layer 5 and higher aware. The subject matter described herein can be used to provide enhanced service detection and policy rule determination can be implemented in combination with a GGSN or other policy rule enforcement node that is capable of analyzing data at any one or more of OSI layers 1-7.
It will be understood that various details of the subject matter described herein may be changed without departing from the scope of the subject matter described herein. Furthermore, the foregoing description is for the purpose of illustration only, and not for the purpose of limitation, as the subject matter described herein is defined by the claims as set forth hereinafter.
This application claims the benefit of U.S. Provisional Patent Application Ser. No. 61/310,872, filed Mar. 5, 2010; the disclosure of which is incorporated herein by reference in its entirety.
Number | Name | Date | Kind |
---|---|---|---|
6141686 | Jackowski et al. | Oct 2000 | A |
6651101 | Gai et al. | Nov 2003 | B1 |
6661780 | Li | Dec 2003 | B2 |
6880005 | Bell et al. | Apr 2005 | B1 |
7209962 | Boden | Apr 2007 | B2 |
7289498 | Yu et al. | Oct 2007 | B2 |
7581249 | Bussiere et al. | Aug 2009 | B2 |
7719966 | Luft et al. | May 2010 | B2 |
7940683 | Dolganow et al. | May 2011 | B2 |
8146133 | Moon et al. | Mar 2012 | B2 |
8159941 | Dolganow et al. | Apr 2012 | B2 |
8250646 | Zheng | Aug 2012 | B2 |
20020143914 | Cihula | Oct 2002 | A1 |
20030208523 | Gopalan et al. | Nov 2003 | A1 |
20040111519 | Fu et al. | Jun 2004 | A1 |
20050088977 | Roch et al. | Apr 2005 | A1 |
20060013191 | Kavanagh | Jan 2006 | A1 |
20060233101 | Luft et al. | Oct 2006 | A1 |
20070004393 | Forsberg et al. | Jan 2007 | A1 |
20070066286 | Hurtta | Mar 2007 | A1 |
20070159976 | Dekeyzer et al. | Jul 2007 | A1 |
20070220251 | Rosenberg et al. | Sep 2007 | A1 |
20070242692 | Limb et al. | Oct 2007 | A1 |
20070286117 | Balasubramanian et al. | Dec 2007 | A1 |
20080046963 | Grayson et al. | Feb 2008 | A1 |
20080076388 | Nochimowski et al. | Mar 2008 | A1 |
20080137541 | Agarwal et al. | Jun 2008 | A1 |
20080201772 | Mondaeev et al. | Aug 2008 | A1 |
20080232376 | Huang et al. | Sep 2008 | A1 |
20080276305 | Chan et al. | Nov 2008 | A1 |
20080313708 | Khan et al. | Dec 2008 | A1 |
20090089418 | Saha et al. | Apr 2009 | A1 |
20090177650 | Petersson et al. | Jul 2009 | A1 |
20090196225 | Avila Gonzalez et al. | Aug 2009 | A1 |
20090227231 | Hu et al. | Sep 2009 | A1 |
20090228956 | He et al. | Sep 2009 | A1 |
20090285225 | Dahod | Nov 2009 | A1 |
20090307028 | Eldon et al. | Dec 2009 | A1 |
20090323536 | Liu et al. | Dec 2009 | A1 |
20100040047 | Zamora et al. | Feb 2010 | A1 |
20100121960 | Baniel et al. | May 2010 | A1 |
20100185488 | Hogan et al. | Jul 2010 | A1 |
20100235877 | Hu et al. | Sep 2010 | A1 |
20110022702 | Riley et al. | Jan 2011 | A1 |
20110041182 | Stenfelt | Feb 2011 | A1 |
20110167471 | Riley et al. | Jul 2011 | A1 |
20110170412 | Ramadas et al. | Jul 2011 | A1 |
20110202653 | Riley et al. | Aug 2011 | A1 |
20110225280 | Delsesto et al. | Sep 2011 | A1 |
20110225306 | Delsesto et al. | Sep 2011 | A1 |
20110225309 | Riley et al. | Sep 2011 | A1 |
20120084425 | Riley et al. | Apr 2012 | A1 |
20120131165 | Baniel et al. | May 2012 | A1 |
Number | Date | Country |
---|---|---|
2 045 974 | Apr 2009 | EP |
10-2006-0028042 | Mar 2006 | KR |
10-2009-0027861 | Mar 2009 | KR |
WO 2008000287 | Jan 2008 | WO |
WO 2008114217 | Sep 2008 | WO |
WO 2009149341 | Dec 2009 | WO |
WO 2010086013 | Aug 2010 | WO |
WO 2011011790 | Jan 2011 | WO |
WO 2011082036 | Jul 2011 | WO |
WO 2011100684 | Aug 2011 | WO |
WO 2011115991 | Sep 2011 | WO |
Entry |
---|
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/027427 (Nov. 15, 2011). |
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/028520 (Oct. 31, 2011). |
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/024753 (Oct. 28, 2011). |
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/US2010/061589 (Sep. 26, 2011). |
Commonly-assigned, co-pending U.S. Appl. No. 13/225,390 for “Method and System for Providing Mobility Management in Network”, (Unpublished, filed on Sep. 2, 2011). |
Non-Final Official Action for U.S. Appl. No. 12/621,190 (Aug. 3, 2011). |
Non-Final Official Action for U.S. Appl. No. 12/479,179 (Aug. 2, 2011). |
Commonly-assigned, co-pending U.S. Appl. No. 13/157,052 for “Methods, Systems, and Computer Readable Media For Providing Nested Policy Configuration in a Communications Network”, (Unpublished, filed on Jun. 9, 2011). |
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/US2010/043258 (Feb. 28, 2011). |
Restriction Requirement for U.S. Appl. No. 12/479,179 (Feb. 8, 2011). |
“3rd Generation Partnership Project; Technical Specification Group Core Network and Terminals; Policy and Charging Control over Rx reference point (Release 9),” 3GPP TS 29.214, V9.3.0, pp. 1-45 (Mar. 2010). |
“Universal Mobile Telecommunications System (UMTS); LTE; Policy and charging control over Rx reference point (3GPP TS 29.214 version 9.2.0 Release 9),” ETSI TS 129 214, V9.2.0 (Jan. 2010). |
“Universal Mobile Telecommunications System (UMTS); LTE; Policy and charging control over Gx reference point (3GPP TS 29.212 version 9.1.0 Release 9),” ETSI TS 129 212, V9.1.0 (Jan. 2010). |
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/US2009/046395 (Dec. 28, 2009). |
3rd Generation Partnership Project, Technical Specification Group Core Network and Terminals; Policy and Charging Control Over Gx reference point (Release 9), 3GPP TS 29.212, V9.1.0, pp. 1-106 (Dec. 2009). |
“Chapter 1: Overview of GPRS and UMTS,” Cisco GGSN release 9.0 Configuration Guide, Cisco IOS Release 12.4(22)YE, pp. 1-1-1-16 (Aug. 4, 2009). |
“Introduction to Diameter,” Wikipedia, pp. 1-12 (Downloaded from the Internet on May 15, 2009). |
“Diameter Credit-Control Application,” Wikipedia, pp. 1-7 (Downloaded from the Internet on May 13, 2009). |
“Diameter (Protocol),” Wikipedia, pp. 1-8 (Downloaded from the Internet on May 13, 2009). |
“File: GPRS Core Structure.phg,” Wikipedia, pp. 1-3 (Downloaded from the Internet on May 13, 2009). |
“GPRS Core Network,” Wikipedia, pp. 1-6 (Downloaded from the Internet on May 13, 2009). |
“GPRS Network Architecture,” DenMasBroto, pp. 1-2 (Downloaded from the Internet on May 13, 2009) (May 28, 2008). |
Agilent Technologies, “Understanding DSLAM and BRAS Access Devices,” White Paper, pp. 1-15 (2006). |
Hakala et al., “Diameter Credit-Control Application,” Network Working Group RFC 4006, pp. 1-114 (Aug. 2005). |
Zhou et al., “Prophet Address Allocation for Large Scale MANETs,” Ad Hoc Networks, vol. 1, Issue 4, pp. 423-434 (Nov. 2003). |
Calhoun et al., “Diameter Base Protocol,” RFC 3588, pp. 1-147 (Sep. 2003). |
Ponnappan et al., “A Policy Based QoS Management System for the IntServ/DiffServ Based Internet,” Policies for Distributed Systems and Networks, pp. 159-168 (2002). |
“GPRS Tutorial,” MorganDoyle Limited, pp. 1-13 (Publication Date Unknown). |
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 13/225,390 (Oct. 9, 2012). |
Non-Final Official Action for U.S. Appl. No. 12/479,179 (Sep. 13, 2012). |
European Search Report for European Patent Application No. EP 09 75 9499 (Sep. 12, 2012). |
Non-Final Official Action for U.S. Appl. No. 12/973,186 (Aug. 24, 2012). |
Applicant-Initiated Interview Summary for U.S. Appl. No. 13/225,390 (Aug. 13, 2012). |
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 12/621,190 (May 29, 2012). |
Non-Final Official Action for U.S. Appl. No. 13/225,390 (May 14, 2012). |
Communication of European publication number and information on the application of Article 67(3) EPC for European Application No. 10803020.6 (May 4, 2012). |
Final Official Action for U.S. Appl. No. 12/479,179 (Apr. 10, 2012). |
Applicant-Initiated Interview Summary for U.S. Appl. No. 12/621,190 (Feb. 7, 2012). |
3rd Generation Partnership Project, “Technical Specification Group Core Network and Terminals; Policy and Charging Control over Gx Reference Point,” 3GPP TS 29.212, V8.0.0, Release 8 (May 2008). |
Number | Date | Country | |
---|---|---|---|
20110219426 A1 | Sep 2011 | US |
Number | Date | Country | |
---|---|---|---|
61310872 | Mar 2010 | US |