Optimizing path selection for multiple service classes in a network
First Claim
Patent Images
1. A method for routing traffic in a network, comprising:
- determining topology information for a network comprising a plurality of nodes and a plurality of links between the nodes;
determining a plurality of demands, each demand comprising a requested amount of traffic between a source node and a destination node for one of a plurality of service classes;
determining an objective function using the topology information and the demands; and
using the objective function, determining a solution that specifies a network path for each demand.
2 Assignments
0 Petitions
Accused Products
Abstract
A method for routing traffic in a network includes determining topology information for the network and determining traffic demands for multiple service classes. The method further includes determining an objective function for an optimization problem using the topology information and demands, and determining a solution to that specifies a network path for each demand.
-
Citations
22 Claims
-
1. A method for routing traffic in a network, comprising:
-
determining topology information for a network comprising a plurality of nodes and a plurality of links between the nodes;
determining a plurality of demands, each demand comprising a requested amount of traffic between a source node and a destination node for one of a plurality of service classes;
determining an objective function using the topology information and the demands; and
using the objective function, determining a solution that specifies a network path for each demand. - View Dependent Claims (2, 3, 4, 5, 6, 7)
-
-
8. A server, comprising:
-
a memory operable to store;
topology information of a network comprising a plurality of nodes and a plurality of links between the nodes; and
a plurality of demands, each demand associated with one of a plurality of service classes and each demand comprising a requested amount of traffic between a source node and a destination node; and
a processor operable to;
determine an objective function for an optimization problem using the topology information and the demands;
determine a solution to the optimization problem; and
using the solution, determine a network path for each demand that provides sufficient traffic capacity between the source node and the destination node for the requested amount of traffic. - View Dependent Claims (9, 10, 11, 12, 13, 14)
-
-
15. Logic embodied in a computer readable medium operable to perform the steps of:
-
determining topology information for a network comprising a plurality of nodes and a plurality of links between the nodes;
determining a plurality of demands, each demand comprising a requested amount of traffic between a source node and a destination node for one of a plurality of service classes;
determining an objective function using the topology information and the demands; and
using the objective function, determining a solution that specifies a network path for each demand. - View Dependent Claims (16, 17, 18, 19, 20, 21)
-
-
22. A method for routing traffic in a network, comprising:
-
determining topology information for a network comprising a plurality of nodes and a plurality of links between the nodes;
determining a plurality of demands, each demand comprising a request for bandwidth between a source node and a destination node for one of a plurality of service classes;
determining one or more constraints, each constraint comprising a limit on traffic of one of the service classes in the network;
determining an objective function representing the network, the demands, and the constraints;
minimizing the objective function to determine a solution, the solution comprising a network path for each demand; and
provisioning the network paths of the solution in the network.
-
Specification