Skip to main content

Structured Peer-to-Peer Overlays Need Application-Driven Benchmarks

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2735))

Abstract

Considerable research effort has recently been devoted to the design of structured peer-to-peer overlays, a term we use to encompass Content-Addressable Networks (CANs), Distributed Hash Tables (DHTs), and Decentralized Object Location and Routing networks (DOLRs). These systems share the property that they consistently map a large set of identifiers to a set of nodes in a network, and while at first sight they provide very similar services, they nonetheless embody a wide variety of design alternatives. We present the case for developing application-driven benchmarks for such overlays, give a model of the services they provide applications, describe and present the results of two preliminary benchmarks, and discuss the implications of our tests for application writers. We are unaware of other empirical comparative work in this area.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Dabek, F., Kaashoek, M.F., Karger, D., Morris, R., Stoica, I.: Wide-area cooperative storage with CFS. In: Proc. of ACM SOSP (2001)

    Google Scholar 

  2. Dabek, F., Zhao, B., Druschel, P., Kubiatowicz, J., Stoica, I.: Towards a common API for structured peer-to-peer overlays. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735, Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  3. Freedman, M., Sit, E., Cates, J., Morris, R.: Tarzan: A peer-to-peer anonymizing network layer. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, p. 121. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  4. Hand, S., Roscoe, T.: Mnemosyne: Peer-to-peer steganographic storage. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, p. 130. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  5. Hildrum, K., Kubiatowicz, J., Rao, S., Zhao, B.: Distributed data location in a dynamic network. In: Proc. of ACM SPAA (2002)

    Google Scholar 

  6. Kubiatowicz, J., et al.: Oceanstore: An architecture for global-scale persistent storage. In: Proc. of ASPLOS (2000)

    Google Scholar 

  7. Liben-Nowell, D., Balakrishnan, H., Karger, D.: Observations on the dynamic evolution of peer-to-peer networks. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, p. 22. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  8. Padhye, J., Firoiu, V., Towsley, D., Kurose, J.: Modeling TCP throughput: A simple model and its empirical validation. In: Proc. of ACM SIGCOMM (1998)

    Google Scholar 

  9. Peterson, L., Culler, D., Anderson, T., Roscoe, T.: A blueprint for introducing disruptive technology into the Internet. In: Proc. of HOTNETS (2002)

    Google Scholar 

  10. Ratnasamy, S., Shenker, S., Stoica, I.: Routing algorithms for DHTs: Some open questions. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, p. 45. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  11. Rhea, S., Kubiatowicz, J.: Probabilistic location and routing. In: Proc. of INFOCOM (2002)

    Google Scholar 

  12. Saroiu, S., Gummadi, P.K., Gribble, S.: A measurement study of peer-to-peer file sharing systems. In: Multimedia Computing and Networking (2002)

    Google Scholar 

  13. Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for Internet applications. In: Proceedings of SIGCOMM (2001)

    Google Scholar 

  14. Stoica, I., Adkins, D., Ratnasamy, S., Shenker, S., Surana, S., Zhuang, S.: Internet indirection infrastructure. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, p. 191. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  15. Welsh, M., Culler, D., Brewer, E.: SEDA: An architecture for well-conditioned, scalable internet services. In: Proc. of ACM SOSP (2001)

    Google Scholar 

  16. Zhao, B., Joseph, A., Kubiatowicz, J.: Tapestry: An infrastructure for faulttolerant wide-area location and routing. Technical Report UCB//CSD-01-1141, U. C. Berkeley (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rhea, S.C., Roscoe, T., Kubiatowicz, J. (2003). Structured Peer-to-Peer Overlays Need Application-Driven Benchmarks. In: Kaashoek, M.F., Stoica, I. (eds) Peer-to-Peer Systems II. IPTPS 2003. Lecture Notes in Computer Science, vol 2735. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45172-3_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45172-3_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40724-9

  • Online ISBN: 978-3-540-45172-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics