Optimal distribution tree for Internet streaming media Export

@proceedings{citeulike:345061, abstract = {Internet radio and television stations require significant bandwidth to support delivery of high quality audio and video streams to a large number of receivers. IP multicast is an appropriate delivery model for these applications. However, widespread deployment of IP multicast on the Internet is unlikely in the near future. An alternative is to build a multicast tree in the application layer Previous studies have addressed tree construction in the application layer However most of them focus on reducing delay. Few systems have been designed to achieve a high throughput for bandwidth-intensive applications. In this paper we present a distributed algorithm to build an application-layer tree. We prove that our algorithm finds a tree such that the average incoming rate of receivers in the tree is maximized (under certain network model assumptions). We also describe protocols that implement the algorithm. For implementation on the Internet, there is a tradeoff between the overhead of available bandwidth measurements and fast convergence to the optimal tree. This tradeoff can be controlled by tuning some parameters in our protocols. Our protocols are also designed to maintain a small number, O(log n), of soft states per node to adapt to network changes and node failures.}, author = {Kim, Min S. and Lam, S. S. and Lee, Dong Y.}, citeulike-article-id = {667906}, citeulike-linkout-0 = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1203458}, journal = {Distributed Computing Systems, 2003. Proceedings. 23rd International Conference on}, keywords = {multicast, streaming}, pages = {116--125}, posted-at = {2006-05-24 10:18:11}, priority = {2}, title = {Optimal distribution tree for Internet streaming media}, url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1203458}, year = {2003} }

TY - CONF ID - citeulike:345061 L3 - citeulike-article-id:667906 N2 - Internet radio and television stations require significant bandwidth to support delivery of high quality audio and video streams to a large number of receivers. IP multicast is an appropriate delivery model for these applications. However, widespread deployment of IP multicast on the Internet is unlikely in the near future. An alternative is to build a multicast tree in the application layer Previous studies have addressed tree construction in the application layer However most of them focus on reducing delay. Few systems have been designed to achieve a high throughput for bandwidth-intensive applications. In this paper we present a distributed algorithm to build an application-layer tree. We prove that our algorithm finds a tree such that the average incoming rate of receivers in the tree is maximized (under certain network model assumptions). We also describe protocols that implement the algorithm. For implementation on the Internet, there is a tradeoff between the overhead of available bandwidth measurements and fast convergence to the optimal tree. This tradeoff can be controlled by tuning some parameters in our protocols. Our protocols are also designed to maintain a small number, O(log n), of soft states per node to adapt to network changes and node failures. JF - Distributed Computing Systems, 2003. Proceedings. 23rd International Conference on EP - 125 TI - Optimal distribution tree for Internet streaming media SP - 116 KW - multicast KW - streaming AU - Kim, Min AU - Lam, SS AU - Lee, Dong PY - 2003/// UR - http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1203458 ER -