The PIM architecture for wide-area multicast routing
IEEE/ACM Transactions on Networking (TON)
End-to-end routing behavior in the Internet
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
On routes and multicast trees in the Internet
ACM SIGCOMM Computer Communication Review
IP multicast channels: EXPRESS support for large-scale single-source applications
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
An Efficient Fault-Tolerant Multicast Routing Protocol with Core-Based Tree Techniques
IEEE Transactions on Parallel and Distributed Systems
A case for end system multicast (keynote address)
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
On the design of IP routers part 1: Router architectures
Journal of Systems Architecture: the EUROMICRO Journal
Hop by hop multicast routing protocol
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
On the topology of multicast trees
IEEE/ACM Transactions on Networking (TON)
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
Deployment issues for the IP multicast service and architecture
IEEE Network: The Magazine of Global Internetworking
A survey of proposals for an alternative group communication service
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
It is well known that IP multicast suffers from deployment issues. The problem mainly originates from the multicast routing complexities in the inter-domain level and state-full nature of current solutions. To cope with the problem, many alternative group communication methods have been proposed. Among them, branching point (BP) based approaches have promising features like incremental deployment, high tree availability, low memory requirement and, hence, high scalability. However, current BP-based methods suffer from two major inefficiencies namely the tree construction difficulties and presence of excessive lookups in the forwarding process of unicast and multicast data packets. We propose a new BP-based protocol named NBM (Next Branch Multicast) to avoid the existing drawbacks. NBM constructs the multicast distribution tree in the forward direction and has a fault-detection and repair mechanism which protects the tree against BPs failures. NBM detects the failure of a higher level BP in the tree sooner than a lower level BP. NBM does not maintain any type of control state in non-branching routers. Our simulation results show that NBM memory requirement for maintaining multicast forwarding states is approximately less than half when compared to the traditional approach. In addition, the NBM tree is more available than the traditional one at least by a factor of 2.