Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
The weakest failure detector for solving consensus
Journal of the ACM (JACM)
Fault-tolerant broadcasts and related problems
Distributed systems (2nd Ed.)
The concurrency hierarchy, and algorithms for unbounded concurrency
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Computing with Infinitely Many Processes
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
A pleasant stroll through the land of infinitely many creatures
ACM SIGACT News
The price of validity in dynamic networks
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Agreement and consistency without knowing the number of processes
NOTERE '08 Proceedings of the 8th international conference on New technologies in distributed systems
A framework for secure and private P2P publish/subscribe
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Quorum-based dynamic regular registers in systems with churn
Proceedings of the 3rd International Workshop on Theoretical Aspects of Dynamic Distributed Systems
Dynamic regular registers in systems with churn
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Regular register: an implementation in a churn prone environment
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Virtual Tree: A robust architecture for interval valid queries in dynamic distributed systems
Journal of Parallel and Distributed Computing
Dynamic regular registers in systems with churn
Theoretical Computer Science
| Hi-index | 0.00 |
This paper is a position paper on the nature of dynamic systems. While there is an agreement on the definition of what a static distributed system is, there is no agreed definition on what a dynamic distributed system is. This paper is a first step in that direction. To that end, it emphasizes two orthogonal dimensions that are present in any dynamic distributed system, namely the varying and possibly very large number of entities that currently define the system, and the fact that each of these entities knows only a few other entities (its neighbors) and possibly will never be able to know the whole system it is a member of. To illustrate the kind of issues one has to cope with in dynamic systems, the paper considers, as a "canonical" problem, a simple data aggregation problem. It shows the type of dynamic systems in which that problem can be solved and the ones in which it cannot be solved. The aim of the paper is to give the reader an idea of the subtleties and difficulties encountered when one wants to understand the nature of dynamic distributed systems.