Skip to main content
Springer Nature Link
Log in

Optimizing P2P streaming throughput under peer churning

  • Regular Paper
  • Published:
Multimedia Systems Aims and scope Submit manuscript

Abstract

High-throughput P2P streaming relies on peer selection, the strategy a peer uses to select other peer(s) as its parent(s) of streaming. Although this problem has been thoroughly investigated in the classical optimization framework under static settings, it still remains unaddressed as how to sustain throughput competitive to the optimum under highly dynamic peer churning. To accommodate such peer dynamics, we extend the classical optimization framework and propose a distributed online peer selection algorithm. This basic algorithm is further extended to a variety of settings commonly seen in operational P2P networks, such as multi-parent streaming, admission control, delay constraint, etc. We prove approximation bound of our algorithm to the optimal throughput. Through evaluation under different topological setups and peer churning sequences, we show that our solution can consistently deliver competitive throughput, which greatly outperforms its theoretical bound.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Padmanabhan, V.N., Wang, H.J., Chou, P.A., Sripanidkulchai, K.: Distributing streaming media content using cooperative networking. In: NOSSDAV ’02: Proceedings of the 12th International Workshop on Network and Operating Systems Support for Digital Audio and Video, pp. 177–186. ACM Press, New York (2002)

  2. Castro, M., Druschel, P., Kermarrec, A.M., Nandi, A., Rowstron, A., Singh, A.: Splitstream: High-bandwidth multicast in cooperative environments. In: Proceedings of ACM Symposium on Operating Systems Principles (SOSP), October (2003)

  3. Kostic, D., Rodriguez, A., Albrecht, J., Vahdat, A.: Bullet: High bandwidth data dissemination using an overlay mesh. In: Proceedings of ACM Symposium on Operating Systems Principles (SOSP) (2003)

  4. Cui, Y., Cao, Y., Dai, L., Xue, Y.: Optimizing p2p streaming throughput under peer churning. In: Vanderbilt University Institute of Software Integrated Systems Technical Report ISIS-08-905 (2007)

  5. “Pplive”. http://pplive.com

  6. “Uusee”. http://uusee.com

  7. Chu, Y., Rao, R., Zhang, H.: A case for end system multicast. In: Proceedings of ACM SIGMETRICS (2000)

  8. Jannotti, J., Gifford, D.K., Johnson, K.L., Kaashoek, M.F., O’Toole, J.W.: Overcast: Reliable multicasting with an overlay network. In: Proceedings of Operating Systems Design and Implementation (OSDI) (2000)

  9. Tran, D., Hua, K., Sheu, S.: Zigzag: An efficient peer-to-peer scheme for media streaming. In: Proceedings of IEEE INFOCOM (2003)

  10. Banerjee, S., Bhattacharjee, B., Kommareddy, C.: Scalable application layer multicast. In: Proceedings of ACM SIGCOMM, August (2002)

  11. Hefeeda, M., Habib, A., Xu, D., Bhargava, B., Botev, B.: Collectcast: a peer-to-peer service for media streaming. ACM/Springer Multimedia Syst. J. 11(1), (2005)

  12. Cui, Y., Nahrstedt, K.: Layered peer-to-peer streaming. In: Proceedings of ACM NOSSDAV (2003)

  13. Zhang, X., Liu, J., Li, B., Yum, Y.S.P.: Coolstreaming/donet: a data-driven overlay network for peer-to-peer live media streaming. In: INFOCOM 2005: 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE, vol. 3, pp. 2102–2111 (2005)

  14. Liao, X., Jin, H., Liu, Y., Ni, L.M., Deng, D.: Anysee: peer-to-peer live streaming. In: Proceedings of INFOCOM, April (2006)

  15. Liu, L., Zimmermann, R.: Active: Adaptive low-latency peer-to-peer streaming. In: Proceedings of SPIE/ACM Multimedia Computing and Networking (2005)

  16. Dai, L., Cui, Y., Xue, Y.: On scalability of proximity-aware p2p streaming. In: IEEE INFOCOM Mini-Symposium (2007)

  17. Kwon, M., Fahmy, S.: Topology-aware overlay networks for group communication. In: ACM NOSSDAV (2002)

  18. Ratnasamy, S., Handley, M., Karp, R., Shenker, S.: Topologically-aware overlay construction and server selection. In: IEEE INFOCOM (2002)

  19. Aspnes J., Azar Y., Fiat A., Plotkin S., Waarts O.: On-line routing of virtual circuits with applications to load balancing and machine scheduling. J. ACM 44, 486–504 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  20. Awerbuch, B., Azar, Y., Plotkin, S., Waarts, O.: Competitive routing of virtual circuits with unknown duration. In: ACM-SIAM Symposium on Discrete Algorithms (SODA) (1995)

  21. Awerbuch, B., Azar, Y., Plotkin, S.: Throughput-competitive on-line routing. In: IEEE Conference on Foundation of Computer Science (FOCS) (1993)

  22. Goel, A., Henzinger, M., Plotkin, S.: Online throughput-competitive algorithm for multicast routing and admission control. In: ACM-SIAM Symposium on Discrete Algorithms (SODA) (1998)

  23. Young, A., Chen, J., Ma, Z., Krishnamurthy, A., Peterson, L., Wang, R.Y.: Overlay mesh construction using interleaved spanning trees. In: IEEE INFOCOM (2004)

  24. Deo N.: Graph Theory with Applications to Engineering and Computer Science. Prentice-Hall, Englewood Cliffs (1994)

    Google Scholar 

  25. Grotschel M., Lovasz L., Schrijver A.: Geometric Algorithms and Combinatorial Optimizations. Springer, Heidelberg (1993)

    Google Scholar 

  26. Cui, Y., Li, B., Nahrstedt, K.: On achieving optimized capacity utilization in application overlahy networks with multiple competing sessions. In: Proceedings of ACM Symposium on Parallel Algorithms and Architectures (2004)

  27. Jacobson, V.: Pathchar, http://www.caida/org/tools/utilities/others/pathchar

  28. Medina, A., Lakhina, A., Matta, I., Byers, J.: Brite: An approach to universal topology generation. In: Proceedings of IEEE MASCOTS (2001)

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Vanderbilt University, Nashville, TN, 37235, USA

    Yi Cui, Yanchuan Cao, Liang Dai & Yuan Xue

Authors
  1. Yi Cui
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yanchuan Cao
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Liang Dai
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Yuan Xue
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yi Cui.

Additional information

Communicated by R. Steinmetz.

This work was supported by NSF award 0643488, Vanderbilt Discovery grant, and a gift from Microsoft Research. Views and conclusions of this paper are those of authors, which should not be interpreted as representing the official policies, either expressed or implied, of the funding agencies.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cui, Y., Cao, Y., Dai, L. et al. Optimizing P2P streaming throughput under peer churning. Multimedia Systems 15, 83–99 (2009). https://doi.org/10.1007/s00530-008-0148-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00530-008-0148-7

Keywords