Inter-receiver fairness: a novel performance measure for multicast ABR sessions
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Equation-based congestion control for unicast applications
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Enabling conferencing applications on the internet using an overlay muilticast architecture
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Media transcoding for pervasive computing
MULTIMEDIA '01 Proceedings of the ninth ACM international conference on Multimedia
Broadcast federation: an application-layer broadcast internetwork
NOSSDAV '02 Proceedings of the 12th international workshop on Network and operating systems support for digital audio and video
Scalable application layer multicast
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
End-to-end available bandwidth: measurement methodology, dynamics, and relation with TCP throughput
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Transient behaviors of TCP-friendly congestion control protocols
Computer Networks: The International Journal of Computer and Telecommunications Networking
Optimal partitioning of multicast receivers
ICNP '00 Proceedings of the 2000 International Conference on Network Protocols
Evaluation of a Novel Two-Step Server Selection Metric
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
Overcast: reliable multicasting with on overlay network
OSDI'00 Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4
ALMI: an application level multicast infrastructure
USITS'01 Proceedings of the 3rd conference on USENIX Symposium on Internet Technologies and Systems - Volume 3
IEEE Communications Magazine
OCS: An effective caching scheme for video streaming on overlay networks
Multimedia Tools and Applications
MOB: zero-configuration high-throughput multicasting for grid applications
Proceedings of the 16th international symposium on High performance distributed computing
On application-level load balancing in FastReplica
Computer Communications
An optimal discrete rate allocation for overlay video multicasting
Computer Communications
Building heterogeneous peer-to-peer networks: protocol and analysis
IEEE/ACM Transactions on Networking (TON)
Bandwidth fair application layer multicast for multi-party video conference application
CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
GCC'05 Proceedings of the 4th international conference on Grid and Cooperative Computing
Proceedings of the 2013 Research in Adaptive and Convergent Systems
| Hi-index | 0.00 |
Internet radio and television stations require significantbandwidth to support delivery of high quality audio andvideo streams to a large number of receivers. IP multicast isan appropriate delivery model for these applications. However,widespread deployment of IP multicast on the Internetis unlikely in the near future. An alternative is to builda multicast tree in the application layer. Previous studieshave addressed tree construction in the application layer.However, most of them focus on reducing delay. Few systemshave been designed to achieve a high throughput forbandwidth-intensive applications. In this paper, we presenta distributed algorithm to build an application-layer tree.We prove that our algorithm finds a tree such that the averageincoming rate of receivers in the tree is maximized (undercertain network model assumptions). We also describeprotocols that implement the algorithm. For implementationon the Internet, there is a tradeoff between the overheadof available bandwidth measurements and fast convergenceto the optimal tree. This tradeoff can be controlled by tuningsome parameters in our protocols. Our protocols arealso designed to maintain a small number, O(log n), of softstates per node to adapt to network changes and node failures.