The PIM architecture for wide-area multicast routing
IEEE/ACM Transactions on Networking (TON)
Session directories and scalable Internet multicast address allocation
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Tackling group-to-tree matching in large scale group communications
Computer Networks: The International Journal of Computer and Telecommunications Networking
On the methodology for the evaluation of unconstrained multicast routing algorithms
ICT'09 Proceedings of the 16th international conference on Telecommunications
| Hi-index | 0.00 |
In this paper, we propose a new Tree Switching Protocol (TSP) to reduce multicast routing states required for a forest of multicast trees. The protocol accomplishes this goal by selecting a base multicast tree and 驴switching驴 other multicast trees to the base tree. This results in more overlapping among the multicast trees and a net reduction in multicast state. A further reduction in the state is possible by applying state aggregation to the overlapped tree branches. Simulation results show that the tree switching operation alone could result in a very significant state reduction. The TSP is a distributed protocol running on top of any protocol independent multicast routing protocols. It is also loop-free and very efficient.