Skip to main content
SpringerLink
Log in
Book cover

Guide to Reliable Distributed Systems pp 609–634Cite as

Peer-to-Peer Systems and Probabilistic Protocols

  • Chapter

  • 3085 Accesses

Part of the book series: Texts in Computer Science ((TCS))

Abstract

In this chapter, we consider a number of protocols representative of a new wave of research and commercial activity in distributed computing. The protocols in question share two characteristics. First, they exploit what are called peer-to-peer communication patterns. Peer-to-peer computing is in some ways a meaningless categorization, since all of the protocols we have discussed in this book involve direct exchanges of messages between “peers.” A better term might be “client to client” protocols, because most peer-to-peer systems emerge from a world of client/server computing, but replace some or all functions of the servers by functionality hosted on the clients themselves. Secondly, and in distinction from the protocols covered in Chaps. 12–14, these protocols typically offer stochastic (probabilistic) guarantees.

This is a preview of subscription content, 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   49.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   64.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   89.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

Learn about institutional subscriptions

References

  • Alon, N., Barak, A., Manber, U.: On disseminating information reliably without broadcasting. In: Proceedings of the Seventh International Conference on Distributed Computing Systems, Berlin, September, pp. 74–81. IEEE Computer Society Press, New York (1987)

    Google Scholar 

  • Andersen, D., Balakrishnan, H., Kaashoek, M.F., Morris, R.: Resilient overlay networks. In: Proceedings of the 8th Workshop on Hot Topics in Operating Systems (HotOS-VIII), Schloss Elmau, Germany, May 2001a

    Google Scholar 

  • Andersen, D., Balakrishnan, H., Kaashoek, M.F., Morris, R.: Resilient overlay networks. In: Proceedings of the Symposium on Operating Systems Principles 17, Vancouver, CA, Oct. 2001, pp. 131–145 (2001b)

    Google Scholar 

  • Bailey, N.: The Mathematical Theory of Epidemic Diseases, 2nd edn. Charles Griffen and Company, London (1975)

    Google Scholar 

  • Balakrishnan, H., Kaashoek, M.F., Karger, D., Morris, R., Stoica, I.: Looking up data in P2P systems. Commun. ACM 46(2), 43–48 (2003)

    Article  Google Scholar 

  • Bhagwan, R., Moore, D., Savage, S., Voelker, G.M.: Replication strategies for highly available peer-to-peer storage. In: Future Directions in Distributed Computing, pp. 153–158. Springer, Berlin (2003)

    Chapter  Google Scholar 

  • Birman, K.P.: A review of experiences with reliable multicast. Softw. Pract. Exp. 29(9), 741–774 (1999)

    Article  Google Scholar 

  • Birman, K.P., van Renesse, R.: Software for reliable networks. Sci. Am. 274(5), 64–69 (1996)

    Article  Google Scholar 

  • Birman, K.P., Hayden, M., Ozkasap, O., Xiao, Z., Budiu, M., Minsky, Y.: Bimodal multicast. ACM Trans. Comput. Syst. 17(2), 41–88 (1999)

    Article  Google Scholar 

  • Castro, M., Druschel, P., Hu, Y.C., Rowstron, A.: Topology-aware routing in structured peer-to-peer overlay networks. In: Future Directions in Distributed Computing 2003, pp. 103–107. Springer, Berlin (2003a)

    Chapter  Google Scholar 

  • Chandra, T., Toueg, S.: Time and message efficient reliable broadcasts. Technical Report TR 90-1094, Department of Computer Science, Cornell University, February (1990)

    Google Scholar 

  • Cristian, F., Aghili, H., Strong, R., Dolev, D.: Atomic broadcast: From simple message diffusion to byzantine agreement. In: Proceedings of the Fifteenth International Symposium on Fault-Tolerant Computing, pp. 200–206. IEEE Computer Society Press, New York (1985). Revised as IBM Technical Report RJ5244

    Google Scholar 

  • Demers, A., et al.: Epidemic algorithms for replicated data management. In: Proceedings of the Sixth Symposium on Principles of Distributed Computing, Vancouver, August 1987, pp. 1–12 (1987). Also Oper. Syst. Rev. 22(1), 8–32 (1988)

    Chapter  Google Scholar 

  • Eugster, P., Guerraoui, R., Handurukande, S.B., Kouznetsov, P., Kermarrec, A.-M.: Lightweight probabilistic broadcast. ACM Trans. Comput. Syst. 21(4), 341–374 (2003)

    Article  Google Scholar 

  • Golding, R.A.: Distributed epidemic algorithms for replicated tuple spaces. Technical Report HPL-CSP-91-15, June (1991). Concurrent systems project, Hewlett-Packard Laboratories

    Google Scholar 

  • Golding, R., Taylor, K.: Group membership in the epidemic style. Technical Report UCSC-CRL-92-13, University of California, Santa Cruz, May (1992)

    Google Scholar 

  • Gramoli, V., Vigfusson, Y., Birman, K., Kermarrec, A.-M., van Renesse, R.: Slicing distributed systems. IEEE Trans. Comput. 58(11), 1444–1455 (2009)

    Article  MathSciNet  Google Scholar 

  • Gribble, S., et al.: The Ninja architecture for robust Internet-scale systems and services. Comput. Netw. 35(4), 473–497 (2001)

    Article  Google Scholar 

  • Guerraoui, R.: Revisiting the relationship between nonblocking atomic commitment and consensus. In: International Workshop on Distributed Algorithms, September 1995, pp. 87–100 (1995)

    Chapter  Google Scholar 

  • Hoory, S., Linial, N., Widgerson, A.: Expander graphs and their applications. Bull. Am. Math. Soc. 43(4), 439–561 (2006). doi:10.1090/S0273-0979-06-01126-8

    Article  MATH  Google Scholar 

  • Huang, Q., Birman, K., Vigfusson, Y., Li, H.: Quilt: A patchwork of multicast regions. In: 4th ACM International Conference on Distributed Event-Based Systems (DEBS2010), Cambridge, United Kingdom, July 2010

    Google Scholar 

  • Iyer, S., Rowstron, A., Druschel, P.: Squirrel: A decentralized peer-to-peer web cache. In: Principles of Distributed Computing (PODC), pp. 213–222 (2002)

    Google Scholar 

  • Jelasity, M., Voulgaris, S., Guerraoui, R., Kermarrec, A.M., van Steen, M.: Gossip-based peer sampling. Trans. Comput. Syst. 25(3) (2007)

    Google Scholar 

  • Kermarrec, A.M., Rowstron, A., Shapiro, M., Druschel, P.: The IceCube approach to the reconciliation of divergent replicas. In: Principles of Distributed Computing, pp. 210–218 (2001)

    Google Scholar 

  • Kermarrec, A.M., Pace, A., Quéma, V., Schiavoni, V.: NAT-resilient gossip peer sampling. In: Proceedings of the International Conference on Distributed Computing Systems (ICDCS), Montreal, Canada, June 2009, pp. 360–367 (2009)

    Google Scholar 

  • Kleinberg, J.: The small-world phenomenon: An algorithmic perspective. In: Proc. 32nd ACM Symposium on Theory of Computing (2000b). Also appears as Cornell Computer Science Technical Report 99-1776 (October 1999)

    Google Scholar 

  • Kubiatowicz, J.: Extracting guarantees from chaos. Commun. ACM 46(2), 33–38 (2003)

    Article  Google Scholar 

  • Kubiatowicz, J., Bindel, D., Chen, Y., Czerwinski, S., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., Wells, C., Zhao, B.: OceanStore: An architecture for global-scale persistent storage. In: Proceedings of ACM, ASPLOS (2000a)

    Google Scholar 

  • Kubiatowicz, J., et al.: OceanStore: An architecture for global-scale persistent storage. In: Proceedings of Architectural Support for Programming Languages and Systems (ASPLOS), pp. 190–201 (2000b)

    Google Scholar 

  • Muthitacharoen, A., Morris, R., Gil, T., Ivy, B. Chen: A read/write peer-to-peer file system. In: Proceedings of the 5th USENIX Symposium on Operating Systems Design and Implementation (OSDI ’02), Boston, Massachusetts, December 2002

    Google Scholar 

  • Schiper, A., Shvartsman, A.A., Weatherspoon, H., Zhao, B.: Future Directions in Distributed Computing, Research and Position Papers. Springer, Berlin (2003)

    Book  MATH  Google Scholar 

  • van Renesse, R., Birman, K.P., Vogels, W.: Astrolabe: A robust and scalable technology for distributed system monitoring, management, and data mining. ACM Trans. Comput. Syst. 21(2), 164–206 (2003)

    Article  Google Scholar 

  • Vigfusson, Y.: Affinity in distributed systems. PhD dissertation. Cornell University, Sept. (2009). (Degree conferred Feb. 2010)

    Google Scholar 

  • Vigfusson, Y., Birman, K., Huang, Q., Nataraj, D.P.: GO: Platform support for Gossip applications. In: IEEE P2P 2009, Seattle, WA, September 9–11, pp. 222–231 (2009)

    Google Scholar 

  • Weatherspoon, H., Kubiatowicz, J.: Erasure coding vs. replication: A quantitative comparison. In: IPTPS 2002, pp. 328–338 (2002)

    Google Scholar 

  • Zhao, B., Duan, Y., Huang, L., Joseph, A.D., Kubiatowicz, J.: Brocade: Landmark routing on overlay networks. In: IPTPS 2002, pp. 34–44 (2002a)

    Google Scholar 

  • Zhao, Duan, B.Y., Huang, L., Joseph, A.D., Kubiatowicz, J.D.: Brocade: Landmark routing on overlay networks. In: First International Workshop on Peer-to-Peer Systems (IPTPS), Cambridge, MA, March 2002b

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Cornell University, Ithaca, NY, USA

    Kenneth P. Birman

Authors
  1. Kenneth P. Birman
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag London Limited

About this chapter

Cite this chapter

Birman, K.P. (2012). Peer-to-Peer Systems and Probabilistic Protocols. In: Guide to Reliable Distributed Systems. Texts in Computer Science. Springer, London. https://doi.org/10.1007/978-1-4471-2416-0_21

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-2416-0_21

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-4471-2415-3

  • Online ISBN: 978-1-4471-2416-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation