Abstract
Existing peer-to-peer systems rely on overlay network protocols for object storage and retrieval and message routing. These overlay protocols can be broadly classified as structured and unstructured – structured overlays impose constraints on the network topology for efficient object discovery, while unstructured overlays organize nodes in a random graph topology that is arguably more resilient to peer population transiency. There is an ongoing discussion on the pros and cons of both approaches. This paper contributes to the discussion a multiple-site, measurement-based study of two operational and widely-deployed file-sharing systems. The two protocols are evaluated in terms of resilience, message overhead, and query performance. We validate our findings and further extend our conclusions through detailed analysis and simulation experiments.
| Original language | English (US) |
|---|---|
| Pages | 341-355 |
| Number of pages | 15 |
| State | Published - 2006 |
| Event | 2006 USENIX Annual Technical Conference - Boston, United States Duration: May 30 2006 → Jun 3 2006 |
Conference
| Conference | 2006 USENIX Annual Technical Conference |
|---|---|
| Country/Territory | United States |
| City | Boston |
| Period | 5/30/06 → 6/3/06 |
Funding
We would like to thank Jeanine Casler, and David Choffnes for their invaluable help. In addition, we thank our shepherd Stefan Sariou and the anonymous reviewers who provided us with excellent feedback.
ASJC Scopus subject areas
- General Computer Science