Towards a scalable and robust DHT

DOI10.1007/S00224-008-9099-9MaRDI QIDQ733718zbMATH OpenOpenAlexFDO

Authors Baruch Awerbuch, Christian Scheideler

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

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

Recommendations

• New DCT computation technique based on scalable resources
• Euro-Par 2004 Parallel Processing
• Scalable Parallel DFPN Search
• Novel load balancing DHT scheme for the heterogeneous system
• Robust and scalable distributed recursive least squares

Cites work

• scientific article; zbMATH DE number 1246230 (Why is no real title available?)
• scientific article; zbMATH DE number 2079362 (Why is no real title available?)
• scientific article; zbMATH DE number 2080510 (Why is no real title available?)
• scientific article; zbMATH DE number 2080852 (Why is no real title available?)
• scientific article; zbMATH DE number 1559581 (Why is no real title available?)
• scientific article; zbMATH DE number 1931804 (Why is no real title available?)
• scientific article; zbMATH DE number 1931806 (Why is no real title available?)
• scientific article; zbMATH DE number 1931811 (Why is no real title available?)
• scientific article; zbMATH DE number 1931812 (Why is no real title available?)
• scientific article; zbMATH DE number 1931813 (Why is no real title available?)
• A Scheme for Fast Parallel Communication
• A new scheme for the deterministic simulation of PRAMs in VLSI
• Accessing nearby copies of replicated objects in a distributed environment
• Algorithms – ESA 2005
• Automata, Languages and Programming
• Concentration of Measure for the Analysis of Randomized Algorithms
• Cuckoo hashing
• Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
• Deterministic Simulations of PRAM<scp>s</scp> on Bounded Degree Networks
• How to share memory in a distributed system
• How to spread adversarial nodes?
• Novel architectures for P2P applications: the continuous-discrete approach
• Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories
• Robust random number generation for peer-to-peer systems
• Routing, merging, and sorting on parallel models of computation
• The round complexity of verifiable secret sharing and secure multicast

Cited in

(16)

• Robust overlays meet blockchains: on handling high churn and catastrophic failures
• Distributed agreement in dynamic peer-to-peer networks
• Self-stabilizing repeated balls-into-bins
• Overlays with preferences: distributed, adaptive approximation algorithms for matching with preference lists
• A survey of DHT security techniques
• scientific article; zbMATH DE number 1931813 (Why is no real title available?)
• Towards a universal approach for the finite departure problem in overlay networks
• Securing ad hoc storage through probabilistic cooperation assessment
• Reliable resource searching in P2P networks
• Resource Burning for Permissionless Systems (Invited Paper)
• Towards worst-case churn resistant peer-to-peer systems
• A Denial-of-Service Resistant DHT
• A theoretical and empirical evaluation of an algorithm for self-healing computation
• Towards robust and efficient computation in dynamic peer-to-peer networks
• Reducing communication costs in robust peer-to-peer networks
• scientific article; zbMATH DE number 1931815 (Why is no real title available?)

Describes a project that uses

Uses Software

• Chord

This page was built for publication: Towards a scalable and robust DHT

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q733718)