Reliability constrained routing in QoS networks

IEEE/ACM Transactions on Networking

Volumn 13, Issue 3, 2005, Pages 662-675

  Chakrabarti, Anirban ^a,b   Manimaran, G ^a  

^a Iowa State University of Science and Technology   (United States)

^b INFOSYS TECHNOLOGIES LTD   (India)

Author keywords

Constrained routing; Fault tolerant routing; Multicasting; Resource reservation

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BANDWIDTH; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; HEURISTIC METHODS; MATHEMATICAL MODELS; MULTICASTING; OPTIMIZATION; QUALITY OF SERVICE; RELIABILITY; ROUTERS;

CONSTRAINED ROUTING; FAULT TOLERANT ROUTING; RESOURCE RESERVATION;

TELECOMMUNICATION NETWORKS;

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

References (27)

1. A. Banerjea, "Simulation study of the capacity effects of dispersity routing for fault-tolerant real-time channels," in Proc. ACM SIGCOMM, 1996, pp. 194-205.
2. S. Han and K. G. Shin, "A primary-backup channel approach to dependable real-time communication in multihop networks," IEEE Trans. Comput., vol. 47, no. 1, pp. 46-61, Jan. 1998.
3. R. Sriram, G. Manimaran, and C. S. R. Murthy, "A note on integrated scheme for dependable real-time channels in multihop networks," Comput. Commun., vol. 25, no. 17, pp. 1673-1683, Nov. 2002.
4. J. Anderson, B. Doshi, S. Dravida, and P. Harshavadhana, "Fast restoration of ATM networks," IEEE J. Sel. Areas Commun., vol. 12, no. 1, pp. 128-138, Jan. 1994.
5. S. Ramamurthy and B. Mukherjee, "Survivable WDM mesh networks, part I - Protection," in Proc. IEEE INFOCOM, Mar. 1999, pp. 744-751.
6. M. Sridharan, M. V. Salapaka, and A. K. Somani, "A practical approach to operating survivable WDM networks," IEEE J. Sel. Areas Commun., vol. 20, no. 1, pp. 34-46, Jan. 2002.
7. H. F. Salama, D. Reeves, and Y. Viniotis, "A distributed algorithm for delay-constrained unicast routing," in Proc. IEEE INFOCOM, Apr. 1997, pp. 84-91.
8. G. Manimaran, H. S. Rahul, and C. S. R. Murthy, "A new distributed route selection approach for channel establishment in real-time networks," IEEE/ACM Trans. Networking, vol. 7, no. 5, pp. 698-709, Oct. 1999.
9. S. Chen, K. Nahrstedt, and Y. Shavitt, "A QoS-aware multicast routing protocol," in IEEE J. Sel. Areas Commun., vol. 18, Dec. 2000, pp. 2580-2592.
10. S. Yan, M. Faloutsos, and A. Banerjea, "QoS-aware multicast routing for the internet: The design and evaluation of QoSMIC," IEEE Trans. Networking, vol. 10, no. 1, pp. 54-66, Feb. 2002.
11. F. Kuipers, P. Van Mieghem, T. Korkmaz, and M. Krunz, "An overview of constraint-based path selection algorithms for QoS routing," IEEE Commun. Mag., vol. 40, no. 12, pp. 50-55, Dec. 2002.
12. D. H. Lorenz and A. Orda, "Optimal partition of QoS requirements in unicast paths and multicast trees," in Proc. IEEE INFOCOM, Apr. 1999, pp. 246-253.
13. D. H. Lorenz, A. Orda, D. Raz, and Y. Shavitt, "Efficient QoS partition and routing of unicast and multicast," in Proc. IEEE/ IFIP IWQoS, Jun. 2000, pp. 75-83.
14. A. Orda and A. Sprintson, "A scalable approach to the partition of QoS requirements in unicast and multicast," in Proc. IEEE INFOCOM, Apr. 2002, pp. 685-694.
15. T. Korkmaz and M. Krunz, "Multi-constrained optimal path selection," in Proc. IEEE INFOCOM, Apr. 2001, pp. 834-843.
16. X. Yuan, "Heuristic algorithms for multiconstrained quality-of-service routing," IEEE/ACM Trans. Networking, vol. 10, no. 2, pp. 244-256, Apr. 2002.
17. G. Liu and K. G. Ramakrishnan, "A * prune: An algorithm for finding k shortest paths subject to multiple constraints," in Proc. IEEE INFOCOM, Apr. 2001, pp. 834-843.
18. M. J. Pradeep and C. S. R. Murthy, "Providing differentiated reliable connections for real-time communication in multihop networks," in Proc. Int. Conf. High Perfromance Computing (HiPC), 2000, pp. 459-468.
19. K. P. Gummadi, M. J. Pradeep, and C. S. R. Murthy, "An efficient primary segmented backup scheme for dependable real-time communication in multihop networks," IEEE/ACM Trans. Networking, vol. 11, no. 1, pp. 81-94, Feb. 2003.
20. B. Wang and J. Hou, "Multicast routing and its QoS extension: Problems, algorithms, and Protocols," IEEE Network, vol. 14, no. 1, pp. 22-36, Jan./Feb. 2000.
21. S. Murthy and J. J. Garcia-Luna-Aceves, "Loop-free internet routing using hierarchical routing trees," in Proc. IEEE INFOCOM, 1997, pp. 101-108.
22. S. Shenker and L. Breslau, "Two issues in reservation establishment," Comput. Commun. Rev., vol. 25, no. 4, pp. 14-26, 1995.
23. J. Csirik, J. B. G. Frenk, M. Labb, and S. Zhang, "Heuristic for 0-1 Min-Knapsack problem," Acta Cybernet., vol. 10, no. 1-2, pp. 15-20, Jan. 1991.
24. L. Zhang, S. Deering, D. Estrin, S. Shenker, and D. Zappala, "RSVP: a new resource ReSerVation Protocol," IEEE Network, vol. 7, no. 5, pp. 8-18, Sep. 1993.
25. P. Pan, E. Hahne, and H. Schulzrinne, "BGRP: A tree-based aggregation protocol for inter-domain reservations," J. Commun. Netw., vol. 2, no. 2, pp. 157-167, Jun. 2000.
26. UCB/LBNL/VINT Network Simulator - ns (Version 2) [Online]. Available: http://www.isi.edu/nsnam/ns
27. G. S. Lueker, "Average-case analysis of off-line and on-line Knapsack," J. Algorithms, pp. 277-305, Nov. 1998.