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

  • Sean C. Rhea
  • Timothy Roscoe
  • John Kubiatowicz
Conference paper

DOI: 10.1007/978-3-540-45172-3_5

Volume 2735 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
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

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.

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