Dynamic p-graphs for capturing the dynamics of distributed systems

Bertrand Ducourthial (1, 2, 3) , Ahmed Mouhamadou Wade (2, 1)

1 SU - Sorbonne Université
2 Heudiasyc - Heuristique et Diagnostic des Systèmes Complexes [Compiègne]
3 Labex MS2T - Laboratoire d'Excellence "Maîtrise des Systèmes de Systèmes Technologiques"

The dynamics of a mobile dynamic distributed system depends on both the node mobility and the capacity of the underlying communication protocol. To qualify the dynamics of a distributed system, the family of dynamic p-graphs is introduced in this paper, constituting a finite set of dynamic graphs, each of them being a sequence of observed graphs, with the particularity that their edges allow transferring p messages. The family of dynamic p-graphs allows the characterization and the comparison of dynamic distributed systems of very different nature. It is also used to evaluate the ability of algorithms themselves to support a given dynamic distributed system.

Mots clés: distributed algorithm; dynamic networks; routing; VANET

Domaines: Réseaux et télécommunications [cs.NI]

Bertrand Ducourthial, Ahmed Mouhamadou Wade. Dynamic p-graphs for capturing the dynamics of distributed systems. Ad Hoc Networks, 2016, 50, pp.13-22. ⟨10.1016/j.adhoc.2016.05.004⟩. ⟨hal-01322760⟩