By Topic

An efficient distributed algorithm for constructing delay- and degree-bounded application-level multicast tree

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
$33 $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)
Feng Liu ; Nat. Lab. for Parallel & Distributed Process., Changsha, China ; J. Huang ; Xicheng Lu ; Yuxing Peng

In this paper we investigate the problem of finding a delay- and degree-bounded maximum sum of nodes application level multicast tree. We then proved the problem is NP-hard, and its relationship with the well-studied degree-bounded minimum maximum-delay multicast tree problem. We propose a distributed algorithm - OverStream, which adopts PPAF heuristic for father node to choose optimal child nodes based on multiple network parameters. Simulation results show that our algorithm is better than OMNI, SpreadIt, HMTP, and Zigzag in general.

Published in:

8th International Symposium on Parallel Architectures,Algorithms and Networks (ISPAN'05)

Date of Conference:

7-9 Dec. 2005