The Community for Technology Leaders
RSS Icon
Issue No.06 - June (2008 vol.19)
pp: 806-820
In peer-to-peer (P2P) live streaming applications such as IPTV, it is natural to accommodate multiple coexisting streaming overlays, corresponding to channels of programming. In the case of multiple overlays, it is a challenging task to design an appropriate bandwidth allocation protocol, such that these overlays efficiently share the available upload bandwidth on peers, media content is efficiently distributed to achieve the required streaming rate, as well as the streaming costs are minimized. In this paper, we seek to design simple, effective and decentralized strategies to resolve conflicts among coexisting streaming overlays in their bandwidth competition, and combine such strategies with network coding based media distribution to achieve efficient multi-overlay streaming. Since such strategies of conflict are game theoretic in nature, we characterize them as a decentralized collection of dynamic auction games, in which downstream peers bid for upload bandwidth at the upstream peers for the delivery of coded media blocks. With extensive theoretical analysis and performance evaluation, we show that these local games converge to an optimal topology for each overlay in realistic asynchronous environments. Together with network coding based media dissemination, these streaming overlays adapt to peer dynamics, fairly share peer upload bandwidth to achieve satisfactory streaming rates, and can be prioritized.
Distributed networks, Distributed application, peer-to-peer streaming, bandwidth auction, multiple overlays
Chuan Wu, Baochun Li, Zongpeng Li, "Dynamic Bandwidth Auctions in Multioverlay P2P Streaming with Network Coding", IEEE Transactions on Parallel & Distributed Systems, vol.19, no. 6, pp. 806-820, June 2008, doi:10.1109/TPDS.2008.30
[1] X. Zhang, J. Liu, B. Li, and T.P. Yum, “CoolStreaming/DONet: A Data-Driven Overlay Network for P2P Live Media Streaming,” Proc. IEEE INFOCOM, 2005.
[2] PPLive, http:/, 2008.
[3] UUSee, http:/, 2008.
[4] M. Wang and B. Li, “Lava: A Reality Check of Network Coding in P2P Live Streaming,” Proc. IEEE INFOCOM, 2007.
[5] P.A. Chou, Y. Wu, and K. Jain, “Practical Network Coding,” Proc. 51st Allerton Conf. Comm., Control and Computing, Oct. 2005.
[6] P. Maymounkov, N. Harvey, and D. Lun, “Methods for Efficient Network Coding,” Proc. 44th Ann. Allerton Conf. Comm., Control, and Computing, 2006.
[7] R. Ahlswede, N. Cai, S.R. Li, and R.W. Yeung, “Network Information Flow,” IEEE Trans. Information Theory, vol. 46, no. 4, pp. 1204-1216, July 2000.
[8] T. Ho, M. Médard, J. Shi, M. Effros, and D. Karger, “On Randomized Network Coding,” Proc. 41st Ann. Allerton Conf. Comm., Control, and Computing, Oct. 2003.
[9] C. Gkantsidis, J. Miller, and P.R. Rodriguez, “Comprehensive View of a Live Network Coding P2P System,” Proc. ACM Internet Measurement Conf. (IMC), 2006.
[10] PlanetLab IPerf, iperf/, 2008.
[11] W. Jiang, D.-M. Chiu, and J.C.S. Lui, “On the Interaction of Multiple Overlay Routing,” Performance Evaluation, vol. 62, nos. 1-4, pp. 229-246, Oct. 2005.
[12] R. Keralapura, C.-N. Chuah, N. Taft, and G. Iannaccone, “Can Coexisting Overlays Inadvertently Step on Each Other,” Proc. 13th Int'l Conf. Network Protocols (ICNP '05), Nov. 2005.
[13] V. Pai, K. Kumar, K. Tamilmani, V. Sambamurthy, and A.E. Mohr, “Chainsaw: Eliminating Trees from Overlay Multicast,” Proc. Fourth Int'l Workshop Peer-to-Peer Systems, Feb. 2005.
[14] N. Magharei and R. Rejaie, “PRIME: Peer-to-Peer Receiver-drIven MEsh-Based Streaming,” Proc. IEEE INFOCOM '07, May 2007.
[15] X. Liao, H. Jin, Y. Liu, L.M. Ni, and D. Deng, “AnySee: Peer-to-Peer Live Streaming,” Proc. IEEE INFOCOM '06, Mar. 2006.
[16] G. Tan and S.A. Jarvis, “Inter-Overlay Cooperation in High-Bandwidth Overlay Multicast,” Proc. 35th Int'l Conf. Parallel Processing (ICPP '06), Aug. 2006.
[17] A. Lazar and N. Semret, “Design and Analysis of the Progressive Second Price Auction for Network Bandwidth Sharing,” Telecomm. Systems, special issue on network eco nomics, 1999.
[18] N. Semret, R.R.-F. Liao, A.T. Campbell, and A.A. Lazar, “Pricing, Provisioning and Peering: Dynamic Markets for Differentiated Internet Services and Implications for Network Interconnections,” IEEE J. Selected Areas in Comm., vol. 18, no. 12, pp. 2499-2513, Dec. 2000.
[19] P. Maillé and B. Tuffin, “Multi-Bid Auctions for Bandwidth Allocation in Communication Networks,” Proc. IEEE INFOCOM '04, Mar. 2004.
[20] M. Bitsaki, G.D. Stamoulis, and C. Courcobetis, “A New Strategy for Bidding in the Network-Wide Progressive Second Price Auction for Bandwidth,” Proc. First Conf. Future Networking Technologies (CoNEXT), 2005.
[21] R.T.B. Ma, S.C.M. Lee, J.C.S. Lui, and D.K.Y. Yau, “A Game Theoretic Approach to Provide Incentive and Service Differentiation in P2P Networks,” Proc. ACM SIGMETRICS/Performance '04, June 2004.
[22] G. Tan and S.A. Jarvis, “A Payment-Based Incentive and Service Differentiation Mechanism for Peer-to-Peer Streaming Broadcast,” Proc. 14th Int'l Workshop Quality of Service (IWQoS '06), June 2006.
[23] P. Golle, K.L. Brown, I. Mironov, and M. Lillibridge, “Incentives for Sharing in Peer-to-Peer Networks,” Proc. Second Int'l Workshop Electronic Commerce, 2001.
[24] K. Lai, M. Feldman, I. Stoica, and J. Chuang, “Incentives for Cooperation in Peer-to-Peer Networks,” Proc. Workshop Economics of Peer-to-Peer Systems, June 2003.
[25] F.P. Kelly, A. Maulloo, and D. Tan, “Rate Control for Communication Networks: Shadow Prices, Proportional Fairness and Stability,” J. Operational Research Soc., vol. 49, no. 3, pp. 237-252, Mar. 1998.
[26] T. Basar and R. Srikant, “Revenue-Maximizing Pricing and Capacity Expansion in a Multi-User Regime,” Proc. IEEE INFOCOM '02, June 2002.
[27] Y. Qiu and P. Marbach, “Bandwidth Allocation in Ad Hoc Networks: A Price-Based Approach,” Proc. IEEE INFOCOM '03, Apr. 2003.
[28] S. Boyd, Convex Optimization. Cambridge Univ. Press, 2004.
12 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool