Constraint-based shortest path first method for dynamically switched optical transport networks
First Claim
1. A traffic network element (“
- TNE”
) in a network, the TNE comprising;
a traffic engineering network database (“
TEND”
) that stores network topology information for the network and bandwidth availability information for links in the network; and
a routing engine that receives a request for a label switched path (“
LSP”
) through the network with specified constraints, processes network topology information from the TEND to create a network graph comprising links meeting the specified constraints, and computes a primary path through the network, wherein the primary path comprises links selected from the network graph.
12 Assignments
0 Petitions
Accused Products
Abstract
Method and apparatus for implementing a constraint-based shortest path first (“CSPF”) technique for dynamically switched optical transport networks are described. One embodiment comprises a traffic network element (“TNE”) in a network comprising a traffic engineering network database (“TEND”) that stores network topology information for the network and bandwidth availability information for links in the network; and a routing engine that receives a request for a label switched path (“LSP”) with specified constraints, processes network topology information from the TEND to create a network graph comprising links meeting the specified constraints, and computes a primary path through the network, wherein the primary path comprises links selected from the network graph.
70 Citations
25 Claims
-
1. A traffic network element (“
- TNE”
) in a network, the TNE comprising;
a traffic engineering network database (“
TEND”
) that stores network topology information for the network and bandwidth availability information for links in the network; and
a routing engine that receives a request for a label switched path (“
LSP”
) through the network with specified constraints, processes network topology information from the TEND to create a network graph comprising links meeting the specified constraints, and computes a primary path through the network, wherein the primary path comprises links selected from the network graph. - View Dependent Claims (2, 3, 4, 5, 6)
- TNE”
-
7. A method of computing an explicit route through a network comprising:
-
receiving a path setup request message for a new traffic flow in the network, wherein the path setup request message includes specified constraints on the path;
generating a network graph from network information stored in a traffic engineering network database (“
TEND”
), wherein links not meeting the specified constraints for the path are not included in the graph; and
calculating a primary explicit route through the network from the generated network graph. - View Dependent Claims (8, 9, 10, 11, 12, 13, 14, 15)
-
-
16. A traffic network element (“
- TNE”
) in a network, the TNE comprising;
means for storing network topology information for the network and bandwidth availability information for links in the network; and
means for processing information from the TEND to create a network graph comprising links meeting specified constraints in a request for a label switched path (“
LSP”
) and calculating a primary explicit route through the network, wherein the primary explicit route comprises links selected from the network graph. - View Dependent Claims (17, 18, 19, 20, 21, 22, 23, 24, 25)
- TNE”
Specification