Advertisement

A Simple Scheme for Local Failure Recovery of Multi-directional Multicast Trees

  • Vladimír Dynda
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2869)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ballardie, A., Francis, P., Crowcroft, J.: Core Based Trees (CBT). In: Proc. of ACM SIGCOMM 1993 (1993)Google Scholar
  2. 2.
    Chang, E.G., Roberts, R.: An Improved Algorithm for Decentralized Extrema-Finding in Circular Configuration of Processors. Comm. of the ACM 22(5) (1979)Google Scholar
  3. 3.
    Dynda, V., Rydlo, P.: Large-scale Distributed File System Design and Architecture. Acta Polytechnica 42(1) (2002)Google Scholar
  4. 4.
    Fei, A., Cui, J., Gerla, M., Cavendish, D.: A Dual-Tree Scheme for Fault-Tolerant Multicast. In: Proc. of ICC 2001, Helsinki, Finland (2001)Google Scholar
  5. 5.
    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)Google Scholar
  6. 6.
    Kawamura, R., Sato, K., Tokizawa, I.: Self-Healing ATM Networks Based on Virtual Path Concept. IEEE J. Selected Areas In Comm (1997)Google Scholar
  7. 7.
    Mehra, P., Chatterjee, S.: Efficient Data Dissemination in OceanStore (2001), http://wwwvideo.eecs.berkeley.edu/~pmehra/classes/cs262/paper.pdf
  8. 8.
    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)CrossRefGoogle Scholar
  9. 9.
    Wu, C., Lee, W., Hou, Y.: Back-Up VP Preplanning Strategies for Survivable Multicast ATM Networks. In: Proc. of IEEE ICC 1997 (1997)Google Scholar
  10. 10.
    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)Google Scholar
  11. 11.
    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)Google Scholar
  12. 12.
    Zhuang, S., et al.: Bayeux: An Architecture for Scalable and Fault-Tolerant Wide-Area Data Dissemination. In: Proc. of NOSSDAV 2001 (2001)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Vladimír Dynda
    • 1
  1. 1.Department of Computer Science and Engineering, Faculty of Electrical EngineeringCzech Technical University in PraguePrague 2Czech Republic

Personalised recommendations