Abstract
When a node in a multicast tree fails, the tree is divided into several fragments. To achieve a fault-tolerant communication, failure recovery schemes are necessary to restore the tree. We present a simple recovery scheme for overlay multicast trees that involves only failure-neighboring nodes into the restoration and keeps the original structure of the rest of the tree. The scheme is based on virtual bypass rings providing alternative paths to eliminate the faulty node and reroute the traffic. Our scheme is scalable, independent of message source and traffic direction in the tree, restores the multicast tree in real time without a significant delay penalty and our experiments show that it is efficient even under a heavy traffic in the tree.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ballardie, A., Francis, P., Crowcroft, J.: Core Based Trees (CBT). In: Proc. of ACM SIGCOMM 1993 (1993)
Chang, E.G., Roberts, R.: An Improved Algorithm for Decentralized Extrema-Finding in Circular Configuration of Processors. Comm. of the ACM 22(5) (1979)
Dynda, V., Rydlo, P.: Large-scale Distributed File System Design and Architecture. Acta Polytechnica 42(1) (2002)
Fei, A., Cui, J., Gerla, M., Cavendish, D.: A Dual-Tree Scheme for Fault-Tolerant Multicast. In: Proc. of ICC 2001, Helsinki, Finland (2001)
Jia, W., Zhao, W., Xuan, D., Xu, G.: An Efficient Fault-Tolerant Multicast Routing Protocol with Core-Based Tree Techniques. In: Proc. of IEEE ICPP, Wakamatsu, Japan (1999)
Kawamura, R., Sato, K., Tokizawa, I.: Self-Healing ATM Networks Based on Virtual Path Concept. IEEE J. Selected Areas In Comm (1997)
Mehra, P., Chatterjee, S.: Efficient Data Dissemination in OceanStore (2001), http://wwwvideo.eecs.berkeley.edu/~pmehra/classes/cs262/paper.pdf
Rowstron, A., et al.: Pastry: Scalable, Distributed Object Location and Routing for Large- Scale Peer-To-Peer Systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, p. 329. Springer, Heidelberg (2001)
Wu, C., Lee, W., Hou, Y.: Back-Up VP Preplanning Strategies for Survivable Multicast ATM Networks. In: Proc. of IEEE ICC 1997 (1997)
Wu, C., Lee, W., Hou, Y., Chu, W.: A New Preplanned Self-Healing Scheme for Multicast ATM Network. In: Proc. of IEEE ICC 1997 (1997)
Zhao, B.Y., et al.: Tapestry: An Infrastructure for Fault-Tolerant Wide-Area Location and Routing. U. C. Berkeley Technical Report UCB/CSD-01-1141 (2001)
Zhuang, S., et al.: Bayeux: An Architecture for Scalable and Fault-Tolerant Wide-Area Data Dissemination. In: Proc. of NOSSDAV 2001 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dynda, V. (2003). A Simple Scheme for Local Failure Recovery of Multi-directional Multicast Trees. In: Yazıcı, A., Şener, C. (eds) Computer and Information Sciences - ISCIS 2003. ISCIS 2003. Lecture Notes in Computer Science, vol 2869. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39737-3_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-39737-3_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20409-1
Online ISBN: 978-3-540-39737-3
eBook Packages: Springer Book Archive