Paper Info
Title
MeshTree: Reliable Low Delay Degree-bounded Multicast Overlays
Abstract
We study decentralised low delay degree-constrained overlay multicast tree construction for single source real-time applications. This optimisation problem is NP-hard even if computed centrally. We identify two problems in traditional distributed solutions, namely the greedy problem and delay-cost trade-off. By offering solutions to these problems, we propose a new self-organising distributed tree building protocol called MeshTree. The main idea is to embed the delivery tree in a degree-bounded mesh containing many low cost links. Our simulation results show that MeshTree is comparable to the centralised Compact Tree algorithm, and always outperforms existing distributed solutions in delay optimisation. In addition, it generally yields trees with lower cost and traf?c redundancy.
Year
DOI
Venue
2005
10.1109/ICPADS.2005.183
ICPADS (2)
Keywords
Field
DocType
multicast overlays,tree building protocol,centralised compact tree algorithm,degree-bounded mesh,greedy problem,delay optimisation,low cost link,optimisation problem,reliable low delay degree-bounded,lower cost,degree-constrained overlay multicast tree,delivery tree,np hard problem,water resources,computational complexity,routing,redundancy,computer programming,real time systems,videoconference,unicast
Source-specific multicast,Protocol Independent Multicast,Computer science,Xcast,Computer network,Real-time computing,Pragmatic General Multicast,Overlay multicast,Reliable multicast,Distance Vector Multicast Routing Protocol,Multicast,Distributed computing
Conference
ISBN
Citations 
PageRank 
0-7695-2281-5-02
0
0.34
References 
Authors
13
3
Name
Order
Citations
PageRank
Su-Wei Tan1132.01
Gill Waters2272.77
John S. Crawford3151.83