Delay distributed virtually-concatenated data traffic
View Patent ↗Network design techniques and techniques for routing virtually-concatenated data traffic in a network in a manner which distributes delay to intermediate nodes of the network are disclosed. For example, in one aspect of the invention, a technique for routing virtually-concatenated data traffic in a network comprising a plurality of nodes comprises, for a given traffic demand to be routed from a source node to a destination node in the network, the following steps/operations. Two or more paths are determined to route the given traffic demand. Each of the two or more paths correspond to a member of a virtually-concatenated group. At least one path of the two or more paths comprises the source node, the destination node and at least one other node coupled between the source node and the destination node. Further, at least a subset of the source node, the destination node and the one other node buffer at least a portion of the given traffic demand such that a delay is distributed over the at least one path. The given traffic demand is routed over the two or more determined paths. The at least one path is preferably the shorter of the two or more determined paths.
1. A method of routing virtually-concatenated data traffic in a network comprising a plurality of nodes, wherein each node of the plurality of nodes is a network-level node separated from another network-level node of the plurality of nodes by at least one network-level link, the method comprising, for a given traffic demand to be routed from a source node to a destination node in the network, the steps of:
determining two or more paths to route the given traffic demand, each of the two or more paths corresponding to a member of a virtually-concatenated group, wherein one path of the two or more paths comprises nodes of the plurality of nodes including a source node, a destination node and at least one other node coupled between the source node and the destination node, and further wherein at least two nodes of a set comprising the source node, the destination node and the one other node buffer at least a portion of the given traffic demand such that a delay is distributed over the at least two nodes of the one path; and
routing the given traffic demand over the two or more determined paths;
wherein the delay distribution is a function of at least one of the direction of the given traffic demand, the number of nodes that buffer at least a portion of the given traffic demand and a capacity of one or more network-level links.
2. The method of claim 1 , wherein the one path is the shorter of the two or more determined paths.
3. The method of claim 1 , wherein a differential delay associated with the two or more determined paths is substantially reduced at the destination node due to the delay associated with the one path being distributed over the one path.
4. The method of claim 1 , wherein a buffer size required at the destination node is substantially minimized due to the delay associated with the one path being distributed over the one path.
5. The method of claim 1 , wherein each of the source node, the destination node and the one other node of the one path delay at least a portion of the given traffic demand by a fixed amount.
6. The method of claim 1 , further comprising the step of recombining respective members of the virtually-concatenated group at the destination node.
7. The method of claim 1 , wherein the determining step is implemented at least in part in software running on a processor of a node or other element of the network.
8. The method of claim 1 , wherein distribution of the delay over the one path permits traffic on the network that would otherwise not be admissible.
9. The method of claim 1 , wherein one of the at least two nodes comprises the at least one other node.
10. The method of 1 , wherein the at least two nodes comprise the at least one other node and at least one of the source node and the destination node.
11. Apparatus for use in routing virtually-concatenated data traffic in a network comprising a plurality of nodes, wherein each node of the plurality of nodes is a network-level node separated from another network-level node of the plurality of nodes by at least one network-level link, the apparatus comprising:
a processor; and
a memory coupled to the processor;
wherein the processor is operative, for a given traffic demand to be routed from a source node to a destination node in the network, to perform the steps of:
determining two or more paths to route the given traffic demand, each of the two or more paths corresponding to a member of a virtually-concatenated group, wherein one path of the two or more paths comprises nodes of the plurality of nodes including a source node, a destination node and at least one other node coupled between the source node and the destination node, and further wherein at least two nodes of a set comprising the source node, the destination node and the one other node buffer at least a portion of the given traffic demand such that a delay is distributed over the at least two nodes of the one path; and
causing the given traffic demand to be routed over the two or more determined paths;
wherein the delay distribution is a function of at least one of the direction of the given traffic demand, the number of nodes that buffer at least a portion of the given traffic demand and a capacity of one or more network-level links.
12. The apparatus of claim 11 , wherein the apparatus is implemented in one of a distributed manner within one or more of the network nodes and a centralized manner utilizing a central controller.
13. The apparatus of claim 11 , wherein the one path is the shorter of the two or more determined paths.
14. The apparatus of claim 11 , wherein a differential delay associated with the two or more determined paths is substantially reduced at the destination node due to the delay associated with the one path being distributed over the one path.
15. The apparatus of claim 11 , wherein a buffer size required at the destination node is substantially minimized due to the delay associated with the one path being distributed over the one path.
16. The apparatus of claim 11 , wherein each of the source node, the destination node and the one other node of the one path are configured to delay at least a portion of the given traffic demand by a fixed amount.
17. The apparatus of claim 11 , wherein distribution of the delay over the one path permits traffic on the network that would otherwise not be admissible.
18. The apparatus of claim 11 , wherein one of the at least two nodes comprises the at least one other node.
19. The apparatus of 11 , wherein the at least two nodes comprise the at least one other node and at least one of the source node and the destination node.
20. An article of manufacture comprising a non-transitory machine-readable medium storing one or more programs for use in routing virtually-concatenated data traffic in a network comprising a plurality of nodes, wherein each node of the plurality of nodes is a network-level node separated from another network-level node of the plurality of nodes by at least one network-level link, the one or more programs when executed in a processor, for a given traffic demand to be routed from a source node to a destination node in the network, performing the steps of:
determining two or more paths to route the given traffic demand, each of the two or more paths corresponding to a member of a virtually-concatenated group, wherein one path of the two or more paths comprises nodes of the plurality of nodes including a source node, a destination node and at least one other node coupled between the source node and the destination node, and further wherein at least two nodes of a set comprising the source node, the destination node and the one other node buffer at least a portion of the given traffic demand such that a delay is distributed over the at least two nodes of the one path; and
causing the given traffic demand to be routed over the two or more determined paths;
wherein the delay distribution is a function of at least one of the direction of the given traffic demand, the number of nodes that buffer at least a portion of the given traffic demand and a capacity of one or more network-level links.