SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
IEEE/ACM Transactions on Networking (TON)
Improved fault recovery for core based trees
Computer Communications
Multicast routing and its QoS extension: problems, algorithms, and protocols
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
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.