Skip to main content
SpringerLink
Log in

Stable and scalable universal swarms

  • Published:
Distributed Computing Aims and scope Submit manuscript

Abstract

Hajek and Zhu (Stoch Syst 1(2):246–273, 2011) recently showed that the BitTorrent protocol can become unstable when peers depart immediately after downloading all pieces of a file. In light of this result, Zhou et al. (2011) propose bundling swarms together, allowing peers to exchange pieces across different swarms, and claim that such “universal swarms” can increase BitTorrent’s stability region. In this work, we formally characterize the stability region of universal swarms and show that they indeed exhibit excellent properties. In particular, bundling allows a single seeder with limited upload capacity to serve an arbitrary number of disjoint swarms if the arrival rate of peers in each swarm is lower than the seeder upload capacity. Our result also shows that the stability region is insensitive to peers’ upload capacity, piece selection policies and number of swarms.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

References

  1. Foster, F.: On the stochastic matrices associated with certain queuing processes. Ann. Math. Stat. 24(3), 355–360 (1953)

    Article  MATH  Google Scholar 

  2. Hajek, B.: An exploration of random processes for engineers (December 20, 2011). http://www.ifp.illinois.edu/~hajek/Papers/randomprocesses.html

  3. Hajek, B., Zhu, J.: The missing piece syndrome in peer-to-peer communication. Stoch. Syst. 1(2), 246–273 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  4. Han, J., Chung, T., Kim, S., Kwon, T.T., Kim, H.c., Choi, Y.: How prevalent is content bundling in bittorrent. In: ACM SIGMETRICS (2011)

  5. Kingman, J.: Some inequalities for the queue gi/g/1. Biometrika 49(3–4), 315–324 (1962)

    Article  MATH  MathSciNet  Google Scholar 

  6. Massoulié, L., Vojnović, M.: Coupon replication systems. In: ACM SIGMETRICS (2005)

  7. Mathieu, F., Reynier, J.: Missing piece issue and upload strategies in flashcrowds and p2p-assisted filesharing. In: AICT-ICIW’06, pp. 112–112. IEEE (2006)

  8. Menasché, D.S., de A Rocha, A.A., de Souza e Silva, E.A., Towsley, D., Meri Leäo, R.M.: Implications of peer selection strategies by publishers on the performance of p2p swarming systems. ACM SIGMETRICS 39(3), 55–57 (2011)

  9. Menasché, D.S., Massoulié, L., Towsley, D.: Reciprocity and barter in peer-to-peer systems. In: IEEE INFOCOM, pp. 1505–1513. IEEE (2010)

  10. Menasche, D.S., Rocha, A.A., Li, B., Towsley, D., Venkataramani, A.: Content availability and bundling in swarming systems. In: ACM CoNEXT (2009)

  11. Menasché, D.S., Rocha, A.A., de Souza e Silva, E.A., Leao, R.M., Towsley, D., Venkataramani, A.: Estimating self-sustainability in peer-to-peer swarming systems. Perform. Eval. 67(11), 1243–1258 (2010)

    Article  Google Scholar 

  12. Norros, I., Reittu, H., Eirola, T.: On the stability of two-chunk file-sharing systems. Queueing Syst. 67(3), 183–206 (2011)

  13. Núnez-Queija, R., Prabhu, B.: Scaling laws for file dissemination in p2p networks with random contacts. In: IWQoS 2008, pp. 75–79. IEEE (2008)

  14. Oğuz, B., Anantharam, V., Norros, I.: Stable, distributed p2p protocols based on random peer sampling. In: IEEE Allerton, pp. 915–919 (2012)

  15. Wu, D., Liu, Y., Ross, K.W.: Queuing network models for multi-channel P2P live streaming systems. In: IEEE INFOCOM (2009)

  16. Zhou, X., Ioannidis, S., Massoulié, L.: On the stability and optimality of universal swarms. In: ACM SIGMETRICS (2011)

  17. Zhu, J., Hajek, B.: Stability of a peer-to-peer communication system. IEEE Trans. Inf. Theory (2012)

Download references

Acknowledgments

This work was supported by the National Science Foundation under Grant NSF CCF 10-16959, and was partially funded by the European Commission under the FIRE SCAMPI (FP7- IST-258414) Project.

Author information

Authors and Affiliations

  1. University of Illinois at Urbana-Champaign, 1308 W. Main St, Urbana, IL , 61801, USA

    Ji Zhu

  2. Technicolor, 735 Emerson St, Palo Alto, CA, 94301, USA

    Stratis Ioannidis

  3. Technicolor, 1 rue Jeanne d’Arc, 92443, Issy les Moulineaux, France

    Nidhi Hegde

  4. MSR-INRIA, 1 rue Honor d’Estienne d’Orves, 91120, Palaiseau, France

    Laurent Massoulié

Authors
  1. Ji Zhu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stratis Ioannidis
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Nidhi Hegde
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Laurent Massoulié
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ji Zhu.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhu, J., Ioannidis, S., Hegde, N. et al. Stable and scalable universal swarms. Distrib. Comput. 28, 391–406 (2015). https://doi.org/10.1007/s00446-014-0228-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00446-014-0228-1

Keywords

Search

Navigation