By Topic

REHASH: integrating recursive unicast with Hash algorithm to provide multicast service to receivers

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Ali, B.M. ; Dept. of Comput. & Commun. Syst., Univ. Putra Malaysia, Selangor, Malaysia ; Al-Talib, S.A. ; Khatun, S. ; Subramaniam, S.

A new protocol called REHASH has been devised in this paper that gracefully integrates the idea of recursive unicast with Hash algorithm to achieve scalable multicast for overall performance improvement. 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 implement 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.

Published in:

Networks, 2005. Jointly held with the 2005 IEEE 7th Malaysia International Conference on Communication., 2005 13th IEEE International Conference on  (Volume:1 )

Date of Conference:

16-18 Nov. 2005