By Topic

Resilient data delivery in delay bounded overlay multicast

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)
Dong-Kyun Kim ; Korea Inst. of Sci. & Technol. Inf., Daejeon ; Ki-Sung Yu ; Byung-Hyeon Park ; Sang-Ha Kim

Overlay multicast has been proposed as an alternative scheme to provide one-to-many or many-to-many data delivery on Internet. However, since data delivery is entirely dependent on replications on each group member, if one member node fails, none of its children receives data. Furthermore, the higher the failed node's level is, the more the dead nodes occur. In this paper, we give a detailed framework for resilience in overlay multicast. Unlike previous efforts in providing reliable data delivery, our scheme constructs reliable overlay data delivery tree (DDT) and adaptively reconstructs it based on the number of missed packets while guaranteeing end-to-end delay bound. Through practical simulation results, we analyzed packet delivery ratio, control overhead, end-to-end delay and number of replicated packets

Published in:

Advanced Communication Technology, 2006. ICACT 2006. The 8th International Conference  (Volume:1 )

Date of Conference:

20-22 Feb. 2006