Skip to Main content Skip to Navigation
Journal articles

Dynamic p-graphs for capturing the dynamics of distributed systems

Abstract : 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.
Document type :
Journal articles
Complete list of metadata

Cited literature [21 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01322760
Contributor : Bertrand Ducourthial <>
Submitted on : Friday, May 27, 2016 - 4:12:51 PM
Last modification on : Monday, December 14, 2020 - 9:52:39 AM
Long-term archiving on: : Sunday, August 28, 2016 - 10:42:26 AM

File

a-gradyn-32.pdf
Files produced by the author(s)

Identifiers

Citation

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

Share

Metrics

Record views

224

Files downloads

320