Skip to main content
SpringerLink
Log in

P2P

  • Reference work entry
  • First Online:
Encyclopedia of Algorithms

  • 414 Accesses

Years and Authors of Summarized Original Work

  • 2001; Stoica, Morris, Karger, Kaashoek, Balakrishnan

Problem Definition

This problem is concerned with efficiently designing a serverless infrastructure for a federation of hosts to store, index and locate information, and for efficient data dissemination among the hosts. The key services of peer-to-peer (P2P) overlay networks are:

  1. 1.

    A keyed lookup protocol locates information at the server(s) that hold it.

  2. 2.

    Data store, update and retrieve operations maintain a distributed persistent data repository.

  3. 3.

    Broadcast and multicast support information dissemination to multiple recipients.

Because of their symmetric, serverless nature, these networks are termed P2P networks. Below, we often refer to hosts participating in the network as peers.

The most influential mechanism in this area is consistent hashing, pioneered in a paper by Karger et al. [21]. The idea is roughly the following. Frequently, a good way of arranging a lookup directory...

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,999.99
Price excludes VAT (USA)
  • Durable hardcover 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

Recommended Reading

  1. Abraham I, Awerbuch B, Azar Y, Bartal Y, Malkhi D, Pavlov E (2003) A generic scheme for building overlay networks in adversarial scenarios. In: Proceedings of the international parallel and distributed processing symposium (IPDPS 2003)

    Google Scholar 

  2. Abraham I, Malkhi D, Dobzinski O (2004) LAND: stretch (1 + ε) locality aware networks for DHTs. In: Proceedings of the ACM-SIAM symposium on discrete algorithms (SODA'04)

    Google Scholar 

  3. Abraham I, Badola A, Bickson D, Malkhi D, Maloo S, Ron S (2005) Practical locality-awareness for large scale information sharing. In: The 4th annual international workshop on peer-to-peer systems (IPTPS'05)

    Google Scholar 

  4. Aspnes J, Shah G (2003) Skip graphs. In: Fourteenth annual ACM-SIAM symposium on discrete algorithms, Baltimore, pp 384–393

    Google Scholar 

  5. Castro M, Druschel P, Rowstron A (2002) Scribe: a large-scale and decentralised application-level multicast infrastructure. IEEE J Sel Areas Commun (JSAC) 20(8):1489–1499, Spec Issue Netw Support Multicast Commun, ISSN:0733-8716

    Article  Google Scholar 

  6. Castro M, Druschel P, Kermarrec A-M, Nandi A, Rowstron A, Singh A (2003) Splitstream: high-bandwidth multicast in a cooperative environment. In: SOSP'03

    Google Scholar 

  7. Chou P, Wu Y, Jain K (2004) Network coding for the internet. In: IEEE communication theory workshop

    Google Scholar 

  8. Chu Y, Rao SG, Zhang H (2000) A case for end system multicast. In: Proceedings of ACM SIGMETRICS, Santa Clara, pp 1–12

    Google Scholar 

  9. Chun B, Culler D, Roscoe T, Bavier A, Peterson L, Wawrzoniak M, Bowman M (2003) Planetlab: an overlay testbed for broadcoverage services. ACM SIGCOMM Comput Commun Rev 33:3–12

    Article  Google Scholar 

  10. Cohen B (2003) Incentives build robustness in bittorrent. In: Proceedings of P2P economics workshop

    Google Scholar 

  11. Cormen TH, Leiserson CE, Rivest RL (1990) Introduction to algorithms. MIT

    MATH  Google Scholar 

  12. Fernandess Y, Malkhi D (2006) On collaborative content distribution using multi-message gossip. In: Twentieth IEEE international parallel and distributed processing symposium (IPDPS'06), Greece

    Google Scholar 

  13. Fraigniaud P, Gauron P (2003) The content-addressable network D2B. Technical report 1349, LRI, University Paris-Sud

    Google Scholar 

  14. Freedman MJ, Freudenthal E, Mazières D (2004) Democratizing content publication with coral. In: Proceedings of the 1st USENIX/ACM symposium on networked systems design and implementation (NSDI'04)

    Google Scholar 

  15. Freedman MJ, Mazières D (2003) Sloppy hashing and self-organizing clusters. In: Proceedings of the 2nd international workshop on peer-to-peer systems (IPTPS'03)

    Google Scholar 

  16. Gkantsidis C, Rodriguez P (2005) Network coding for large scale content distribution. In: IEEE/INFOCOM

    Google Scholar 

  17. Gummadi KP, Dunn RJ, Saroiu S, Gribble SD, Levy HM, Zahorjan J (2003) Measurement, modeling, and analysis of a peer-to-peer file-sharing workload. In: Proceedings of the nineteenth ACM symposium on Operating systems principles, ACM, pp 314–329

    Google Scholar 

  18. Gummadi K, Gummadi R, Gribble S, Ratnasamy S, Shenker S, Stoica I (2003) The impact of DHT routing geometry on resilience and proximity. In: Proceedings of the 2003 conference on applications, technologies, architectures, and protocols for computer communications, ACM, pp 381–394

    Google Scholar 

  19. Harvey NJA, Jones MB, Saroiu S, Theimer M, Wolman A (2003) Skipnet: a scalable overlay network with practical locality properties. In: Proceedings of fourth USENIX symposium on internet technologies and systems (USITS'03)

    Google Scholar 

  20. Kaashoek F, Karger DR (2003) Koorde: a simple degree-optimal hash table. In: 2nd international workshop on peer-to-peer systems (IPTPS'03)

    Google Scholar 

  21. Karger D, Lehman E, Leighton FT, Levine M, Lewin D, Panigrahy R (1997) Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the world wide web. In: Proceedings of the 29th annual ACM symposium on theory of computing (STOC'97), pp 654–663

    Google Scholar 

  22. Kleinberg J (2000) The small-world phenomenon: an algorithmic perspective. In: Proceedings of the 32nd ACM symposium on theory of computing (STOC'00), pp 163–170

    Google Scholar 

  23. Malkhi D, Naor M, Ratajczak D (2002) Viceroy: a scalable and dynamic emulation of the butterfly. In: Proceedings of the 21st ACM symposium on principles of distributed computing (PODC'02), pp 183–192

    Google Scholar 

  24. Manku GS, Bawa M, Raghavan P (2003) Symphony: distributed hashing in a small world. In: Proceedings of the 4th USENIX symposium on internet technologies and systems (USITS'03), pp 127–140

    Google Scholar 

  25. Maymounkov P, Mazières D (2002) Kademlia: a peer-to-peer information system based on the XORmetric. In: Proceedings of the 1st international workshop on peer-to-peer systems (IPTPS'02), pp 53–65

    Google Scholar 

  26. Naor M, Wieder U (2003) Novel architectures for p2p applications: the continuous-discrete approach. In: The fifteenth annual ACM symposium on parallelism in algorithms and architectures (SPAA'03)

    Google Scholar 

  27. Plaxton C, Rajaraman R, Richa A (1997) Accessing nearby copies of replicated objects in a distributed environment. In: Proceedings of the ninth annual ACM symposium on parallel algorithms and architectures (SPAA'97), pp 311–320

    Google Scholar 

  28. Pugh W (1989) Skip lists: a probabilistic alternative to balanced trees. In: Workshop on algorithms and data structures, pp 437–449

    Google Scholar 

  29. Ramasubramanian V, Sirer EG (2004) Beehive: O(1) lookup performance for power-law query distributions in peer-to-peer overlays. In: Proceedings of networked system design and implementation (NSDI)

    Google Scholar 

  30. Ramasubramanian V, Sirer EG (2004) The design and implementation of a next generation name service for the internet. In: Proceedings of SIGCOMM

    Google Scholar 

  31. Ratnasamy S, Francis P, Handley M, Karp R, Shenker S (2001) A scalable content-addressable network. In: Proceedings of the ACM SIGCOMM 2001 Technical Conference

    Google Scholar 

  32. Rhea S, Geels D, Roscoe T, Kubiatowicz J (2003) Handling churn in a dht. Technical report, UCB//CSD-03-1299. The University of California, Berkeley

    Google Scholar 

  33. Rowstron A, Druschel P (2001) Pastry: scalable, distributed object location and routing for large-scale peer-to-peer systems. In: IFIP/ACM international conference on distributed systems platforms (Middleware), pp 329–350

    Google Scholar 

  34. Stoica I, Adkins D, Zhuang S, Shenker S, Surana S (2002) Internet indirection infrastructure. In: Proceedings of ACM SIGCOMM, pp 73–88

    Google Scholar 

  35. Stoica I, Morris R, Karger D, Kaashoek MF, Balakrishnan H (2001) Chord: a scalable peer-to-peer lookup service for internet applications. In: Proceedings of the SIGCOMM

    Google Scholar 

  36. Zhao BY, Huang L, Stribling J, Rhea SC, Joseph AD, Kubiatowicz J (2003) Tapestry: a resilient global-scale overlay for service deployment. IEEE J Sel Areas Commun

    Google Scholar 

  37. Zhou L, van Renesse R, Marsh M (2002) Implementing IPv6 as a peer-to-peer overlay network. In: Proceedings of the 21st IEEE symposium on reliable distributed systems (SRDS'02), p 347

    Google Scholar 

  38. Zhuang SQ, Zhao BY, Joseph AD, Katz RH, Kubiatowicz J (2001) Bayeux: an architecture for scalable and fault-tolerant widearea data dissemination. In: Proceedings of the eleventh international workshop on network and operating system support for digital audio and video (NOSSDAV'01)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Microsoft, Silicon Valley Campus, Mountain View, CA, USA

    Dahlia Malkhi

Authors
  1. Dahlia Malkhi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Malkhi, D. (2016). P2P. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_272

Download citation

Publish with us

Policies and ethics

Search

Navigation