Towards a scalable and robust DHT

DOI10.1007/S00224-008-9099-9zbMATH Open1183.68088OpenAlexW2007661053MaRDI QIDQ733718FDOQ733718

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

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

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)

Cites Work

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

Cited In (15)

• Distributed agreement in dynamic peer-to-peer networks
• Self-stabilizing repeated balls-into-bins
• A survey of DHT security techniques
• Overlays with preferences: distributed, adaptive approximation algorithms for matching with preference lists
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Reducing communication costs in robust peer-to-peer networks

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)