This disclosure relates generally to policy requests, and, more particularly, to methods, apparatus and articles of manufacture to route policy requests.
In general, a policy represents and/or defines one or more rules that are applied to determine present and future decisions and/or actions. In communication networks and/or systems, policies represent and/or define rules that are applied to administer, manage and/or control access to communication resources.
Example methods, apparatus and articles of manufacture to route policy requests are disclosed. A disclosed example method includes receiving, at a policy request router, a policy request from a policy requestor, applying, at the policy request router, a rule to a parameter representing a network condition to select a policy server for the policy request, and sending from the policy request router to the policy requestor an identifier representing the policy server, the policy requestor to send the policy request to the policy server based on the identifier, the policy server to enforce a policy associated with the policy request.
A disclosed example policy request routing apparatus includes a communication module to receive a policy request from a policy requestor, and a decision engine to apply a rule to a value representing a network condition to select a policy server for the policy request, and send from the policy request router to the policy requestor an identifier representing the policy server, the policy requestor to send the policy request to the policy server based on the identifier, the policy server to enforce a policy associated with the policy request.
Another disclosed example method includes sending a policy request to a policy request router, receiving from the policy request router an identifier representing a policy server, and sending the policy request to the policy server based on the identifier, the policy server to enforce a policy associated with the policy request.
A disclosed example policy request apparatus includes a computer-readable storage medium to store a provisioned address of a policy request router, and a policy request routing module to send a policy request to the policy request router based on the provisioned address, receive from the policy request router an identifier representing a policy server, and send the policy request to the policy server based on the received identifier, the policy server to enforce a policy associated with the policy request.
In the illustrated example of
Example communication devices 105-107 include, but are not limited to, a wireless user endpoint (e.g., a smartphone), a session border controller (SBC), an application or service element (e.g., a server, a module, etc.), a gateway general packet radio service (GPRS) support node (GGSN), a broadband remote access server (BRAS), a digital subscriber line access multiplexer (DSLAM), a feature server, a call session control function server, a residential gateway (RG) and/or any other number and/or type(s) of home network and/or communication devices. A communication device 105-107 may be implemented as hardware or any combination of hardware, software and firmware.
In general, policy enforcers 118 are implemented at, in and/or by network elements that transport user data packets, signaling packets and/or control packets. Example policy enforcers 118 include, but are not limited to, an SBC, an application or service element (e.g., a server, a module, etc.), a GGSN, a BRAS, a DSLAM, a media gateway, a feature server and/or a call session control function server. In some examples, a policy enforcer 118 comprises a logical entity embodied as machine-accessible instructions and executing on one or more processors of, for example, a server, router, gateway, control, signaling or any other communication service providing device.
Example policy servers 115-117 include, but are not limited to, a policy and charging rules function (PCRF), a service policy decision function (S-PDF), a policy decision functional element (PD-FE), or any other centralized server and/or workstation, and/or distributed servers and/or workstations. In some examples, a policy server 115-117 comprises a policy decision function (PDF) or a policy decision point (PDP) implemented as a logical entity embodied as machine-accessible instructions and executing on one or more processors of, for example, a server, router, gateway or any other communication service providing device. As shown in
Traditionally, the policy server 115-117 to which a policy requestor 110 sends a particular type of policy request is statically provisioned, associated with and/or configured into the policy requestor 110 and/or into the device 105-107 associated with the policy requestor 110. However, as the size of communication networks grow and/or the number of policies to be applied increases, the static configuration/association or assignment of policy servers 115-117 becomes impractical. Moreover, the static configuration or assignment/association of policy requestors 110 to policy servers 115-117 does not accommodate changing network and/or policy server states and/or conditions including, for example, downtime during scheduled, unexpected maintenance and/or troubleshooting that may prevent a policy requestor 110 from being able to communicate with its assigned policy server(s) 115-117.
To overcome at least these problems, the example communication system 100 of
To allow the policy request router 130 to communicate with the example policy requestors 110, the example policy request router 130 of
The example routing engine 140 of
In some examples, the routing engine 140 implements multiple decision modes. For example, when available information is determinative, then the policy routing rules 145 are applied and result in the selection of a single target policy server 115-117. When available information is not fully determinative (e.g., the rules 145 result in the identification of multiple policy servers 115-117), the routing engine 140 selects the best target policy server 115-117 from the multiple identified policy servers 115-117. When available information is barely determinative (e.g., significant uncertainty in which policy server 115-117 to select), the routing engine 140 selects the best policy server 115-117 and notifies a management system (not shown).
Policy routing rules may be stored in, for example, a cache using any number and/or type(s) of data structure(s). The policy routing rules 145 may be implemented by any number and/or type(s) of volatile and/or non-volatile memory(-ies), memory device(s) and/or tangible computer-readable storage medium.
Rules stored in the example cache 145 of
In some examples, each of the policy servers 115-117 implement different policies, although any of the policy servers 115-117 may implement more than one policy. Accordingly, the example policy request router 130 of
In some examples, the routing engine 140 of
One or more parameters associated with the policy request (e.g., policy realm, policy domain, the policy requestor 110, etc.), the selected policy server 115-117 and the time period value (if applicable) are stored in a requestor cache 155. One or more parameters and/or values representing network state (e.g., which links are functional, which links are down, etc.), network condition (e.g., bandwidth used on each link), policy server states (e.g., operational, down, etc.) and/or policy server condition (e.g., load, memory usage, etc.) used to select a policy server 115-117 are stored in a state cache 160. Data may be stored in the example caches 155 and 160 using any number and/or type(s) of data structure(s). The example caches 155 and 160 may be implemented using any number and/or type(s) of volatile and/or non-volatile memory(-ies), memory device(s) and/or tangible computer-readable storage medium. In some examples, the communication module 135 periodically and/or aperiodically polls and/or queries the policy servers 115-117 and/or communication system devices (e.g., routers, switches, etc.) for their state and/or condition information and updates the state cache 160 accordingly.
In some examples, the routing engine 140 monitors the state cache 160 for a change in network and/or policy server state and/or condition. When a change is detected (e.g., a link failure, a policy server failure, etc.), the example routing engine 140 of
In some examples, the policy requestors 110 may contact the policy request router 130 for policy server 115 selections independent of and/or separately from a policy request. The routing engine 140 responds with a policy server 115-117 for each of a plurality of policy/policy realm/policy domain combinations. Additionally or alternatively, the example routing engine 140 provides to the policy requestors 110 a multicast address for each of the plurality of policy/policy realm/policy domain combinations. The policy server(s) 115-117 associated with each policy/policy realm/policy domain combination joins the associated multicast group using, for example, any past, present and/or future version of the Internet group management protocol (IGMP). When a policy requestor 110 has a policy request to send, it broadcasts the policy request to the multicast address associated with the policy request. Example methods to determine which policy server 115-117 handles the policy request and/or which response the policy requestor 110 considers is described in U.S. Publication No. 2009/0313372, entitled “Apparatus, Methods and Computer Program Products For Managing Network Elements and Associated Network Element Resources by Multiple Management Systems, filed Jun. 16, 2008. U.S. Publication No. 2009/0313372 is hereby incorporated by reference in its entirety.
While an example manner of implementing the example policy request router 130 and the example policy requestors 110 have been illustrated in
As used herein, the term tangible computer-readable medium is expressly defined to include any type of computer-readable medium and to expressly exclude propagating signals. Example computer-readable medium include, but are not limited to, a volatile and/or non-volatile memory, a volatile and/or non-volatile memory device, a compact disc (CD), a digital versatile disc (DVD), a floppy disk, a read-only memory (ROM), a random-access memory (RAM), a programmable ROM (PROM), an electronically-programmable ROM (EPROM), an electronically-erasable PROM (EEPROM), an optical storage disk, an optical storage device, magnetic storage disk, a magnetic storage device, a cache, and/or any other storage media in which information is stored for any duration (e.g., for extended time periods, permanently, brief instances, for temporarily buffering, and/or for caching of the information) and which can be accessed by a processor, a computer and/or other machine having a processor, such as the example processor platform P100 discussed below in connection with
The illustrated example of
The routing engine 140 applies one or more of the policy routing rules 145 to select a policy server 115-117 for the policy request 310 (block 315). An example process that may be carried out by the example routing engine 140 to select the policy server 115-117 is illustrated in
Returning to block 305, if the cache 215 contains a valid entry for the policy request 310 (block 305), the routing module 205 sends the policy request 310 to the policy server 115-117 without consulting the policy request router 130. Control then exits from the example process of
The illustrated example of
The example process of
The processor platform P100 of the instant example includes at least one programmable processor P105. The processor P105 executes coded instructions P110 and/or P112 present in main memory of the processor P105 (e.g., within a RAM P115 and/or a ROM P120). The processor P105 may be any type of processing unit, such as a processor core, a processor and/or a microcontroller. The processor P105 may execute, among other things, the example machine-accessible instructions of
The processor P105 is in communication with the main memory including a ROM P110 and the RAM P115 via a bus P125. The RAM P115 may be implemented by Synchronous Dynamic Random Access Memory (SDRAM), Dynamic Random Access Memory (DRAM), RAMBUS Dynamic Random Access Memory (RDRAM) and/or any other type of RAM device. The ROM P110 may be implemented by flash memory and/or any other desired type of memory device. Access to the memory P115 and the memory P120 may be controlled by a memory controller. The example memory P115 and P120 may be used to, for example, store the example caches 145, 155, 160 and 215 of
The processor platform P100 also includes an interface circuit P130. Any type of interface standard, such as an external memory interface, serial port, general-purpose input/output, as an Ethernet interface, a universal serial bus (USB), and/or a PCI express interface, etc, may implement the interface circuit P130.
One or more input devices P135 may be connected to the interface circuit P130. The input device(s) P135 may be used to, for example, permit a user to enter data and commands into the processor P105. The input device(s) P135 can be implemented by, for example, a keyboard, a mouse, a touchscreen, a track-pad, and/or a trackball.
One or more output devices P140 are also connected to the interface circuit 1020. The output devices P140 can be implemented, for example, by display devices (e.g., a liquid crystal display, a cathode ray tube display (CRT), and/or a printer). The interface circuit P130 may, thus, include a graphics driver card.
The interface circuit P130 may also includes one or more communication device(s) 145 such as a network interface card to facilitate exchange of data with external computers via a network. For example, the communication device(s) 145 may implement the example communication modules 135 of
In some examples, the processor platform P100 also includes one or more storage devices P150 to store software and data. Examples of such storage devices P150 include a floppy disk drive, a hard disk drive, a solid-state hard disk drive, a CD drive, a DVD drive and/or any other solid-state, magnetic and/or optical storage device. The example storage 150 may be used to, for example, store the example caches 145, 155, 160 and 215 of
Although certain example methods, apparatus and articles of manufacture have been described herein, the scope of coverage of this patent is not limited thereto. On the contrary, this patent covers all methods, apparatus and articles of manufacture fairly falling within the scope of the claims of this patent.
Number | Name | Date | Kind |
---|---|---|---|
5341477 | Pitkin et al. | Aug 1994 | A |
5751963 | Umetsu | May 1998 | A |
6157955 | Narad et al. | Dec 2000 | A |
6167445 | Gai et al. | Dec 2000 | A |
6170009 | Mandal et al. | Jan 2001 | B1 |
6411986 | Susai et al. | Jun 2002 | B1 |
6587466 | Bhattacharya et al. | Jul 2003 | B1 |
6678835 | Shah et al. | Jan 2004 | B1 |
6735701 | Jacobson | May 2004 | B1 |
6738908 | Bonn et al. | May 2004 | B1 |
6775280 | Ma et al. | Aug 2004 | B1 |
6820121 | Callis et al. | Nov 2004 | B1 |
6847609 | Sarnikowski et al. | Jan 2005 | B1 |
6944183 | Iyer et al. | Sep 2005 | B1 |
6954780 | Susai et al. | Oct 2005 | B2 |
7260060 | Abaye et al. | Aug 2007 | B1 |
7290028 | Brabson et al. | Oct 2007 | B2 |
7337465 | Kiyoto et al. | Feb 2008 | B2 |
7437441 | Drew et al. | Oct 2008 | B1 |
7552235 | Chase et al. | Jun 2009 | B2 |
7685279 | Miltonberger et al. | Mar 2010 | B2 |
7822871 | Stolorz et al. | Oct 2010 | B2 |
8042148 | Andreasen et al. | Oct 2011 | B2 |
8584226 | Kudla et al. | Nov 2013 | B2 |
8645517 | Stolorz et al. | Feb 2014 | B2 |
8665712 | Ramaswamy et al. | Mar 2014 | B2 |
20020046284 | Brabson et al. | Apr 2002 | A1 |
20020059428 | Susai et al. | May 2002 | A1 |
20020065922 | Shastri | May 2002 | A1 |
20020087657 | Hunt | Jul 2002 | A1 |
20020138551 | Erickson | Sep 2002 | A1 |
20020147822 | Susai et al. | Oct 2002 | A1 |
20030065762 | Stolorz et al. | Apr 2003 | A1 |
20030229501 | Copeland et al. | Dec 2003 | A1 |
20040039803 | Law | Feb 2004 | A1 |
20040073596 | Kloninger et al. | Apr 2004 | A1 |
20040181689 | Kiyoto et al. | Sep 2004 | A1 |
20050240990 | Trutner et al. | Oct 2005 | A1 |
20050289618 | Hardin | Dec 2005 | A1 |
20060010252 | Miltonberger et al. | Jan 2006 | A1 |
20060167975 | Chan et al. | Jul 2006 | A1 |
20060294575 | Rogers | Dec 2006 | A1 |
20070226775 | Andreasen et al. | Sep 2007 | A1 |
20070245409 | Harris et al. | Oct 2007 | A1 |
20080025261 | Riley | Jan 2008 | A1 |
20080070594 | Barber | Mar 2008 | A1 |
20080147866 | Stolorz et al. | Jun 2008 | A1 |
20080215718 | Stolorz et al. | Sep 2008 | A1 |
20080263180 | Hurst et al. | Oct 2008 | A1 |
20080276304 | Maffione et al. | Nov 2008 | A1 |
20090313372 | Streijl | Dec 2009 | A1 |
20100299451 | Yigang et al. | Nov 2010 | A1 |
20110058545 | Eriksson | Mar 2011 | A1 |
20110066718 | Susai et al. | Mar 2011 | A1 |
20110145386 | Stolorz et al. | Jun 2011 | A1 |
20110294518 | Siomina et al. | Dec 2011 | A1 |
20110314144 | Goodman | Dec 2011 | A1 |
20120084342 | Brown et al. | Apr 2012 | A1 |
20120151056 | Sporel et al. | Jun 2012 | A1 |
20130036215 | Kupinsky et al. | Feb 2013 | A1 |
20130086278 | Schmidt | Apr 2013 | A1 |
20130298206 | Brown et al. | Nov 2013 | A1 |
20130311549 | Abdulkadev et al. | Nov 2013 | A1 |
20140029420 | Jeong et al. | Jan 2014 | A1 |
Number | Date | Country | |
---|---|---|---|
20120110128 A1 | May 2012 | US |