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.
Dr. Bang and Kim are the corresponding authors.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Wang, B., Hou, J.C.: Multicast Routing and its QoS Extension: Problems, Algorithms, and Protocols. IEEE Networks (January 2000)
Pusateri, T.: Distance Vector Routing Protocol, draft-ietf-idmr-dvmrp-v3-07 (1998)
Estrin, D., et al.: Protocol Independent Multicast (PIM) Sparse Mode/Dense Mode, Internet draft (1996)
Moy, J.: Multicast Extension to OSPF, Internet draft (1998)
Deering, S., et al.: Protocol Independent Multicast-Sparse Mode (PIM-SM): Motivation and Architecture, Internet draft (1998)
Ballardie, A., Francis, P., Crowcroft, J.: Core Based Trees (CBT). In: ACM SIGCOMM, pp. 85–95 (1993)
Ballardie, A.: Core Based Trees (CBT) Multicast Routing Architecture, RFC 2201, Internet Engineering Task Force (September 1997)
Ballardie, A.: Core Based Trees (CBT version 2) Multicast Routing – Protocol Specification –, RFC 2189, Internet Engineering Task Force (September 1997)
Ballardie, A., Cain, B., Zhang, Z.: Core Based Trees (CBT version 3) Multicast Routing – Protocol Specification –, Internet Draft, draft-ietf-idmr-cbt-spec-v3-01.txt, Internet Engineering Task Force (August 1998)
Schwiebert, L., Chintalapati, R.: Improved Fault Recovery for Core Based Trees. Computer Communications 23, 816–824 (2000)
Labovitz, C., Malan, R., Jahanian, F.: Internet Routing Instability. IEEE/ACM Transactions on Networking 6, 515–528 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Joo, SS., Kim, M., Lee, YK., Bang, YC. (2006). On Recovery Algorithm for Fault-Tolerance in Multicast Trees. In: Min, G., Di Martino, B., Yang, L.T., Guo, M., Rünger, G. (eds) Frontiers of High Performance Computing and Networking – ISPA 2006 Workshops. ISPA 2006. Lecture Notes in Computer Science, vol 4331. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11942634_38
Download citation
DOI: https://doi.org/10.1007/11942634_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-49860-5
Online ISBN: 978-3-540-49862-9
eBook Packages: Computer ScienceComputer Science (R0)