Multicast routing in datagram internetworks and extended LANs
ACM Transactions on Computer Systems (TOCS)
IP multicast channels: EXPRESS support for large-scale single-source applications
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Enabling the Progressive Multicast Service Deployment
ISCC '01 Proceedings of the Sixth IEEE Symposium on Computers and Communications
Providing multicast through recursive unicast
IEEE Communications Magazine
Deployment issues for the IP multicast service and architecture
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
In this article, a new protocol called REHASH has been devised that gracefully integrates the idea of recursive unicast with hash algorithm to achieve scalable multicast for improved performance. In this model, data packets have unicast destination addresses. Therefore, REHASH supports pure unicast routers transparently. The key idea of the proposed protocol is to simplify address allocation and implements multicast distribution using recursive unicast hash trees. The branching nodes recursively create packet copies to implement the distribution. REHASH adopts the source-specific channel abstraction to tackle the address allocation and the sender access control problems. Consequently, it provides best routes and is suitable for including QoS and authentication parameters inside hash tree construction algorithm. Additionally, REHASH tree management provides enhanced tree stability in the presence of group dynamics.