Improved fault recovery for core based trees

Authors:
L Schwiebert;R Chintalapati
Affiliations:
Department of Electrical and Computer Engineering, Wayne State University, 5050 Anthony Wayne Drive, Detroit, MI 48202-3902, USA;Softalia, 2527 FarmCrest Dr, Apt #401, Herndon, VA 20171, USA
Venue:
Computer Communications
Year:
2000

Citing 5
Cited 6

Core based trees (CBT)

SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
Internet routing instability

IEEE/ACM Transactions on Networking (TON)
An Adaptive Protocol for Reliable Multicast in Mobile Multi-hop Radio Networks

WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
The Ordered Core Based Tree Protocol

INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
A comparison of the Internet multicast routing protocols

Computer Communications

Fault Recovery for a Distributed SP-Based Delay Constrained Multicast Routing Algorithm

IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Fault Recovery for a Distributed QoS-Based Multicast Routing Algorithm

ICCNMC '01 Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01)
A case for tree evolution in QoS multicasting

Computer Communications
On recovery algorithm for fault-tolerance in multicast trees

ISPA'06 Proceedings of the 2006 international conference on Frontiers of High Performance Computing and Networking
Distributed multicast tree generation with dynamic group membership

Computer Communications
A case for tree migration and integrated tree maintenance in QoS multicasting

Computer Communications

Quantified Score

Hi-index	0.24

Visualization

Abstract

The demand for multicast communication in wide-area networks, such as the internet, is increasing. Core based trees is one protocol that has been proposed to support scalable multicasting for sparse groups. When faults occur in the network nodes or links of the tree, the tree can become disconnected. In this paper, we propose an efficient protocol for recovering from faults in a core based tree. One of the key ideas is a technique for restructuring the disconnected subtree so that a loop-free path to the core can be found. The correctness of this protocol is also proved.