BROWSE
Detail
Conference Paper
On Recovery Algorithm for Fault-Tolerance in Multicast Trees
Cited 0 time in 
Share 
Share
- Authors
- Seong Soon Joo, Moon Seong Kim, Yoo Kyoung Lee, Young Cheol Bang
- Issue Date
- 2006-12
- Citation
- Parallel and Distributed Processing and Applications (ISPA) 2006 (LNCS 4331), v.4331, pp.358-367
- Language
- English
- Type
- Conference Paper
- Abstract
- Since the multicast communication is the best technology to provide one to many communication, more and more service providers are using this technology to deliver the same service to multiple customers. These applications require seamless and real time services. With the deployment of the high-speed networks, real time services can be supported by reserving network resources in advance. In the case of seamless services, there should be no links or nodes failure in given networks. In real life networks, however, such failures are frequently happened more than we are expecting. In this paper, we propose a fault tolerant algorithm based on spanning trees that can be restorable using locally distributed mechanism in the case of multiple link-failures, if a tree existed. We also show that our algorithm can restore a multicast tree with constant recovery cost. We strongly believe our method can be generalized to apply to any type of tree-construction algorithm that requires the Quality of Service (QoS) in terms of reliability. © Springer-Verlag 2006.
- KSP Keywords
- Construction algorithm, Fault tolerance, Fault-tolerant, High speed network, Multicast tree, Network resources, Recovery algorithm, Service Provider, Spanning tree, multicast communication, multiple links