Skip to main content

Advertisement

SpringerLink
Log in
Menu
Find a journal Publish with us
Search
Cart
Book cover

International Conference on Research in Networking

NETWORKING 2012: NETWORKING 2012 pp 71–83Cite as

  1. Home
  2. NETWORKING 2012
  3. Conference paper
A Task-Based Model for the Lifespan of Peer-to-Peer Swarms

A Task-Based Model for the Lifespan of Peer-to-Peer Swarms

  • Yong Zhao20,21,22,
  • Zhibin Zhang21,
  • Ting He23,
  • Alex X. Liu24,
  • Li Guo20 &
  • …
  • Binxing Fang20 
  • Conference paper
  • 981 Accesses

Part of the Lecture Notes in Computer Science book series (LNCCN,volume 7290)

Abstract

Peer-to-Peer (P2P) techniques are broadly adopted in modern applications such as Xunlei and Private Tracker [1,2]. To address the problem of service availability, techniques such as bundling and implicit uploading are suggested to increase the swarm lifespan, i.e., the duration between the birth and the death of a swarm, by motivating or even forcing peers to make more contributions. In these systems, it is common for a peer to join a swarm repeatedly, which can introduce substantial bias for lifespan modeling and prediction. In this paper, we present a mathematical model to study the lifespan of a P2P swarming system in the presence of multi-participation. We perform evaluations on three traces and a well-known simulator. The result demonstrates that our model is more accurate than previous ones.

Keywords

  • peer-to-peer
  • modeling
  • evolution
  • lifespan

Download conference paper PDF

