Routing restorable bandwidth guaranteed connections using maximum 2-route flows

IEEE/ACM Transactions on Networking

Volumn 11, Issue 5, 2003, Pages 772-781

  Kar, Koushik ^a   Kodialam, Murali ^b   Lakshman, T V ^b  

^a RENSSELAER POLYTECHNIC INSTITUTE   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

2 route flow; Disjoint path; Restoration; Routing

Indexed keywords

ALGORITHMS; BANDWIDTH; COMPUTER SIMULATION; FIBER OPTIC NETWORKS; NETWORK PROTOCOLS; OPTICAL LINKS; SIGNAL INTERFERENCE; WAVELENGTH DIVISION MULTIPLEXING;

BANDWIDTH ROUTING; DISJOINT PATH; MULTIPROTOCOL LABEL SWITCHED NETWORKS; NETWORK RESTORATION; OPTICAL NETWORK; TWO ROUTE FLOWS;

OPTICAL COMMUNICATION;

EID: 0242270899     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2003.818191     Document Type: Article

References (13)

1. C. C. Aggarwal and J. B. Orlin, "On multi-route maximum flows in networks networks," Networks, vol. 39, no. 1, pp. 43-52, 2002.
2. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications, Englewood Cliffs, NJ: Prentice-Hall, 1993.
3. V. Anand and C. Qiao, "Dynamic establishment of protection paths in WDM networks-Part I," in Proc. 9th Int. Conf. Computer Communications (ICCCN'00), Oct. 2000, pp. 198-204.
4. G. Apostopoulos, R. Guerin, S. Kamat, A. Orda, and S. K. Tripathi, "Quality of service based routing: a performance perspective," in Proc. SIGCOMM, Sept. 1998, pp. 17-28.
5. B. Davie and Y. Rekhter, MPLS Technology and Applications. San Mateo, CA: Morgan Kaufman, 2000.
6. B. T. Doshi et al., "Optical network design and routing," Bell Labs Tech. J., vol. 4, no. 1, pp. 58-84, 1999.
7. N. Garg and J. Konemann, "Faster and simpler algorithms for multi-commodity flow and other fractional packing problems," in Proc. 39th Annu. Symp. Foundations of Computer Science (FOCS'98), Nov. 1998, pp. 300-309.
8. A. V. Goldberg and R. E. Tarjan, "Solving minimum cost flow problem by successive approximation," in Proc. 19th ACM Symp. Theory of Computing, 1987, pp. 7-18.
9. K. Kar, M. Kodialam, and T. V. Lakshman, "Minimum interference routing of bandwidth guaranteed tunnels with MPLS traffic engineering applications," IEEE J. Select. Areas Commun., vol. 18, Dec. 2000.
10. W. Kishimoto, "A method for obtaining the maximum multi-route flows in a network," Networks, vol. 27, pp. 279-291, 1996.
11. M. Kodialam and T. V. Lakshman, "Dynamic routing of bandwidth guaranteed tunnels with restoration," in Proc. INFOCOM, Mar. 2000, pp. 902-911.
12. V. Sharma et al., "Framework for MPLS based recovery," IETF, Internet Draft, draft-ietf-mpls-recovery-frmwrk-04.txt, July 2001.
13. J. W. Suurballe and R. E. Tarjan, "A quick method for finding shortest pairs of disjoint paths," Networks, vol. 14, pp. 325-336, 1984.