A Formal Approach for Maintaining Forest Topologies in Dynamic Networks

Abstract : In this paper, we focus on maintaining a forest of spanning trees in dynamic networks. In fact, we propose an approach based on two levels for specifying and proving distributed algorithms in a forest. The rst level allows us to control the dynamic structure of the network by triggering a maintenance operation when the forest is altered. To do so, we develop a for- mal pattern using the Event-B method, based on the refinement technique. The proposed pattern relies on the Dynamicity Aware-Graph Relabeling Sys- tems (DA-GRS) which is an existing model for building and maintaining a spanning forest in dynamic networks. It is based on evolving graphs as a powerful model to record the evolution of a network topology. The second level of our approach deals with distributed algorithms which can be applied to spanning trees of the forest. Through an example of a leader election algo- rithm, we illustrate our pattern. The proof statistics show that our solution can save efforts on specifying as well as proving the correctness of distributed algorithms in a forest topology.
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01495807
Contributor : Mohamed Mosbah <>
Submitted on : Sunday, March 26, 2017 - 10:52:10 PM
Last modification on : Tuesday, February 19, 2019 - 3:40:04 PM

Identifiers

Citation

Faten Fakhfakh, Mohamed Tounsi, Mohamed Mosbah, Ahmed Hadj Kacem, Dominique Méry. A Formal Approach for Maintaining Forest Topologies in Dynamic Networks. ICIS 2017 - 16th IEEE/ACIS International Conference on Computer and Information Science, May 2017, Wuhan, China. pp.123-137, ⟨10.1007/978-3-319-60170-0_9⟩. ⟨hal-01495807⟩

Share

Metrics

Record views

318