23 search results - page 2 / 5 » iptps 2003 |
IPTPS
2003
Springer
13 years 10 months ago
2003
Springer
Koorde1 is a new distributed hash table (DHT) based on Chord [15] and the de Bruijn graphs [2]. While inheriting the simplicity of Chord, Koorde meets various lower bounds, such a...
IPTPS
2003
Springer
13 years 10 months ago
2003
Springer
In this paper, we describe an ongoing effort to define common APIs ctured peer-to-peer overlays and the key abstractions that can be built on them. In doing so, we hope to facilit...
IPTPS
2003
Springer
13 years 10 months ago
2003
Springer
We introduce a distributed hash table (DHT) with logarithmic degree and logarithmic dilation. We show two lookup algorithms. The first has a message complexity of log n and is ro...
IPTPS
2003
Springer
13 years 10 months ago
2003
Springer
This paper addresses a simple, yet fundamental question in the design of peer-to-peer systems: What does it mean when we say “availability” and how does this understanding imp...
IPTPS
2003
Springer
13 years 10 months ago
2003
Springer
Every distributed system that employs linking requires a Reference Resolution Service (RRS) to convert link references to locations. We argue that the Web’s use of DNS for this ...