PODC 2004 - PDF Preprint Papers

PODC 2004 Annual ACM Symposium on Principles of Distributed Computing

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed PODC-2004 Paper

click to vote

PODC
2004
ACM

246views Distributed And Parallel Com...» more PODC 2004»

Balanced binary trees for ID management and load balance in distributed hash tables

14 years 4 months ago

Download infolab.stanford.edu

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

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	246	Balanced binary trees for ID management and load balance in distributed hash tables	claim
2	162	Completely fair SFE and coalition-safe cheap talk	claim
3	145	Brief announcement: degree: optimal deterministic routing for P2P systems	claim
4	132	Asynchronous group key exchange with failures	claim
5	132	Analyzing Kleinberg's (and other) small-world Models	claim
6	124	On spectrum sharing games	claim
7	123	Compact routing on euclidian metrics	claim
8	119	Load balancing and locality in range-queriable data structures	claim
9	107	Choosing a random peer	claim
10	105	Mechanism design for policy routing	claim
11	103	Byzantine disk paxos: optimal resilience with byzantine shared memory	claim
12	102	Competitive on-line paging strategies for mobile users under delay constraints	claim
13	101	Gradient clock synchronization	claim
14	101	On the design of distributed protocols from differential equations	claim
15	98	Computation in networks of passively mobile finite-state sensors	claim
16	98	Group membership: a novel approach and the first single-round algorithm	claim
17	96	On the inherent weakness of conditional synchronization primitives	claim
18	96	Lock-free linked lists and skip lists	claim
19	96	Geometrically aware communication in random wireless networks	claim
20	94	Lower bounds for adaptive collect and related objects	claim
21	93	Bringing practical lock-free synchronization to 64-bit applications	claim
22	91	Eclecticism shrinks even small worlds	claim
23	90	Signed quorum systems	claim
24	86	On the expected payment of mechanisms for task allocation	claim
25	85	The weakest failure detectors to solve certain fundamental problems in distributed computing	claim
26	85	What cannot be computed locally!	claim
27	78	An almost non-blocking stack	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers