The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.02 - February (2009 vol.20)
pp: 219-232
Zhen Yang , Beijing University of Posts and Telecommunications, Beijing
Huadong Ma , Beijing University of Posts and Telecommunications, Beijing
ABSTRACT
Today's peer-to-peer (P2P) streaming application periodically suffers from routing hotspots, which are also known as flash crowds. A routing hotspot is typically created by an unanticipated new event that triggers an unanticipated surge of users to request streaming service from some particular peers, temporarily overwhelming the peer's delivery capabilities. In this paper, we propose novel methods that avoid routing hotspots proactively, that is, prior to a congestion event. More specifically, we define an incentive-compatible pricing vector explicitly and show that the hotspot can be avoided if all nodes in the network follow the incentive-compatible pricing policy. In order to apply this mechanism to the P2P streaming distribution applications, we propose an adaptive algorithm for distributed computation of the incentive-compatible pricing vector. The simulation results show that the incentive-compatible pricing mechanism can avoid the routing hotspot effectively.
INDEX TERMS
Hotspot avoiding, game theory, peer-to-peer, streaming service, incentive-compatible.
CITATION
Zhen Yang, Huadong Ma, "Hotspot Avoidance for P2P Streaming Distribution Application: A Game Theoretic Approach", IEEE Transactions on Parallel & Distributed Systems, vol.20, no. 2, pp. 219-232, February 2009, doi:10.1109/TPDS.2008.67
REFERENCES
[1] D.A. Tran et al., “Scalable Media Streaming in Large P2P Networks,” Proc. ACM Int'l Conf. Multimedia (Multimedia '02), pp.247-256, Dec. 2002.
[2] Z. Xiang et al., “Peer-to-Peer Based Multimedia Distribution Service,” IEEE Trans. Multimedia, vol. 6, pp. 343-355, Apr. 2004.
[3] D.A. Tran et al., “A Peer-to-Peer Architecture for Media Streaming,” IEEE J. Selected Areas Comm., vol. 22, pp. 121-133, Jan. 2004.
[4] Z. Liu et al., “On Peer-to-Peer Multimedia Content Access and Distribution,” Proc. IEEE Int'l Conf. Multimedia and Expo (ICME '06), pp. 557-560, 2006.
[5] S. Sen et al., “Analyzing Peer-to-Peer Traffic across Large Networks,” IEEE/ACM Trans. Networking, vol. 12, no. 2, pp. 219-232, Apr. 2004.
[6] S. Androutsellis-Theotokis et al., “A Survey of Peer-to-Peer Content Distribution Technologies,” ACM Computing Surveys, vol. 36, no. 4, pp. 335-371, Dec. 2004.
[7] C. Wu et al., “Optimal Peer Selection for Minimum-Delay Peer-to-Peer Streaming with Rateless Codes,” Proc. ACM Workshop Advances in Peer-to-Peer Multimedia Streaming (P2PMMS '05), pp.69-78, Nov. 2005.
[8] R.T.B. Ma et al., “Incentive and Service Differentiation in P2P Networks: A Game Theoretic Approach,” IEEE/ACM Trans. Networking, vol. 14, no. 5, pp. 978-991, Oct. 2006.
[9] S. Zhong et al., “Sprite: A Simple, Cheat-Proof, Credit-Based System for Mobile Ad Hoc Networks,” Proc. IEEE INFOCOM '03, pp. 1987-1997, 2003.
[10] A.C. Fuqua et al., “Economic Behavior of Peer-to-Peer Storage Networks,” Proc. Second Workshop Economics of Peer-to-Peer Systems (P2P Econ '03), June 2003.
[11] D. Rubenstein et al., “Can Unstructured P2P Protocols Survive Flash Crowds?” IEEE/ACM Trans. Networking, vol. 13, no. 3, pp. 501-512, June 2005.
[12] D. Fudenberg and J. Tirole, Game Theory. MIT Press, 1991.
[13] B. Tuffin, “Charging the Internet without Bandwidth Reservation: An Overview and Bibliography of Mathematical Approaches,” J. Information Science and Eng., vol. 19, no. 5, pp. 765-786, Sept. 2003.
[14] L.A. DaSilva, “Pricing for QoS-Enabled Networks: A Survey,” IEEE Comm. Surveys, vol. 3, no. 2, pp. 2-8, 2000.
[15] J. Altmann, B. Rupp, and P. Varaiya, “Internet Demand under Different Pricing Schemes,” Proc. First Ann. ACM Conf. Electronic Commerce (EC '99), pp. 9-14, Nov. 1999.
[16] J. Shu and P. Varaiya, “Pricing Network Services,” Proc. IEEE INFOCOM '03, vol. 2, pp. 1221-1230, 2003.
[17] P. Marbach, “Priority Service and Max-Min Fairness,” Proc. IEEE INFOCOM '02, vol. 1, pp. 266-275, 2002.
[18] F.P. Kelly, A.K. Maulloo, and D.K.H. Tan, “Rate Control in Communication Networks: Shadow Prices, Proportional Fairness and Stability,” J. Operational Research Soc., vol. 49, pp. 237-252, 1998.
[19] J.K. MacKie-Mason and H.R. Varian, “Pricing the Internet,” Public Access to the Internet, B. Kahin and J. Keller, eds., pp. 269-314, MIT Press, 1995.
[20] P. Reichl, G. Fankhauser, and B. Stiller, “Auction Models for Multiprovider Internet Connections,” Proc. Messung, Modelierung und Bewertung (MMB '99), pp. 71-75, Sept. 1999.
[21] N. Semret and A.A. Lazar, “Design, Analysis and Simulation of the Progressive Second Price Auction for Network Bandwidth Sharing,” Technical Report CU/CTR/TR 487-98-21, Columbia Univ., Apr. 1998.
[22] P. Maillé and B. Tuffin, “Multi-Bid Auctions for Bandwidth Allocation in Communication Networks,” Proc. IEEE INFOCOM '04, Mar. 2004.
[23] N. Semret, “Market Mechanisms for Network Resource Sharing,” PhD dissertation, Center for Telecomm. Research, Columbia Univ., 1999.
[24] H. Chen and Y. Li, “Intelligent Flow Control under Game Theoretic Framework,” Telecommunications Optimization: Heuristic and Adaptive Techniques, D.W. Come, G.D. Smith, and M.J. Oats, eds., Wiley, 2000.
[25] R.J. Gibbens and F.P. Kelly, “Distributed Connection Acceptance Control for a Connectionless Network,” Teletraffic Engineering in a Competitive World, P. Key and D. Smith, eds., pp. 941-952, Elsevier, 1999.
[26] R. Kelly, “The Progressive Second Price Mechanism in a Stochastic Environment,” Netnomics, vol. 5, no. 2, pp. 119-147, Nov. 2003.
[27] R. Kelly, “Multi-Bid versus Progressive Second Price Auctions in a Stochastic Environment,” Proc. Fourth Int'l Workshop Internet Charging and QoS Technology (ICQT '04), pp. 318-327, Oct. 2004.
[28] S. Saroiu, P. Gummadi, and S. Gribble, “A Measurement Study of Peer-to-Peer File Sharing Systems,” Proc. Multimedia Computing and Networking (MMCN '02), pp. 156-170, 2002.
[29] J. Liang, R. Kumar, Y. Xi, and K. Ross, “Pollution in P2P File Sharing Systems,” Proc. IEEE INFOCOM, 2005.
[30] S. Sen, O. Spatscheck, and D. Wang, “Accurate, Scalable In-Network Identification of P2P Traffic Using Application Signatures,” Proc. 13th Int'l Conf. World Wide Web (WWW), 2004.
[31] E. Setton, J. Noh, and B. Girod, “Rate-Distortion Optimized Video Peer-to-Peer Multicast Streaming,” Proc. ACM Workshop Advances in Peer-to-Peer Multimedia Streaming (P2PMMS '05), pp. 39-48, Nov. 2005.
[32] M.J. Osborne and A. Rubenstein, A Course in Game Theory. MIT Press, 1994.
[33] C.H. Papadimitrou, “Algorithms, Games, and the Internet,” Proc. 33rd Ann. ACM Symp. Theory of Computing (STOC), 2001.
[34] Akamai, http: /www.akamai.com, 2008.
[35] V. Pai, P. Druschel, and W. Zwaenepoel, “Flash: An Efficient and Portableweb Server,” Proc. USENIX Ann. Technical Conf. (USENIX '99), June 1999.
[36] M. Welsh, D. Culler, and E. Brewer, “SEDA: An Architecture for Well-Conditioned, Scalable Internet Services,” Proc. 18th ACM Symp. Operating System Principles (SOSP '01), Oct. 2001.
[37] J. Hu and D. Schmidt, “JAWS: A Framework for High Performance Web Servers,” Domain-Specific Application Frameworks: Frameworks Experience by Industry, M. Fayad and R. Johnson, eds., John-Wiley, 1999.
[38] Thttpd, http://www.acme.com/softwarethttpd/, 2008.
[39] X. Chen and J. Heidemann, “Experimental Evaluation of an Adaptive Flash Crowd Protection System,” Technical Report ISI-TR-2003-573, Univ. of Southern California/Information Sciences Inst., July 2003.
[40] Google, http:/www.google.com, 2008.
[41] J. Jung, B. Krishnamurthy, and M. Rabinovich, “Flash Crowds and Denial of Service Attacks: Characterization and Implications for CDNs and Web Sites,” Proc. 11th Int'l Conf. World Wide Web (WWW '02), May 2002.
[42] W. Zhao and H. Schulzrinne, “Predicting the Upper Bound of Web Traffic Volume Using a Multiple Time Scale Approach,” Proc. 12th Int'l Conf. World Wide Web (WWW '03), May 2003.
[43] S. Iyer, A. Rowstron, and P. Druschel, “SQUIRREL: A Decentralized, Peer-to-Peer Web Cache,” Proc. 21st ACM Symp. Principles of Distributed Computing (PODC '02), July 2002.
[44] A. Stavrou, D. Rubenstein, and S. Sahu, “A Lightweight, Robust P2P System to Handle Flash Crowds,” Proc. 10th IEEE Int'l Conf. Network Protocols (ICNP '02), Nov. 2002.
56 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool