| US 7,518,990 B2 | ||
| Route determination method and apparatus for virtually-concatenated data traffic | ||
| Swarup Acharya, New Providence, N.J. (US); Bhawna Gupta, Edison, N.J. (US); Pankaj Risbood, Roselle, N.J. (US); and Anurag Srivastava, Roselle, N.J. (US) | ||
| Assigned to Alcatel Lucent USA Inc., Murray Hill, N.J. (US) | ||
| Filed on Dec. 26, 2003, as Appl. No. 10/745,881. | ||
| Prior Publication US 2005/0147081 A1, Jul. 07, 2005 | ||
| Int. Cl. G01R 31/08 (2006.01) | ||
| U.S. Cl. 370—225 [370/235; 370/395.4; 370/468] | 18 Claims |
| 1. A method of routing virtually-concatenated data traffic in a network comprising at least first and second nodes, the method
comprising the steps of:
identifying a traffic demand; and
determining a plurality of routes for routing the traffic demand through the network, with each of the routes corresponding
to a member of a virtually-concatenated group, such that different portions of the traffic demand are assigned to different
members of the virtually-concatenated group;
wherein the routes are determined utilizing a routing algorithm that determines the routes by processing a representation
of the network; and
wherein the routing algorithm determines the routes in a manner that ensures that failure of a single link in the network
does not affect more than a designated maximum amount X of a bandwidth B of the traffic demand.
|