TECHNIQUE FOR POLICY CONFLICT RESOLUTION USING PRIORITY WITH VARIANCE

• US 20100265825A1
• Filed: 06/28/2010
• Published: 10/21/2010
• Est. Priority Date: 05/09/2005
• Status: Active Grant

• Current Assignee: Cisco Technology, Inc. (Cisco Systems, Inc.)
• Original Assignee: Cisco Technology, Inc. (Cisco Systems, Inc.)
• Inventors: Lynn, Kerry, Blair, Dana
• Granted Patent: US 8,503,310 B2
• Time in Patent Office: Days
• US Class Current: 370/236
• CPC Class Codes: G01V 1/28 Processing seismic data, e.g. for interpretation or for event detection G01V1/48 takes precedence
• CPC Class Codes: H04L 41/00 Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
• CPC Class Codes: H04L 41/0213 Standardised network management protocols, e.g. simple network management protocol [SNMP]
• CPC Class Codes: H04L 41/0866 Checking the configuration
• CPC Class Codes: H04L 41/0894 Policy-based network configuration management
• CPC Class Codes: H04L 41/5009 Determining service level performance parameters or violations of service level contracts, e.g. violations of agreed response time or mean time between failures [MTBF]
• CPC Class Codes: H04L 43/026 using flow identification
• CPC Class Codes: H04L 43/0864 Round trip delays
• CPC Class Codes: H04L 45/00 Routing or path finding of packets in data switching networks routing or path finding in wireless networks H04W40/00
• CPC Class Codes: H04L 45/02 Topology update or discovery
• CPC Class Codes: H04L 45/04 Interdomain routing, e.g. hierarchical routing
• CPC Class Codes: H04L 45/12 Shortest path evaluation
• CPC Class Codes: H04L 45/123 Evaluation of link metrics techniques for monitoring network metrics H04L43/08
• CPC Class Codes: H04L 45/125 based on throughput or bandwidth
• CPC Class Codes: H04L 45/70 Routing based on monitoring results
• CPC Class Codes: H04L 47/122 by diverting traffic away from congested entities
• CPC Class Codes: H04L 47/125 by balancing the load, e.g. traffic engineering
• CPC Class Codes: H04L 65/1101 Session protocols

Abstract

In one embodiment, a value for a option for a particular policy of a plurality of policies that are ranked in a priority order is ascertained. A variance to the value associated with the option for the particular policy is applied to define a range of acceptable values for the particular policy. A determination is made whether one or more other options exist that have values within the range of acceptable values for the particular policy. If no other options exist that have values within the range of acceptable values for the particular policy, the option is selected If other options exist that have values within the range of acceptable values for the particular policy, the ascertaining, applying and determining is repeated for a next lower priority policy of the plurality of policies to consider the other options, the repeating to occur successively until an option is selected.

Claims

1. A method comprising:

ascertaining a value for a option for a particular policy of a plurality of policies that are ranked in a priority order;

applying, by a node in a computer network, a variance to the value associated with the option for the particular policy to define a range of acceptable values for the particular policy;

determining, by the node, whether one or more other options exist that have values within the range of acceptable values for the particular policy;

if no other options exist that have values within the range of acceptable values for the particular policy, selecting the option; and

if other options exist that have values within the range of acceptable values for the particular policy, repeating the ascertaining, applying and determining for a next lower priority policy of the plurality of policies to consider the other options, the repeating to occur successively until an option is selected.

2. The method of claim 1, wherein each option is a path in the computer network and the plurality of policies are rules regarding selection of a best path.

3. The method of claim 2, wherein each path is a path to a particular destination prefix.

4. The method of claim 2, wherein the plurality of policies include one or more policies selected from the group consisting of:

reachability, lowest round trip time, lowest packet loss, lowest cost, and lowest utilization.

5. The method of claim 1, further comprising:

if there is not another lower priority policy, selecting one of the other options as the selected option.

6. The method of claim 5, wherein selecting one of the other options as the selected option is by random selection.

7. The method of claim 1, further comprising:

assigning a separate respective variance to each policy of the plurality of policies.

8. The method of claim 1, further comprising:

assigning each of the plurality of policies a respective exclusive priority value to rank the plurality of policies in the priority order.

9. The method of claim 1, further comprising:

assigning the variance as a percentage value.

10. The method of claim 1, wherein the node in the computer network is an Optimized Edge Router in the computer network.

11. An apparatus comprising:

one or more network interfaces;

a processor coupled to the one or more network interfaces and configured to execute software processes; and

a memory configured store a decision making software process executable by the processor, the decision making software process configured to;

ascertain a value for an option for a particular policy of a plurality of policies that are ranked in a priority order,

apply a variance to the value associated with the option for the particular policy to define a range of acceptable values for the particular policy,

determine whether one or more other options exist that have values within the range of acceptable values for the particular policy,

if no other options exist that have values within the range of acceptable values for the particular policy, select the option, and

if other options exist that have values within the range of acceptable values for the particular policy, further execute the decision making software process for a next lower priority policy of the plurality of policies to consider the other options, the decision making software process to continue to be executed for successively next lower priority policies until an option is selected.

12. The apparatus of claim 11, wherein each option is a path in the computer network.

13. The apparatus of claim 12, wherein the plurality of policies are rules regarding selection of a best path.

14. The apparatus of claim 12, wherein the plurality of policies include one or more policies selected from the group consisting of:

reachability, lowest round trip time, lowest packet loss, lowest cost, and lowest utilization.

15. The apparatus of claim 11, wherein the decision making software process is further configured to:

if there is not another lower priority policy, select one of the other options as the selected option.

16. The apparatus of claim 15, wherein the selection of one of the other options as the selected option is by random selection.

17. The apparatus of claim 11, wherein each policy of the plurality of policies is assigned a separate respective variance.

18. The apparatus of claim 11, wherein the variance of at least one policy of the plurality of policies is a percentage value.

19. The apparatus of claim 11, wherein the apparatus is an Optimized Edge Router.

20. An apparatus comprising:

a processor;

means for ascertaining a value for a path that may be selected by a particular path selection policy of a plurality of path selection policies that are ranked in a priority order;

means for applying a variance to the value associated with the path for the particular path selection policy to define a range of acceptable values for the particular path selection policy;

means for determining whether other paths exist that have values within the range of acceptable values for the particular path selection policy;

means for selecting the path, if no other paths exist that have values within the range of acceptable values for the particular path selection policy; and

means for applying a next lower priority path selection policy of the plurality of path selection policies to consider the other paths, the means for applying to apply successive next lower priority path selection policies until a path is selected.