SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Censorship resistant peer-to-peer content addressable networks
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Analysis of the evolution of peer-to-peer systems
Proceedings of the twenty-first annual symposium on Principles of distributed computing
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Dynamically Fault-Tolerant Content Addressable Networks
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Novel architectures for P2P applications: the continuous-discrete approach
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
A Generic Scheme for Building Overlay Networks in Adversarial Scenarios
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
The hyperring: a low-congestion deterministic data structure for distributed environments
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Information Processing Letters
Pagoda: a dynamic overlay network for routing, data management, and multicasting
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Self-Stabilizing Structured Ring Topology P2P Systems
P2P '05 Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing
SkipNet: a scalable overlay network with practical locality properties
USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
A denial-of-service resistant DHT
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Tiara: A Self-stabilizing Deterministic Skip List
SSS '08 Proceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems
A Distributed and Oblivious Heap
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
Proceedings of the 28th ACM symposium on Principles of distributed computing
A DoS-resilient information system for dynamic data management
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Local Algorithms: Self-stabilization on Speed
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
A Self-stabilizing and Local Delaunay Graph Construction
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
O(log n)-time overlay network construction from graphs with out-degree 1
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Time complexity of distributed topological self-stabilization: the case of graph linearization
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
A self-repairing peer-to-peer system resilient to dynamic adversarial churn
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
Hi-index | 0.00 |
Distributed systems are often dynamic in the sense that there are frequent membership changes (nodes joining and leaving the network), either due to regular churn or due to an attack. Maintaining availability and full functionality of such a system under continuous topological changes hence constitutes an important algorithmic challenge. This paper reports on some of our recent results on robust distributed systems. We review two randomized architectures that build upon the continuous-discrete approach by Naor and Wieder, namely the SHELL network which allows for fast joins and leaves and organizes more reliable (or stronger) nodes in a core network where their communication is not affected by malicious (or weak) nodes, and the Chameleon network whose replica placement strategy and whose intentional topological updates ensure resiliency against denial-of-service attacks, even from past insiders. To complement our investigations on randomized architectures, we discuss algorithms to maintain hypercubic networks under worst-case churn. Finally, we advocate the design of self-stabilizing topologies---a very appealing and still not well-understood notion of robustness---that converge quickly to a desirable structure from arbitrarily degenerated states. As a use case, graph linearization is examined in more detail. This invited paper complements the WRAS'10 talk and is joint work with Matthias Baumgart, Dominik Gall, Riko Jacob, Fabian Kuhn, Andrea Richa, Stephan Ritscher, Christian Scheideler, Joest Smit, Hanjo Täubig, and Roger Watten-hofer.