This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Optimal Resource Allocation in Overlay Multicast
August 2006 (vol. 17 no. 8)
pp. 808-823
Yi Cui, IEEE
Yuan Xue, IEEE

Abstract—Although initially proposed as the deployable alternative to IP multicast, the overlay network actually revolutionizes the way network applications can be built. In this paper, we study the rate allocation problem in overlay-based multirate multicast, which can be understood as a utility-based resource allocation problem. Each receiver is associated with a utility defined as a function of its streaming rate. Our goal is to maximize the aggregate utility of all receivers, subject to network capacity constraint and data constraint. The latter constraint is unique in overlay multicast, mainly due to the dual role of end hosts as both receivers and senders. We use a price-based approach to address this problem. Two types of prices, network price and data price, are generated with regard to the two constraints of the problem. A distributed algorithm is proposed, where each receiver adjusts its flow rate according to the associated network price and data price. The algorithm is proved to converge to the optimal point, where the aggregate utility of all receivers is maximized. We implement our algorithm using an end-host-based protocol. Our protocol purely relies on the coordination of end hosts to accomplish tasks originally assigned to network routers, which makes it directly deployable to the existing network infrastructure.

[1] Y. Cui, Y. Xue, and K. Nahrstedt, “Optimal Resource Allocation in Overlay Multicast,” Proc. Int'l Conf. Network Protocols (ICNP '03), 2003.
[2] Y. Chu, R. Rao, and H. Zhang, “A Case for End System Multicast,” Proc. ACM SIGMETRICS, 2000.
[3] S. McCanne, V. Jacobson, and M. Vetterli, “Receiver-Driven Layered Multicast,” Proc. ACM SIGCOMM, 1996.
[4] D. Rubenstein, J. Kurose, and M. Vetterli, “The Impact of Multicast Layering on Network Fairness,” Proc. ACM SIGCOMM, 1999.
[5] Y. Cui and K. Nahrstedt, “Layered Peer-to-Peer Streaming,” Proc. ACM Int'l Workshop Network and Operating Systems Support for Digital Audio and Video (NOSSDAV), 2003.
[6] E. Amir, S. McCanne, and R. Katz, “An Active Service Framework and Its Application to Real-Time Multimedia Transcoding,” Proc. ACM SIGCOMM Conf., 1998.
[7] F. Kelly, “Charging and Rate Control for Elastic Traffic,” European Trans. Telecomm., vol. 8, no. 1, 1997.
[8] F. Kelly, A. Maulloo, and D. Tan, “Rate Control for Communication Networks: Shadow Prices, Proportional Fairness and Stability,” J. Operations Research Soc., vol. 49, no. 3, 1998.
[9] S. Low and D. Lapsley, “Optimization Flow Control I: Basic Algorithm and Convergence,” IEEE/ACM Trans. Networking, vol. 7, no. 6, 1999.
[10] S. Kunniyur and R. Srikant, “End-to-End Congestion Control: Utility Functions, Random Losses, and ECN Marks,” ACM/IEEE Trans. Networking, Oct. 2003.
[11] K. Kar, S. Sarkar, and L. Tassiulas, “Optimization Based Rate Control for Multirate Multicast Sessions,” Proc. IEEE INFOCOM Conf., 2001.
[12] K. Kar, S. Sarkar, and L. Tassiulas, “A Low-Overhead Rate Control Algorithms for Maximizing Aggregate Receiver Utility for Multirate Multicast Sessions,” Proc. SPIE Conf. Information Technology Comm. Services, 2001.
[13] Y. Cui, Y. Xue, and K. Nahrstedt, “Max-Min Overlay Multicast: Rate Allocation and Tree Construction,” ACM/IEEE Trans. Networking, Oct. 2003.
[14] Y. Cui, Y. Xue, and K. Nahrstedt, “Optimal Resource Allocation in Overlay Multicast,” Technical Report UIUCDCS-R-2003-2373/UILU-ENG-2003-1760, Univ. of Illinois at Urbana-Champaign, 2003.
[15] D. Bertsekas and J. Tsitsiklis, Parallel and Distributed Computation. Prentice-Hall, 1989.
[16] D. Bertsekas, Nonlinear Programming. Athena Scientific, 1995.
[17] V. Paxson, “End-to-End Routing Behavior in the Internet,” Proc. ACM SIGCOMM Conf., 1996.
[18] V. Jacobson, Pathchar, http://www.caida.org/tools/utilities/others pathchar, 1997.
[19] C. Dovrolis, P. Ramanathan, and D. Moore, “What Do Packet Dispersion Techniques Measure?” Proc. IEEE INFOCOM Conf., 2001.
[20] A. Medina, A. Lakhina, I. Matta, and J. Byers, “BRITE: An Approach to Universal Topology Generation,” Proc. IEEE Int'l Symp. Modeling, Analysis and Simulation of Computer and Telecomm. Systems (MASCOTS), 2001.
[21] I. Stoica, D. Adkins, S. Zhuang, S. Shenker, and S. Surana, “Internet Indirection Infrastructure,” Proc. ACM SIGCOMM Conf., Aug. 2002.
[22] D. Anderson, H. Balakrishnan, M. Kaashoek, and R. Morris, “Resilient Overlay Network,” Proc. ACM Symp. Operating Systems Principles (SOSP), 2001.
[23] V. Padmanabhan, H. Wang, P. Chou, and K. Sripanidkulchai, “Distributing Streaming Media Content Using Cooperative Networking,” Proc. ACM Int'l Workshop Network and Operating Systems Support for Digital Audio and Video (NOSSDAV), 2002.
[24] H. Zhang, “Service Disciplines for Guaranteed Performance Service in Packet-Scheduling Networks,” Proc. IEEE, Oct. 1995.
[25] A. Mas-Colell and M.D. Whinston, Microeconomic Theory. Oxford Univ. Press, 1995.
[26] D. Kostic, A. Rodriguez, J. Albrecht, and A. Vahdat, “Bullet: High Bandwidth Data Dissemination Using an Overlay Mesh,” Proc. ACM Symp. Operating Systems Principles (SOSP), Oct. 2003.
[27] M. Castro, P. Druschel, A.M. Kermarrec, A. Nandi, A. Rowstron, and A. Singh, “SplitStream: High-Bandwidth Multicast in Cooperative Environments,” Proc. ACM Symp. Operating Systems Principles (SOSP), Oct. 2003.
[28] X. Zhang, J. Liu, B. Li, and T.S.P. Yum, “DONet: A Data-Driven Overlay Network for Efficient Live Media Streaming,” Proc. IEEE INFOCOM Conf., Mar. 2005.

Index Terms:
Multicast, algorithm/protocol design and analysis, nonlinear programming.
Citation:
Yi Cui, Yuan Xue, Klara Nahrstedt, "Optimal Resource Allocation in Overlay Multicast," IEEE Transactions on Parallel and Distributed Systems, vol. 17, no. 8, pp. 808-823, Aug. 2006, doi:10.1109/TPDS.2006.108
Usage of this product signifies your acceptance of the Terms of Use.