Advertisement

Peer-to-Peer Networking and Applications

, Volume 8, Issue 3, pp 493–500 | Cite as

Pre-allocation based flash crowd mitigation algorithm for large-scale content delivery system

  • Dan HuangEmail author
  • Min Zhang
  • Yi Zheng
  • Changjia Chen
  • Yan Huang
Article

Abstract

A burst of requests may starve the upload capacity of server and degrade the Quality of Service (QoS) when a popular or time-critical content is released in content delivery system. With an enormous volume of popular content available in the network, as well as the growing size of online users, the previous improvement of download protocol is far from enough to handle the flash crowd in large-scale system. In this paper, a novel flash crowd mitigation algorithm called Peer Assisted Pre-allocation (PAPA) is proposed from a new perspective, in which “proactive” strategies are provided to handle sudden workload of the system. Through numerical simulation and practical experiment in download platform of Tencent, it is proved that benefited from the collaboration of servers and helpers, PAPA is able to save the peak server bandwidth by over 30 % and thus greatly reduce the operating costs of system.

Keywords

Content delivery Flash crowd Pre-allocation Fluid model 

Notes

Acknowledgments

This work was supported in part by the National Science Foundation of China under Grant No. 61271199 and the Fundamental Research Funds in Beijing Jiaotong University under Grant No. W11JB00630.

References

  1. 1.
    Yu T, Tian C, Jiang H, Liu W (2011) Measurements and analysis of an unconstrained user generated content system. In: IEEE international conference on communications (ICC). IEEE, pp 1–5Google Scholar
  2. 2.
    Shaikh A, Sahu S, Rosu MC, Shea M, Saha D (2006) On demand platform for online games. IBM Syst J 45(1):7–19CrossRefGoogle Scholar
  3. 3.
    Huang Y, Fu TZJ, Chiu DM, Lui J, Huang C (2008) Challenges, design and analysis of a large-scale p2p-vod system. In: ACM SIGCOMM computer communication review, vol 38. ACM, pp 375–388Google Scholar
  4. 4.
    Legout A, Urvoy-Keller G, Michiardi P (2006) Rarest first and choke algorithms are enough. In: Proceedings of the 6th ACM SIGCOMM conference on internet measurement. ACM, pp 203–216Google Scholar
  5. 5.
    Zhang B, Iosup A, Pouwelse J, Epema D (2011) Identifying, analyzing, and modeling flashcrowds in bittorrent. In: IEEE international conference on peer-to-peer computing (P2P). IEEE, pp 240–249Google Scholar
  6. 6.
    D’Acunto L, Vinkó T, Sips H (2011) Bandwidth allocation in bittorrent-like vod systems under flashcrowds. In: IEEE international conference on peer-to-peer computing (P2P). IEEE, pp 192–201Google Scholar
  7. 7.
    Wu CJ, Li CY, Yang KH, Ho JM, Chen MS (2009) Time-critical data dissemination in cooperative peer-to-peer systems. In: Global Telecommunications Conference. (GLOBECOM 2009). IEEE, pp 1–6Google Scholar
  8. 8.
    Huang Y, Li Z, Liu G, Dai Y (2011) Cloud download: using cloud utilities to achieve high-quality content distribution for unpopular videos. In: Proceedings of the 19th ACM international conference on multimedia, MM ’11Google Scholar
  9. 9.
    Yingying X, Ao N, Huang D, Zhao Y, Changjia C (2013) Advanced user-based interaction model in cloud. China Commun 10(4):126–134CrossRefGoogle Scholar
  10. 10.
    Koren Y (2008) Factorization meets the neighborhood: a multifaceted collaborative filtering model. In: Proceedings of the 14th ACM SIGKDD international conference on knowledge discovery and data mining. ACM, pp 426–434Google Scholar
  11. 11.
    Tan CW, Chiu DM, Lui JCS, Yau DKY (2007) A distributed throttling approach for handling high bandwidth aggregates. IEEE Trans Parallel Distrib Syst 18(7):983–995CrossRefGoogle Scholar
  12. 12.
    Xie L, Smith P, Hutchison D, Banfield M, Leopold H, Jabbar A, Sterbenz JPG (2008) From detection to remediation: a self-organized system for addressing flash crowd problems. In: IEEE international conference on communications. ICC’08. IEEE, pp 5809–5814Google Scholar
  13. 13.
    Chen Y, Zhang B, Chen C (2011) Modeling and performance analysis of p2p live streaming systems under flash crowds. In: IEEE international conference on communications (ICC). IEEE, pp 1–5Google Scholar
  14. 14.
    Chang L, Pan J (2012) Towards the optimal caching strategies of peer-assisted vod systems with hd channels. In: 2012 20th IEEE international conference on network protocols (ICNP). IEEE, pp 1–10Google Scholar
  15. 15.
    Weijie W, Lui JCS (2012) Exploring the optimal replication strategy in p2p-vod systems: characterization and evaluation. IEEE Trans Parallel Distrib Syst 23(8):1492–1503CrossRefGoogle Scholar
  16. 16.
    Qiu D, Srikant R (2004) Modeling and performance analysis of bittorrent-like peer-to-peer networks. In: ACM SIGCOMM computer communication review, vol 34. ACM, pp 367–378Google Scholar
  17. 17.
    Tencent (2013) The qqcyclone platform. http://xf.qq.com/

Copyright information

© Springer Science+Business Media New York 2014

Authors and Affiliations

  • Dan Huang
    • 1
    Email author
  • Min Zhang
    • 2
  • Yi Zheng
    • 3
  • Changjia Chen
    • 4
  • Yan Huang
    • 5
  1. 1.Network and Information Security Research DepartmentElectronic Technology Information Research Institute, MIITBeijingChina
  2. 2.Technology Innovation CenterChina TelecomBeijingChina
  3. 3.Network Technology Research InstituteChina United Network Communications Corporation LimitedBeijingChina
  4. 4.School of Electronic and Information EngineeringBeijing Jiaotong UniversityBeijingChina
  5. 5.Tencent ResearchShanghaiChina

Personalised recommendations