A hundred impossibility proofs for distributed computing
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Graph relabelling systems and distributed algorithms
Handbook of graph grammars and computing by graph transformation
Termination Detection of Distributed Algorithms by Graph Relabelling Systems
ICGT '02 Proceedings of the First International Conference on Graph Transformation
The Node Distribution of the Random Waypoint Mobility Model for Wireless Ad Hoc Networks
IEEE Transactions on Mobile Computing
Computation in networks of passively mobile finite-state sensors
Distributed Computing - Special issue: PODC 04
Local Computations in Graphs: The Case of Cellular Edge Local Computations
Fundamenta Informaticae - SPECIAL ISSUE ON ICGT 2004
Building a reference combinatorial model for MANETs
IEEE Network: The Magazine of Global Internetworking
Secure cooperative ad hoc applications within UAV fleets
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
What model and what conditions to implement unreliable failure detectors in dynamic networks?
Proceedings of the 3rd International Workshop on Theoretical Aspects of Dynamic Distributed Systems
On the exploration of time-varying networks
Theoretical Computer Science
Expressivity of time-varying graphs
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
| Hi-index | 0.00 |
Besides the complexity in time or in number of messages, a common approach for analyzing distributed algorithms is to look at their assumptions on the underlying network. This paper focuses on the study of such assumptions in dynamic networks, where the connectivity is expected to change, predictably or not, during the execution. Our main contribution is a theoretical framework dedicated to such analysis. By combining several existing components (local computations, graph relabellings, and evolving graphs), this framework allows to express detailed properties on the network dynamics and to prove that a given property is necessary, or sufficient, for the success of an algorithm. Consequences of this work include (i) the possibility to compare distributed algorithms on the basis of their topological requirements, (ii) the elaboration of a formal classification of dynamic networks with respect to these properties, and (iii) the possibility to check automatically whether a network trace belongs to one of the classes, and consequently to know which algorithm should run on it.