Coherent provisioning of multiple traffic paths in transport networks
A method of coherently provisioning one or more paths through a transport network is disclosed. In other words, none of the traffic paths are provisioned unless all of the traffic paths can be provisioned. All of the nodes in one or more transport networks are listed that must be configured to provision all of the proposed traffic paths, and all of the nodes are checked, one after another, to ensure that each node can, in fact, provide all of the resources needed to establish all of the proposed traffic paths before any of the traffic paths are actually provisioned. As each node is visited, the set-up message directs each node to reserve, but not actually provision, the resources to be provided by that node for all of the proposed traffic paths. When all of the nodes have been visited, the set-up message re-visits each node and directs each node to actually provision the resources that had been previously reserved.
1. A method comprising:
routing a set-up message to a plurality of nodes in at least one transport network, wherein said set-up message reserves network resources for multiple different traffic paths through said at least one transport network as said set-up message visits each of said plurality of nodes, wherein each different traffic path comprises a unique subset of nodes leading to the a destination node; and
routing said set-up message to said plurality of nodes in said at least one transport network, wherein said set-up message provisions said reserved network resources for the multiple different traffic paths through said at least one transport network as said set-up message revisits each of said plurality of nodes of each traffic path;
wherein the reserved network resources for the multiple different traffic paths through said at least one transport network are provisioned only if all of the resources needed for each of the multiple different traffic paths through said at least one transport network have been successfully reserved.
2. The method of claim 1 wherein at least one of the multiple different traffic paths through said at least one transport network is a working path and wherein at least one of the multiple different traffic paths through said at least one transport network is a protection path for said working path.
3. The method of claim 1 wherein said set-up message revisits each of said plurality of nodes in the reverse order in which said set-up message visits each of said plurality of nodes.
4. The method of claim 1 wherein said transport network is a mesh network.
5. The method of claim 1 wherein said transport network is a ring network.
6. The method of claim 1 wherein at least one of the multiple different traffic paths through said at least one transport network is a multicast traffic path.
7. The method of claim 1 wherein some of said plurality of nodes are in a first transport network and some of said nodes are in a second transport network.
8. The method of claim 1 wherein each of the multiple different traffic paths through said at least one transport network is a multi-hop path that comprises a different set of nodes.
9. The method of claim 1 wherein at least two of the different traffic paths through said at least one transport network connect the destination node via different sets of intermediate nodes.
10. A method comprising:
routing a set-up message to a plurality of nodes in at least one transport network, wherein said set-up message reserves network resources for multiple different traffic paths through said at least one transport network as said set-up message visits each of said plurality of nodes, wherein each different traffic path comprises a unique subset of nodes leading to a same destination node; and
revisiting said plurality of nodes with one or more set-up messages, wherein said one or more set-up messages provision said reserved network resources for the multiple different traffic paths through said at least one transport network as said one or more set-up messages revisit each of said plurality of nodes of each traffic path;
wherein the reserved network resources for the multiple different traffic paths through said at least one transport network are provisioned only if all of the resources needed for each of the multiple different traffic paths through said at least one transport network have been successfully reserved.
11. The method of claim 10 wherein at least one of the multiple different traffic paths through said at least one transport network is a working path and wherein at least one of the multiple different traffic paths through said at least one transport network is a protection path for said working path.
12. The method of claim 10 wherein at least one of the multiple different traffic paths through said at least one transport network is a multicast traffic path.
13. The method of claim 10 wherein some of said plurality of nodes are in a first transport network and some of said nodes are in a second transport network.
14. The method of claim 10 wherein each of the multiple different traffic paths through said at least one transport network is a multi-hop path that comprises a different set of nodes.
15. The method of claim 10 wherein at least two of the different traffic paths through said at least one transport network connect the destination node via different sets of intermediate nodes.
16. A method comprising:
checking the nodes of multiple proposed different traffic paths through at least one transport network to ensure that each node can provide the resources needed to establish the multiple proposed different traffic paths through said at least one transport network, wherein the nodes are checked by sending a set-up message to the nodes and wherein each of the proposed different traffic paths comprises a unique subset of nodes leading to a same destination node;
reserving, at each node, the resources needed to establish the multiple proposed different traffic paths through said at least one transport network if the resources are available; and
provisioning, at each node, the resources needed to establish each one of the multiple proposed different traffic paths through said at least one transport network only if all of the resources needed to establish each one of the multiple proposed different traffic paths through said at least one transport network have been successfully reserved.
17. The method of claim 16 wherein the nodes are checked one node after another.
18. The method of claim 16 wherein the set-up message includes an indication of the order in which to check the nodes.
19. The method of claim 18 wherein provisioning the resources comprises routing the set-up message to the nodes in the reverse order in which the nodes were checked.
20. The method of claim 16 wherein each of the multiple different traffic paths through said at least one transport network is a multi-hop path that comprises a different set of nodes.
21. The method of claim 16 wherein at least two of the different traffic paths through said at least one transport network connect the destination node via different sets of intermediate nodes.