Link-disjoint paths for reliable QoS routing

International Journal of Communication Systems

Volumn 16, Issue 9, 2003, Pages 779-798

  Guo, Yuchun ^a   Kuipers, Fernando ^b   Van Mieghem, Piet ^b  

^a BEIJING JIAOTONG UNIVERSITY   (China)

^b Delft University of Technology ^*  (Netherlands)

Author keywords

Link disjoint paths; QoS routing; Restorable reliable routing

Indexed keywords

ALGORITHMS; CONGESTION CONTROL (COMMUNICATION); GRAPH THEORY; HEURISTIC METHODS; PACKET SWITCHING; PROBLEM SOLVING; TELECOMMUNICATION LINKS; TELECOMMUNICATION NETWORKS; VECTORS;

LINK-DISJOINT PATHS; ROUTING;

QUALITY OF SERVICE;

EID: 0344012184     PISSN: 10745351     EISSN: None     Source Type: Journal    
DOI: 10.1002/dac.612     Document Type: Article

References (31)

1. Suurballe JW, Tarjan RE. A quick method for finding shortest pairs of disjoint paths. Networks 1984; 14:325-333.
2. Van Mieghem P, De Neve H, Kuipers FA. Hop-by-hop quality of service routing. Computer Networks 2001; 37(3-4):407-423.
3. De Neve H, Van Mieghem P. TAMCRA: a tunable accuracy multiple constraints routing algorithm. Computer Communications 2000; 23(7):667-679.
4. Bhandari R. Optimal diverse routing in telecommunication fiber networks. Proceedings of IEEE INFOCOM '94. Toronto, Ontario, Canada, vol. 3, June, 1994; 1498-1508.
5. Suurballe JW. Disjoint paths in a network. Networks 1974; 4:125-145.
6. Garey MR, Johnson DS. Computers and Intractability. A Guide to the Theory of NP-Completeness. Freeman: San Francisco, 1979.
7. Wang Z, Crowcroft J. QoS routing for supporting multimedia applications. IEEE Journal on Selected Areas in Communications 1996; 14(7):1228-1234.
8. Castanon DA. Efficient algorithms for finding the K best paths through a trellis. IEEE Transactions on Aerospace and Electronic Systems 1990; 26(2):405-410.
9. Cheng C, Kumar SPR, Garcia-Luna-Aceves JJ. A distributed algorithm for finding K disjoint paths of minimal total length. Proceedings of 28th Annual Allerton Conference on Communication, Control, and Computing. Urbana, Illinois, October, 1990.
10. Ogier RG, Rutenburg V, Shacham N. Distributed algorithms for computing shortest pairs of disjoint paths. IEEE Transactions on Information Theory 1993; 39(2):443-455.
11. Sidhu D, Nair R, Abdallah S. Finding disjoint paths in networks. ACM SIGCOMM Computer Communication Review. Proceedings of the Conference on Communications Architecture & Protocols, vol. 21, No. 4. August, 1991.
12. Wolf JK, Viterbi AM, Dixon GS. Finding the best set of K paths through a trellis with application to multitarget tracking. IEEE Transactions on Aerospace and Electronic Systems 1989; 25(2):287-296.
13. Diestel R. Graph Theory. Graduate Texts in Mathematics. Springer: New York, 1997.
14. Ford LR, Fulkerson DR. Flows in Networks. Princeton University Press: Princeton, NJ, 1962.
15. Papadimitriou CH, Steiglitz K. Combinatorial Optimization-Algorithms and Complexity. Prentice-Hall, Inc.: Englewood Cliffs, NJ, 1982.
16. Kar K, Kodialam M, Lakshman TV. Routing restorable bandwidth guaranteed connections using maximum 2-route flows. Proceedings of IEEE INFOCOM'02, 2002.
17. Kodialam M, Lakshman TV. Dynamic routing of bandwidth guaranteed tunnels with restoration. Proceedings of IEEE INFOCOM'00, 2000.
18. Kodialam M, Lakshman TV. Restorable dynamic quality of service routing. IEEE Communications Magazine 2002; 72-81.
19. Liang W. Robust routing in wide-area WDM networks. Proceedings of 15th Int'l Parallel and Distributed Processing Symposium, San Francisco, April 2001.
20. Shaikh SZ. Span-disjoint paths for physical diversity in networks. Proceedings of IEEE Symposium on Computers and Communications 1995; 127-133.
21. Li C-L, McCormick ST, Simchi-Levi D. The complexity of finding two disjoint paths with min-max objective function. Discrete Applied Mathematics 1990; 26(1):105-115.
22. Sen A, Shen BH, Bandyopadhyay S, Capone JM. Survivability of lightwave networks - path lengths in WDM protection scheme. Journal of High Speed Networks 2001; 10(4):303-315.
23. Ho P-H, Mouftah HT. Issues on diverse routing for WDM mesh networks with survivability. Proceedings of 10th International Conference on Computer Communications and Networks 1997; 61-66.
24. Tanaka Y, Rue-Xue F, Akiyama M. Design method of highly reliable communication network by the use of matrix calculation. IEICE Transactions 1987; J70-B(5):551-556.
25. Oki E, Yamanaka N. A recursive matrix-calculation method for disjoint path search with hop link number constraint. IEICE Transactions on Communications 1995; E78-B(5):769-774.
26. Lee SW, Wu CS. A k-best paths algorithm for highly reliable communication networks. IEICE Transactions on Communications 1999; E82-B(4):586-580.
27. Bejerano Y, Breitbart Y, Orda A, Rastogi R, Sprintson A. Algorithms for computing QoS paths with restoration. Proceedings of IEEE INFOCOM'03. April, 2003.
28. Italiana GF, Rastogi R, Yener B. Restoration algorithms for virtual private networks in the hose model. Proceedings of IEEE INFOCOM'02, 2002.
29. Gummadi KP, Pradeep MJ, Murthy CSR. An efficient primary-segmented backup scheme for dependable real-time communication in multihop networks. ACM/IEEE Transactions on Networking 2003; 11(1):81-94.
30. Lo CC, Chuang BW. A novel approach of backup path reservation for survivable high-speed networks. IEEE Communications Magazine, March 2003.
31. Taft-Plotkin N, Bellur B, Ogier R. Quality-of-Service using maximally disjoint paths. Proceedings of IWQoS (International Workshop on Quality-of-Service), June 1999.