Characterizing Topological Assumptions of Distributed Algorithms in Dynamic Networks - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2009

Characterizing Topological Assumptions of Distributed Algorithms in Dynamic Networks

Résumé

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.
Fichier principal
Vignette du fichier
CCF09.pdf (193.76 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00408054 , version 1 (22-07-2013)

Identifiants

  • HAL Id : hal-00408054 , version 1

Citer

Arnaud Casteigts, Serge Chaumette, Afonso Ferreira. Characterizing Topological Assumptions of Distributed Algorithms in Dynamic Networks. 16th International Colloquium on Structural Information and Communication Complexity (SIROCCO), May 2009, Piran, Slovenia. pp.129--144. ⟨hal-00408054⟩
293 Consultations
170 Téléchargements

Partager

Gmail Facebook X LinkedIn More