Characterizing Topological Assumptions of Distributed Algorithms in Dynamic Networks

Arnaud Casteigts 1 Serge Chaumette 2, * Afonso Ferreira 3, *
* Auteur correspondant
3 MASCOTTE - Algorithms, simulation, combinatorics and optimization for telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : 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.
Type de document :
Communication dans un congrès
Fraigniaud, P. and Kutten, S. and Žerovnik, J. 16th International Colloquium on Structural Information and Communication Complexity (SIROCCO), May 2009, Piran, Slovenia. Springer, 5869, pp.129--144, 2009, Lecture Notes in Computer Science


https://hal.archives-ouvertes.fr/hal-00408054
Contributeur : Arnaud Casteigts <>
Soumis le : lundi 22 juillet 2013 - 14:01:49
Dernière modification le : jeudi 10 septembre 2015 - 01:08:55
Document(s) archivé(s) le : mercredi 23 octobre 2013 - 02:25:09

Fichier

CCF09.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00408054, version 1

Collections

Citation

Arnaud Casteigts, Serge Chaumette, Afonso Ferreira. Characterizing Topological Assumptions of Distributed Algorithms in Dynamic Networks. Fraigniaud, P. and Kutten, S. and Žerovnik, J. 16th International Colloquium on Structural Information and Communication Complexity (SIROCCO), May 2009, Piran, Slovenia. Springer, 5869, pp.129--144, 2009, Lecture Notes in Computer Science. <hal-00408054>

Partager

Métriques

Consultations de
la notice

269

Téléchargements du document

101