Overlay Multicast Trees of Minimal Delay

Authors:
Anton Riabov;Zhen Liu;Li Zhang
Affiliations:
-;-;-
Venue:
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Year:
2004

Citing 0
Cited 7

Capacity-Aware Multicast Algorithms on Heterogeneous Overlay Networks

IEEE Transactions on Parallel and Distributed Systems
Multicast Routing with Delay and Delay Variation Constraints for Collaborative Applications on Overlay Networks

IEEE Transactions on Parallel and Distributed Systems
Worst-Case Delay Control in Multigroup Overlay Networks

IEEE Transactions on Parallel and Distributed Systems
ACOM: Any-source Capacity-constrained Overlay Multicast in Non-DHT P2P Networks

IEEE Transactions on Parallel and Distributed Systems
Minimum DVS gateway deployment in DVS-based overlay streaming

Computer Communications
Performance analysis for overlay multimedia multicast on r- ary tree and m-D mesh topologies

IEEE Transactions on Multimedia
An efficient heuristic algorithm for constructing delay- and degree-bounded application-level multicast tree

GCC'05 Proceedings of the 4th international conference on Grid and Cooperative Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Overlay multicast (or application-level multicast) has become an increasingly popular alternative to IP-supported multicast. End nodes participating in overlay multicast can form a directed tree rooted at the source using existing unicast links. For each receiving node there is always only one incoming link. Very often, nodes can support no more than a fixed number ofoutgoing links due to bandwidth constraints. In this paper, we describe an algorithm for constructing a multicast tree with the objective of minimizing the maximum communication delay (i.e. the longest path in the tree), while satisfying degree constraints at nodes. We show that the algorithm is a constant-factor approximation algorithm. We further prove that the algorithm is asymptotically optimal if the communicating nodes can be mapped into Euclidean space such that the nodes are uniformly distributed in a convex region. We evaluate the performance of the algorithm using randomly generated configurations of up to 5,000,000 nodes.