IPTPS
2003
Springer
13 years 9 months ago
2003
Springer
Cooperative peer-to-peer applications are designed to share the resources of each computer in an overlay network for the common good of everyone. However, users do not necessarily...
IPTPS
2003
Springer
13 years 9 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 9 months ago
2003
Springer
IPTPS
2003
Springer
13 years 9 months ago
2003
Springer
Abstract—Structured peer-to-peer overlay networks provide a useful substrate for building distributed applications but there are general concerns over the cost of maintaining the...
IPTPS
2003
Springer
13 years 9 months ago
2003
Springer
IPTPS
2003
Springer
13 years 9 months ago
2003
Springer
This paper discusses the feasibility of peer-to-peer full-text keyword search of the Web. Two classes of keyword search techniques are in use or have been proposed: flooding of q...
IPTPS
2003
Springer
13 years 9 months ago
2003
Springer
The Peer-to-Peer (p2p) and Grid infrastructure communities are tackling an overlapping set of problems. In addressing these problems, p2p solutions are usually motivated by elegan...
IPTPS
2003
Springer
13 years 9 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 9 months ago
2003
Springer
– In this paper, we first describe the concept of data overlay, which is a mechanism to implement arbitrary data structure on top of any structured P2P DHT. With this ion, we dev...
IPTPS
2003
Springer
13 years 9 months ago
2003
Springer