Sciweavers

PODC
2004
ACM
13 years 10 months ago
Balanced binary trees for ID management and load balance in distributed hash tables
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 inter...
Gurmeet Singh Manku
PODC
2004
ACM
13 years 10 months ago
Group membership: a novel approach and the first single-round algorithm
We establish a new worst-case upper bound on the Membership problem: We present a simple algorithm that is able to always achieve Agreement on Views within a single message latenc...
Roger I. Khazan
PODC
2004
ACM
13 years 10 months ago
Analyzing Kleinberg's (and other) small-world Models
We analyze the properties of Small-World networks, where links are much more likely to connect “neighbor nodes” than distant nodes. In particular, our analysis provides new re...
Charles U. Martel, Van Nguyen
PODC
2004
ACM
13 years 10 months ago
Asynchronous group key exchange with failures
Group key exchange protocols allow a group of servers communicating over an asynchronous network of point-to-point links to establish a common key, such that an adversary which fu...
Christian Cachin, Reto Strobl
PODC
2004
ACM
13 years 10 months ago
Brief announcement: degree: optimal deterministic routing for P2P systems
Gennaro Cordasco, Luisa Gargano, Mikael Hammar, Vi...
Distributed And Parallel Computing
Top of PageReset Settings