References

  1. Zhao, Y., Zhang, Z., Wang, Y., Guo, L., Fang, B.: Performance evaluation of xunlei peer-to-peer network: A measurement study. In: 2011 IEEE Consumer Communications and Networking Conference (CCNC), pp. 257–261 (January 2011)

    Google Scholar 

  2. Zhang, C., Dhungel, P., Wu, D., Liu, Z., Ross, K.W.: Bittorrent darknets. In: 2010 Proceedings IEEE INFOCOM, pp. 1–9 (2010)

    Google Scholar 

  3. Mochalski, K., Schulze, H.: Internet study (2008/2009), http://www.ipoque.com/resources/internet-studies/

  4. Sun, Y., Liu, F., Li, B., Li, B., Zhang, X.: Fs2you: Peer-assisted semi-persistent online storage at a large scale. In: INFOCOM 2009, pp. 873–881. IEEE (April 2009)

    Google Scholar 

  5. Qiu, D., Srikant, R.: Modeling and performance analysis of bittorrent-like peer-to-peer networks. In: SIGCOMM 2004: Proceedings of the 2004 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, pp. 367–378. ACM, New York (2004)

    CrossRef  Google Scholar 

  6. Guo, L., Chen, S., Xiao, Z., Tan, E., Ding, X., Zhang, X.: A performance study of bittorrent-like peer-to-peer systems. IEEE Journal on Selected Areas in Communications 25(1), 155–169 (2007)

    CrossRef  Google Scholar 

  7. Stutzbach, D., Rejaie, R.: Understanding churn in peer-to-peer networks. In: IMC 2006: Proceedings of the 6th ACM SIGCOMM Conference on Internet Measurement, pp. 189–202. ACM, New York (2006)

    CrossRef  Google Scholar 

  8. Menasche, D.S., Rocha, A.A.A., Li, B., Towsley, D., Venkataramani, A.: Content availability and bundling in swarming systems. In: CoNEXT 2009: Proceedings of the 5th International Conference on Emerging Networking Experiments and Technologies, pp. 121–132. ACM, New York (2009)

    CrossRef  Google Scholar 

  9. Chen, X., Jiang, Y., Chu, X.: Measurements, analysis and modeling of private trackers. In: IEEE P2P 2010 (2010)

    Google Scholar 

  10. Kaune, S., Rumiandn, R.C., Tyson, G., Mauthe, A., Guerrero, C., Steinmetz, R.: Unraveling bittorrent’s file unavailability: Measurements and analysis. In: 2010 IEEE Tenth International Conference on Peer-to-Peer Computing (P2P), pp. 1–9 (2010)

    Google Scholar 

  11. Kaune, S., Tyson, G., Pussep, K., Mauthe, A., Steinmetz, R.: The seeder promotion problem: Measurements, analysis and solution space. In: 2010 Proceedings of 19th International Conference on Computer Communications and Networks (ICCCN), pp. 1–8 (2010)

    Google Scholar 

  12. Rahman, R., Vinkó, T., Hales, D., Pouwelse, J., Sips, H.: Design space analysis for modeling incentives in distributed systems. In: Proceedings of the ACM SIGCOMM 2011 Conference on SIGCOMM, SIGCOMM 2011, pp. 182–193. ACM, New York (2011)

    CrossRef  Google Scholar 

  13. Spanier, J., Oldham, K.B.: An atlas of functions. Taylor & Francis/Hemisphere, Bristol (1987)

    MATH  Google Scholar 

  14. Bhagwan, R., Savage, S., Voelker, G.: Understanding Availability. In: Kaashoek, F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735, pp. 256–267. Springer, Heidelberg (2003)

    CrossRef  Google Scholar 

  15. Katsaros, K., Kemerlis, V.P., Stais, C., Xylomenos, G.: A bittorrent module for the omnet++ simulator. In: IEEE International Symposium on Modeling, Analysis Simulation of Computer and Telecommunication Systems, MASCOTS 2009, pp. 1–10 (September 2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China

    Yong Zhao, Li Guo & Binxing Fang

  2. Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China

    Yong Zhao & Zhibin Zhang

  3. Graduate University, Chinese Academy of Sciences, Beijing, China

    Yong Zhao

  4. IBM T.J. Watson Research Center, Hawthorne, NY, USA

    Ting He

  5. Department of Computer Science and Engineering, Michigan State University, MI, USA

    Alex X. Liu

Authors
  1. Yong Zhao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhibin Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ting He
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Alex X. Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Li Guo
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Binxing Fang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Telecommunications Engineering, Czech Technical University in Prague, Technicka 2, 166 27, Prague 6, Czech Republic

    Robert Bestak & Lukas Kencl & 

  2. Bell Labs, Alcatel-Lucent, 600 Mountain Avenue, 07974-0636, Murray Hill, NJ, USA

    Li Erran Li

  3. Instituto IMDEA Networks, Avenida del Mar Mediterraneo 22, 28918, Leganes (Madrid), Spain

    Joerg Widmer

  4. Tsinghua-ChinaCache Joint Laboratory, Tsinghua University, FIT 3-429, Haidian District, 100016, Beijing, China

    Hao Yin

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 IFIP International Federation for Information Processing

About this paper

Cite this paper

Zhao, Y., Zhang, Z., He, T., Liu, A.X., Guo, L., Fang, B. (2012). A Task-Based Model for the Lifespan of Peer-to-Peer Swarms. In: Bestak, R., Kencl, L., Li, L.E., Widmer, J., Yin, H. (eds) NETWORKING 2012. NETWORKING 2012. Lecture Notes in Computer Science, vol 7290. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30054-7_6

Download citation

  • .RIS
  • .ENW
  • .BIB
  • DOI: https://doi.org/10.1007/978-3-642-30054-7_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-30053-0

  • Online ISBN: 978-3-642-30054-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Share this paper

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Search

Navigation

  • Find a journal
  • Publish with us

Discover content

  • Journals A-Z
  • Books A-Z

Publish with us

  • Publish your research
  • Open access publishing

Products and services

  • Our products
  • Librarians
  • Societies
  • Partners and advertisers

Our imprints

  • Springer
  • Nature Portfolio
  • BMC
  • Palgrave Macmillan
  • Apress
  • Your US state privacy rights
  • Accessibility statement
  • Terms and conditions
  • Privacy policy
  • Help and support

167.114.118.210

Not affiliated

Springer Nature

© 2023 Springer Nature