Introduction to algorithms
Designing broadcasting algorithms in the postal model for message-passing systems
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Approximation Algorithms for Minimum-Time Broadcast
SIAM Journal on Discrete Mathematics
A case for end system multicast (keynote address)
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Dimensioning server access bandwidth and multicast routing in overlay networks
NOSSDAV '01 Proceedings of the 11th international workshop on Network and operating systems support for digital audio and video
IDMaps: a global internet host distance estimation service
IEEE/ACM Transactions on Networking (TON)
Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
New models and algorithms for programmable networks
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue on programmable networks
Message Multicasting in Heterogeneous Networks
SIAM Journal on Computing
Scalable application layer multicast
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Sublogarithmic approximation for telephone multicast: path out of jungle (extended abstract)
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
ALMI: an application level multicast infrastructure
USITS'01 Proceedings of the 3rd conference on USENIX Symposium on Internet Technologies and Systems - Volume 3
New models and algorithms for future networks
IEEE Transactions on Information Theory
A survey of proposals for an alternative group communication service
IEEE Network: The Magazine of Global Internetworking
IEEE Transactions on Parallel and Distributed Systems
Computer Networks: The International Journal of Computer and Telecommunications Networking
SyncCast: synchronized dissemination in multi-site interactive 3D tele-immersion
MMSys '11 Proceedings of the second annual ACM conference on Multimedia systems
On multi-stream multi-source multicast routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
In this paper we investigate the problem of finding minimum-delay application-layer multicast trees, such as the trees constructed in overlay networks. It is accepted that shortest path trees are not a good solution for the problem since such trees can have nodes with very large degree, termed high-load nodes. The load on these nodes makes them a bottleneck in the distribution tree, due to computation load and access link bandwidth constraints. Many previous solutions limited the maximum degree of the nodes by introducing arbitrary constraints. In this work, we show how to directly map the node load to the delay penalty at the application host, and create a new model that captures the trade offs between the desire to select shortest path trees and the need to constrain the load on the hosts. In this model the problem is shown to be NP-hard. We therefore present an approximation algorithm and an alternative heuristic algorithm. Our heuristic algorithm is shown by simulations to be scalable for large group sizes, and produces results that are very close to optimal.