Eliminating bottlenecks in overlay multicast

Authors:
Min Sik Kim;Yi Li;Simon S. Lam
Affiliations:
Department of Computer Sciences, The University of Texas at Austin;Department of Computer Sciences, The University of Texas at Austin;Department of Computer Sciences, The University of Texas at Austin
Venue:
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
Year:
2005

Citing 7
Cited 1

Detecting shared congestion of flows via end-to-end measurement

IEEE/ACM Transactions on Networking (TON)
Robust identification of shared losses using end-to-end unicast probes

ICNP '00 Proceedings of the 2000 International Conference on Network Protocols
A wavelet-based approach to detect shared congestion

Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Overcast: reliable multicasting with on overlay network

OSDI'00 Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4
Modeling Internet topology

IEEE Communications Magazine
A case for end system multicast

IEEE Journal on Selected Areas in Communications
Scribe: a large-scale and decentralized application-level multicast infrastructure

IEEE Journal on Selected Areas in Communications

A wavelet-based approach to detect shared congestion

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently many overlay multicast systems have been proposed due to the limited availability of IP multicast. Because they perform multicast forwarding without support from routers, data may be delivered multiple times over the same physical link, causing a bottleneck. This problem is more serious for applications demanding high bandwidth such as multimedia distribution. Although such bottlenecks can be removed by changing overlay topology, a naïve approach may create bottlenecks in other parts of the network. In this paper, We propose an algorithm that removes all bottlenecks caused by the redundant data delivery of overlay multicast, detecting such bottlenecks using a wavelet-based technique we recently proposed. In a case where the source rate is constant and the available bandwidth of each link is not less than the source rate, our algorithm guarantees that every node receives at the full source rate. Simulation results show that even in a network with a dense receiver population, our algorithm finds a tree that satisfies all the receiving nodes while other heuristic-based approaches often fail.