Towards a scalable and robust DHT

DOI10.1007/s00224-008-9099-9zbMath1183.68088OpenAlexW2007661053MaRDI QIDQ733718

Christian Scheideler, Baruch Awerbuch

Publication date: 19 October 2009

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-008-9099-9

zbMATH Keywords

distributed hash table

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Distributed systems (68M14)

Related Items

Towards worst-case churn resistant peer-to-peer systems ⋮ A theoretical and empirical evaluation of an algorithm for self-healing computation ⋮ Resource Burning for Permissionless Systems (Invited Paper) ⋮ Self-stabilizing repeated balls-into-bins ⋮ Overlays with preferences: distributed, adaptive approximation algorithms for matching with preference lists ⋮ Reliable Resource Searching in P2P Networks ⋮ Towards a Universal Approach for the Finite Departure Problem in Overlay Networks ⋮ Unnamed Item ⋮ Distributed agreement in dynamic peer-to-peer networks

Uses Software

• Chord

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories
• A new scheme for the deterministic simulation of PRAMs in VLSI
• Robust random number generation for peer-to-peer systems
• Routing, merging, and sorting on parallel models of computation
• Accessing nearby copies of replicated objects in a distributed environment
• Novel architectures for P2P applications
• How to spread adversarial nodes?
• How to share memory in a distributed system
• Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
• A Scheme for Fast Parallel Communication
• Deterministic Simulations of PRAM<scp>s</scp> on Bounded Degree Networks
• Cuckoo hashing
• The round complexity of verifiable secret sharing and secure multicast
• Automata, Languages and Programming
• Algorithms – ESA 2005
• Concentration of Measure for the Analysis of Randomized Algorithms