Method for designing demand-sensitive rings
First Claim
1. A method carried out in a computer for provisioning rings in a ring-based network having a given topology of nodes and logical links that interconnect said nodes, and a set of traffic demands that is desired for said network to carry, comprising the steps of:
- executing a process that identifies a set of feasible rings in said network, which is a subset of all possible rings in said network that satisfy a given constraint;
executing a process of identifying a routing for the traffic demands in said set of traffic demands, while aiming to minimize both a number of traffic demands that are not routed and an overall routing metric, where the routing metric is a cost measure that is associated with using one of said logical links in a routing path of a demand;
identifying a set of rings from among a set of feasible rings that minimizes a ring assignments cost measure that includes a cost associated with not covering routed demands with rings and a cost associated with using rings to cover demands; and
outputting the set of rings developed by said step of identifying for provisioning said nodes of said network.
1 Assignment
0 Petitions
Accused Products
Abstract
A method for provisioning a ring-based network is based on a routing of demands on shortest paths, according to a routing metric, and then assigning the routed demands to a collection of rings provisioned from a set of rings that meets preselected criteria, such as having less than a given number of nodes, and a mileage measure that is less than a given mileage upper threshold. The rings are provisioned to minimize a cost function that accounts for the cost of covering demands in rings, and the cost of failing to cover demands in rings. Further, an ordering of the traffic demands is determined that allows for routing as many traffic demands as possible.
35 Citations
10 Claims
-
1. A method carried out in a computer for provisioning rings in a ring-based network having a given topology of nodes and logical links that interconnect said nodes, and a set of traffic demands that is desired for said network to carry, comprising the steps of:
-
executing a process that identifies a set of feasible rings in said network, which is a subset of all possible rings in said network that satisfy a given constraint;
executing a process of identifying a routing for the traffic demands in said set of traffic demands, while aiming to minimize both a number of traffic demands that are not routed and an overall routing metric, where the routing metric is a cost measure that is associated with using one of said logical links in a routing path of a demand;
identifying a set of rings from among a set of feasible rings that minimizes a ring assignments cost measure that includes a cost associated with not covering routed demands with rings and a cost associated with using rings to cover demands; and
outputting the set of rings developed by said step of identifying for provisioning said nodes of said network. - View Dependent Claims (3, 4, 5, 6, 7, 8, 9, 10)
-
-
2. The method of claim 2 where said constraint requires a feasible ring to have not more than a given number of nodes, and have a mileage cost that is not more than a given mileage cost.
Specification