Skip to main content

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4280))

Included in the following conference series:

  • 430 Accesses

Abstract

Peer-to-peer applications share files between users themselves rather than downloading files from file servers. Self-downloading protocols have the property that eventually, every user downloads only from other users. This paper considers efficient ways of dividing files into segments so that users can exit the system as soon as file downloading is complete. One vulnerability of file sharing between peers is the possibility that files or segments could be counterfeit or corrupt. Protocols that are d-safe tolerate some number of instances of faulty segments in a file being downloaded, because each segment is downloaded d times before being uploadable. It is shown that d-safe self-downloading is possible for a sufficiently large arrival rate of users to the system. In addition, the paper presents upper and lower connectivity and sharing bounds for d = 2.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adler, S.: The slashdot effect, an analysis of three Internet publications. In: Linux Gazette, Issue 38 (1999)

    Google Scholar 

  2. Aspnes, J., Shah, G.: Skip graphs. In: SODA 2003. Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 284–393 (2003)

    Google Scholar 

  3. Cohen, B.: Incentives build robustness in BitTorrent. In: First Workshop on Economics of Peer-to-Peer Systems, Berkeley, California (June 2003), http://www.sims.berkeley.edu/research/conferences/p2pecon

  4. Herman, T., Johnen, C.: Strategies for peer-to-peer downloading. Information Processing Letters 94(5), 203–209 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  5. Wang, C., Li, B.: Peer-to-peer overlay networks: a survey. Technical Report, Department of Computer Science, HKUST (February 2003)

    Google Scholar 

  6. Sevcik, P.: Peer-to-peer traffic: another internet myth is born. Business Communication Review (November 2005)

    Google Scholar 

  7. RX Cringely. Net neutered. Electric Money, vol. 7.25, June 22 (2006)

    Google Scholar 

  8. Byers, J., Luby, M., Mitzenmacher, M.: Accessing multiple mirror sites in parallel: using tornado codes to speed up downloads. In: Proceedings of the 18th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 1999), pp. 275–284 (1999)

    Google Scholar 

  9. Baohua, W., Fedak, G., Cappello, F.: Scheduling independent tasks sharing large data distributed with BitTorrent. In: Proceedings of the 6th IEEE/ACM International Workshop on Grid Computing, pp. 219–226 (2005)

    Google Scholar 

  10. Sherwood, R., Braud, R., Bhattacharjee, B.: Slurpie: a cooperative bulk data transfer protocol. In: Proceedings of the Twenty-third Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2004), pp. 941–951 (2004)

    Google Scholar 

  11. Sohail, S., Chou, C.T., Kanhere, S.S., Jha, S.: On large scale deployment of parallelized file transfer protocol. In: Proceedings of the 24th IEEE International Conference on Performance, Computing, and Communications (IPCCC 2005), pp. 225–232 (2005)

    Google Scholar 

  12. Ciglan, M., Habala, O., Hluchy, L.: Striped replication from multiple sites in the grid environment. In: Sloot, P.M.A., Hoekstra, A.G., Priol, T., Reinefeld, A., Bubak, M. (eds.) EGC 2005. LNCS, vol. 3470, pp. 778–785. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  13. Jun, S., Ahamad, M.: Incentives in BitTorrent induce free riding. In: Proceeding of the 2005 ACM SIGCOMM workshop on Economics of Peer-to-Peer Systems, pp. 116–121 (2005)

    Google Scholar 

  14. Wu, G., Chiueh, T.: How efficient is BitTorrent? In: Proceedings of SPIE Conference on Multimedia Computing and Networking, vol. 6071 (2006)

    Google Scholar 

  15. Bickson, D., Dolev, D., Weiss, Y.: Efficient peer-to-peer content distribution (2006), http://citeseer.ist.psu.edu/738516.html

  16. Chun, B.G., Wu, P., Weatherspoon, H., Kubiatowicz, J.: ChunkCast: an anycast service for large content distribution. In: Proceedings of the International Workshop on Peer-to-Peer Systems (IPTPS 2006) (February 2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dastidar, K.G., Herman, T., Johnen, C. (2006). Safe Peer-to-Peer Self-downloading. In: Datta, A.K., Gradinariu, M. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2006. Lecture Notes in Computer Science, vol 4280. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-49823-0_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-49823-0_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-49018-0

  • Online ISBN: 978-3-540-49823-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics