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

  • Sean C. Rhea
  • Timothy Roscoe
  • John Kubiatowicz
Part of the Lecture Notes in Computer Science book series (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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 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)CrossRefGoogle Scholar
  3. 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)CrossRefGoogle Scholar
  4. 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)CrossRefGoogle Scholar
  5. 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. 6.
    Kubiatowicz, J., et al.: Oceanstore: An architecture for global-scale persistent storage. In: Proc. of ASPLOS (2000)Google Scholar
  7. 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)CrossRefGoogle Scholar
  8. 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. 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. 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)CrossRefGoogle Scholar
  11. 11.
    Rhea, S., Kubiatowicz, J.: Probabilistic location and routing. In: Proc. of INFOCOM (2002)Google Scholar
  12. 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. 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. 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)CrossRefGoogle Scholar
  15. 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. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Sean C. Rhea
    • 1
  • Timothy Roscoe
    • 2
  • John Kubiatowicz
    • 1
  1. 1.Department of Electrical Engineering and Computer ScienceUniversity of CaliforniaBerkeley
  2. 2.InResearch Berkeley 

Personalised recommendations