Most P2P systems that provide a DHT abstraction distribute objects randomly among" peer
nodes" in a way that results in some nodes having/spl theta/(log N) times as many objects as …

We consider the problem of defending against Sybil attacks using computational puzzles. A
fundamental difficulty in such defenses is enforcing that puzzle solutions not be reused by …

Most P2P systems that provide a DHT abstraction distribute objects randomly among “peer
nodes” in a way that results in some nodes having Θ (logN) times as many objects as the …

Existing solutions to balance load in DHTs incur a high overhead either in terms of routing
state or in terms of load movement generated by nodes arriving or departing the system. In …

We present a low-cost, decentralized algorithm for ID management in distributed hash tables
(DHTs) managed by a dynamic set of hosts. Each host is assigned an ID in the unit interval …

We present the first fully distributed algorithm which chooses a peer uniformly at random
from the set of all peers in a distributed hash table (DHT). Our algorithm has latency O (log n) …

Balancing of structured peer-to-peer graphs, including their zone sizes, has recently become
an important topic of distributed hash table (DHT) research. To bring analytical …

Load balancing is the process of distributing the load among various nodes of a distributed
system to improve both resource utilization and job response time while also avoiding a …

Random peer selection is used by numerous P2P applications; examples include
application-level multicast, unstructured file sharing, and network location map**. In most …

As more of our daily activities are carried out online, it becomes important to develop
technologies to protect our online privacy. Anonymity is a key privacy technology, since it …