Claims
- 1. A method for determining a restoration path corresponding to a primary path for a new service in a mesh network having a plurality of nodes interconnected by a plurality of links, the method comprising:
generating a path cost for each of a plurality of candidate restoration paths associated with the new service; and selecting the restoration path for the new service based on the path cost for each candidate restoration path, wherein generating the path cost for a candidate restoration path comprises: determining, for each link Li of one or more links in the candidate restoration path, a set B-Li-set of links protected by link Li; determining, for each link Li, a set I-Li-set of links in the set B-Li-set that are also in the primary path; calculating, for each link Li, a link cost Cost_Li based on the set B-Li-set and the set I-Li-set; and calculating the path cost based on a sum of the one or more link costs Cost_Li.
- 2. The invention of claim 1, wherein the set I-Li-set is determined from an intersection of the set B-Li-set and a set P-set of links in the primary path.
- 3. The invention of claim 1, wherein, for link Li, the link cost Cost_Li is a function of whether or not the set B-Li-set is empty.
- 4. The invention of claim 3, wherein:
if the set B-Li-set is empty, then the link cost Cost_Li is based on bandwidth of the new service; and if the set B-Li-set is not empty, then the link cost Cost_Li is a function of whether or not the set I-Li-set is empty.
- 5. The invention of claim 4, wherein:
if the set I-Li-set is empty, then the link cost Cost_Li is based on a difference between the bandwidth of the new service and bandwidth currently reserved on the link Li; and if the set I-Li-set is not empty, then the link cost Cost_Li is based on a difference between (a) a sum of the bandwidth of the new service and maximum service bandwidth protected by link Li for all links in the set I-Li-set and (b) the bandwidth currently reserved on the link Li.
- 6. The invention of claim 4, wherein the path cost is set to a relatively high level if there is not enough capacity on the link Li to protect the new service.
- 7. The invention of claim 1, wherein the method is implemented for each of a plurality of candidate primary paths to generate a path cost associated with the candidate primary path and further comprising selecting one of the candidate primary paths for the new service based on minimum path cost.
- 8. The invention of claim 1, wherein the network is an open shortest path first (OSPF) network and restoration bandwidth information associated with each link in the candidate restoration path is transmitted between nodes using a data structure defined by OSPF with traffic engineering extensions (OSPF-TE) and OSPF opaque link-state advertisement option.
- 9. A network manager for a mesh network having a plurality of nodes interconnected by a plurality of links, the network manager adapted to determine a restoration path corresponding to a primary path for a new service in the mesh network, wherein:
the network manager is adapted to generate a path cost for each of a plurality of candidate restoration paths associated with the new service; and the network manager is adapted to select the restoration path for the new service based on the path cost for each candidate restoration path, wherein generating the path cost for a candidate restoration path comprises:
determining, for each link Li of one or more links in the candidate restoration path, a set B-Li-set of links protected by link Li; determining, for each link Li, a set I-Li-set of links in the set B-Li-set that are also in the primary path; calculating, for each link Li, a link cost Cost_Li based on the set B-Li-set and the set I-Li-set; and calculating the path cost based on a sum of the one or more link costs Cost_Li.
- 10. The invention of claim 9, wherein the network manager is distributed over the network.
- 11. The invention of claim 9, wherein the network manager is located at a single node of the network.
CROSS-REFERENCE TO RELATED APPLICATIONS
[0001] This application claims the benefit of the filing date of U.S. provisional application No. 60/459,163, filed on Mar. 31, 2003. The subject matter of this application is related to U.S. patent application Ser. No. 10/639,728, filed on Aug. 12, 2003 as attorney docket no. Dziong 8-25-16-32, the teachings of which are incorporated herein by reference.
[0002] This application is one of a set of U.S. patent applications consisting of Ser. No. 10/______ filed as attorney docket no. Doshi 56-5-21-17-33, Ser. No. 10/______ filed as attorney docket no. Doshi 57-6-22-18-34, Ser. No. 10/______ filed as attorney docket no. Doshi 55-7-23-15-35, Ser. No. 10/______ filed as attorney docket no. Dziong 9-1, and Ser. No. 10/______ filed as attorney docket no. Doshi 58-10-27-19-36, all of which were filed on the same date and the teachings of all of which are incorporated herein by reference.
Provisional Applications (1)
|
Number |
Date |
Country |
|
60459163 |
Mar 2003 |
US |