This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
8th International Symposium on Parallel Architectures,Algorithms and Networks (ISPAN'05)
An Efficient Distributed Algorithm for Constructing Delay and Degree-Bounded Application-Level Multicast Tree
Las Vegas, Nevada, USA
December 07-December 09
ISBN: 0-7695-2509-1
ASCII Text
x 
 
Feng Liu, Xicheng Lu, Yuxing Peng, Jingshu Huang, "An Efficient Distributed Algorithm for Constructing Delay and Degree-Bounded Application-Level Multicast Tree," Parallel Architectures, Algorithms, and Networks, International Symposium on, pp. 72-77, 8th International Symposium on Parallel Architectures,Algorithms and Networks (ISPAN'05), 2005.
 
 
BibTex
x
 
@article{ 10.1109/ISPAN.2005.15,
author = {Feng Liu and Xicheng Lu and Yuxing Peng and Jingshu Huang},
title = {An Efficient Distributed Algorithm for Constructing Delay and Degree-Bounded Application-Level Multicast Tree},
journal ={Parallel Architectures, Algorithms, and Networks, International Symposium on},
volume = {0},
year = {2005},
issn = {1087-4089},
pages = {72-77},
doi = {http://doi.ieeecomputersociety.org/10.1109/ISPAN.2005.15},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Parallel Architectures, Algorithms, and Networks, International Symposium on
TI - An Efficient Distributed Algorithm for Constructing Delay and Degree-Bounded Application-Level Multicast Tree
SN - 1087-4089
SP72
EP77
A1 - Feng Liu,
A1 - Xicheng Lu,
A1 - Yuxing Peng,
A1 - Jingshu Huang,
PY - 2005
KW - null
VL - 0
JA - Parallel Architectures, Algorithms, and Networks, International Symposium on
ER -
 
Feng Liu, National Laboratory for Parallel & Distributed Processing,China
Xicheng Lu, National Laboratory for Parallel & Distributed Processing,China
Yuxing Peng, National Laboratory for Parallel & Distributed Processing,China
Jingshu Huang, Purdue University, US
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 wellstudied 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.
Citation:
Feng Liu, Xicheng Lu, Yuxing Peng, Jingshu Huang, "An Efficient Distributed Algorithm for Constructing Delay and Degree-Bounded Application-Level Multicast Tree," ispan, pp.72-77, 8th International Symposium on Parallel Architectures,Algorithms and Networks (ISPAN'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.