首页 | 本学科首页   官方微博 | 高级检索  
     


Improving the multicast state scalability in internet routers by integrating hash algorithm with recursive unicast
Authors:S.A. Al-Talib   B.M. Ali   S. Khatun  S. Subramaniam
Affiliation:aDepartment of Computer and Communications Systems, Universiti Putra Malaysia, 43400 Serdang-Selangor, Malaysia;bDepartment of Communication Technology and Networks, Universiti Putra Malaysia, 43400 Serdang-Selangor, Malaysia
Abstract: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.
Keywords:Recursive unicast   Hash algorithm   Multicast service
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号