An Efficient Fault-Tolerant Multicast Routing Protocol with Core-Based Tree Techniques

In this paper, we design and analyze an efficient fault-tolerant multicast routing protocol. Reliable multicast communication is critical for the success of many Internet applications. Multicast routing protocols with core-based tree techniques (CBT) have been widely used because of their scalability and simplicity. We enhance the CBT protocol with fault tolerance capability and improve its efficiency and effectiveness. With our strategy, when a faulty component is detected, some pre-defined backup path(s) is (are) used to bypass the faulty component and enable the multicast communication to continue. Our protocol only requires that routers near the faulty component be reconfigured, thus reducing the runtime overhead without compromising much of the performance. Our approach is in contrast to other approaches that often require relatively large tree reformation when faults occur. These global methods are usually costly and complicated in their attempt to achieve theoretically optimal performance. Our performance evaluation shows that our new protocol performs nearly as well as the best possible global method while utilizing much less runtime overhead and implementation cost.

[1]  Deepinder P. Sidhu,et al.  Congestion Control in High Speed Networks via Alternate Path Routing , 1992, J. High Speed Networks.

[2]  Tony Ballardie,et al.  Core Based Trees (CBT version 2) Multicast Routing - Protocol Specification - , 1997, RFC.

[3]  Jon Crowcroft,et al.  Shortest path first with emergency exits , 1990, SIGCOMM 1990.

[4]  Alain Jean-Marie,et al.  Stochastic comparisons for queueing models via random sums and intervals , 1992, Advances in Applied Probability.

[5]  Christian Huitema,et al.  An Architecture for Residential Internet Telephony Service , 1999, IEEE Internet Comput..

[6]  Stephen E. Deering,et al.  IP Version 6 Addressing Architecture , 1995, RFC.

[7]  David Thaler,et al.  Distributed Center-Location Algorithms , 1997, IEEE J. Sel. Areas Commun..

[8]  Stephen E. Deering,et al.  Distance Vector Multicast Routing Protocol , 1988, RFC.

[9]  Wushow Chou,et al.  Routing in computer networks , 1971, Networks.

[10]  John Moy,et al.  Multicast routing extensions for OSPF , 1994, CACM.

[11]  Craig Partridge,et al.  Host Anycasting Service , 1993, RFC.

[12]  M. Schwartz,et al.  The Gradient Projection Algorithm for Multiple Routing in Message-Switched Networks , 1976, IEEE Trans. Commun..

[13]  Anthony Ephremides,et al.  The Routing Problem in Computer Networks , 1986 .

[14]  K. Bharath-Kumar,et al.  Routing to Multiple Destinations in Computer Networks , 1983, IEEE Trans. Commun..

[15]  Ellen W. Zegura,et al.  Application-layer anycasting , 1997, Proceedings of INFOCOM '97.

[16]  J. Bibb Cain,et al.  Performance and Resource Cost Comparisons for the CBT and PIM Multicast Routing Protocols , 1997, IEEE J. Sel. Areas Commun..

[17]  Stephen E. Deering,et al.  Multicast routing in internetworks and extended LANs , 1988, CCRV.

[18]  Stephen E. Deering,et al.  ICMP Router Discovery Messages , 1991, RFC.

[19]  Luigi Fratta,et al.  The flow deviation method: An approach to store-and-forward communication network design , 1973, Networks.

[20]  David Waitzman,et al.  A 50-Gb/s IP router , 1998, TNET.

[21]  J. Moy,et al.  OSPF: Anatomy of an Internet Routing Protocol , 1998 .

[22]  J. J. Garcia-Luna-Aceves,et al.  Scalable Internet multicast routing , 1995, Proceedings of Fourth International Conference on Computer Communications and Networks - IC3N'95.

[23]  A. Banerjea Simulation Study of the Capacity Effects of Dispersity Routing for Fault Tolerant Realtime Channels , 1996, SIGCOMM.

[24]  S. T. Buckland,et al.  An Introduction to the Bootstrap. , 1994 .

[25]  A. Khanna,et al.  The revised ARPANET routing metric , 1989, SIGCOMM 1989.

[26]  Larry D. Wittie,et al.  Multicast Communication on Network Computers , 1985, IEEE Software.

[27]  David W. Wall,et al.  Selective Broadcast in Packet-Switched Networks , 1982, Berkeley Workshop.

[28]  Tony Ballardie,et al.  Core Based Trees (CBT) Multicast Routing Architecture , 1997, RFC.

[29]  Weijia Jia,et al.  Integrated routing algorithms for anycast messages , 2000 .

[30]  Nicholas F. Maxemchuk,et al.  Dispersity Routing in High-Speed Networks , 1993, Comput. Networks ISDN Syst..

[31]  Mario Gerla,et al.  Optimal Routing in a Packet-Switched Computer Network , 1974, IEEE Transactions on Computers.

[32]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[33]  E. Gustafsson,et al.  A literature survey on traffic dispersion , 1997, IEEE Netw..

[34]  Deborah Estrin,et al.  Multicast routing in dense and sparse modes: simulation study of tradeoffs and dynamics , 1995, Proceedings of Fourth International Conference on Computer Communications and Networks - IC3N'95.

[35]  John Moy,et al.  OSPF Version 2 , 1998, RFC.

[36]  Deborah Estrin,et al.  The PIM architecture for wide-area multicast routing , 1996, TNET.

[37]  Paul Francis,et al.  Core based trees (CBT) , 1993, SIGCOMM 1993.

[38]  Charles L. Hedrick Rutgers An introduction to igrp , 1991 .

[39]  Stephen E. Deering,et al.  Internet Protocol, Version 6 (IPv6) Specification , 1995, RFC.

[40]  John Moy,et al.  Multicast Extensions to OSPF , 1994, RFC.

[41]  Anindo Banerjea,et al.  Recovering guaranteed performance service connections from single and multiple faults , 1994, 1994 IEEE GLOBECOM. Communications: The Global Bridge.

[42]  Robert G. Gallager,et al.  A Minimum Delay Routing Algorithm Using Distributed Computation , 1977, IEEE Trans. Commun..

[43]  Robert Metcalfe,et al.  Reverse path forwarding of broadcast packets , 1978, CACM.

[44]  Ellen W. Zegura,et al.  Core selection methods for multicast routing , 1995, Proceedings of Fourth International Conference on Computer Communications and Networks - IC3N'95.

[45]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[46]  Weijia Jia,et al.  Routing algorithms for anycast messages , 1998, Proceedings. 1998 International Conference on Parallel Processing (Cat. No.98EX205).

[47]  J. J. Garcia-Luna-Aceves,et al.  A Protocol for Scalable Loop-Free Multicast Routing , 1997, IEEE J. Sel. Areas Commun..

[48]  Alain Jean-Marie,et al.  Parallel queues with resequencing , 1993, JACM.

[49]  M. Schwartz,et al.  Routing Techniques Used in Computer Communication Networks , 1980, IEEE Trans. Commun..

[50]  Raphael Rom,et al.  Multi-path routing combined with resource reservation , 1997, Proceedings of INFOCOM '97.

[51]  Saewoong Bahk,et al.  A Dynamic Multi-Path Routing Algorithm for ATM Networks , 1992, J. High Speed Networks.

[52]  Wei Zhao,et al.  Fault-tolerant real-time communication in FDDI-based networks , 1995, Proceedings 16th IEEE Real-Time Systems Symposium.

[53]  Michael J. Donahoo,et al.  Core Migration for Dynamic Multicast Routing , 1995 .

[54]  A. Khanna,et al.  The revised ARPANET routing metric , 1989, SIGCOMM '89.

[55]  Tony Ballardie,et al.  Core based trees , 1993 .