ICIS 2017: Computer and Information Science pp 123-137 | Cite as
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 first 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 formal pattern using the Event-B method, based on the refinement technique. The proposed pattern relies on the dynamicity aware-graph relabeling systems (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 algorithm, 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.
References
- 1.Abrial, J.R.: Modeling in Event-B: System and Software Engineering. Cambridge University Press (2010)Google Scholar
- 2.Abrial, J.R., Butler, M., Hallerstede, S., Hoang, T., Mehta, F., Voisin, L.: Rodin: an open toolset for modelling and reasoning in event-b. Int. J. STTT 12(6), 447–466 (2010)CrossRefGoogle Scholar
- 3.Back, R.J.R.: A calculus of refinements for program derivations. Acta Inform. 25, 593–624 (1988)MathSciNetCrossRefMATHGoogle Scholar
- 4.Barjon, M., Casteigts, A., Chaumette, S., Johnen, C., Neggaz, Y.M.: Maintaining a spanning forest in highly dynamic networks: the synchronous case. In: The 18th International Conference on Principles of Distributed Systems (PDS), vol. 8878, pp. 277–292. Springer (2014)Google Scholar
- 5.Cansell, D., Méry, D.: The event-b modelling method: concepts and case studies. In: Logics of Specification Languages, pp. 47–152. Springer, Berlin (2008)Google Scholar
- 6.Casteigts, A.: Contribution à l’algorithmique distribué dans les réseaux mobiles ad hoc. Ph.D. thesis, Université Sciences et Technologies—Bordeaux I (2007)Google Scholar
- 7.Casteigts, A., Chaumette, S.: Dynamicity aware graph relabeling systems (DA-GRS), a local computation based model to describe MANET algorithms. In: International Conference on Parallel and Distributed Computing Systems (PDCS), pp. 231–236 (2005)Google Scholar
- 8.Casteigts, A., Chaumette, S., Guinand, F., Pigné, Y.: Distributed maintenance of anytime available spanning trees in dynamic networks. In: The 12th International Conference on Ad-Hoc Networks and Wireless (ADHOC-NOW), vol. 7960, pp. 99–110. Springer (2013)Google Scholar
- 9.Casteigts, A., Flocchini, P.: Deterministic algorithms in dynamic networks: problems, analysis, and algorithmic tools. Commissioned by Defense Research and Development Canada, Technical report (2013)Google Scholar
- 10.Fakhfakh, F., Tounsi, M., Kacem, A.H., Mosbah, M.: A formal pattern for dynamic networks through evolving graphs. In: 12th IEEE/ACS International Conference of Computer Systems and Applications (AICCSA) (2015)Google Scholar
- 11.Fakhfakh, F., Tounsi, M., Kacem, A.H., Mosbah, M.: A refinement-based approach for proving distributed algorithms on evolving graphs. In: The 25th International Conference on Enabling Technologies: Infrastructure for Collaborative Enterprises (WETICE), pp. 44–49 (2016)Google Scholar
- 12.Ferreira, A.: On models and algorithms for dynamic communication networks: the case for evolving graphs. In: The 4e Rencontres Francophones sur les Aspects Algorithmiques des Telecommunications (AlgoTel), pp. 155–161. INRIA Press (2002)Google Scholar
- 13.Floriano, P., Goldman, A., Arantes, L.: Formalization of the necessary and sufficient connectivity conditions to the distributed mutual exclusion problem in dynamic networks. In: IEEE (ed.) The 10th International Symposium on Network Computing and Applications (NCA), pp. 203–210 (2011)Google Scholar
- 14.Godard, E., Métivier, Y., Tel, G.: Termination Detection of Local Computations. CoRR (2010). arXiv:1001.2785
- 15.Hoang, T.S., Fürst, A., Abrial, J.R.: Event-b patterns and their tool support. Softw. Syst. Model. 12, 229–244 (2013)CrossRefGoogle Scholar
- 16.Kerchove, F.M.D.: Relabeling algorithms on dynamic graphs. University of Le Havre, Technical report (2012)Google Scholar
- 17.Leavens, G.T., Abrial, J.R., Batory, D., Butler, M., Coglio, A., Fisler, K., Hehner, E., Jones, C., Miller, D., Peyton-Jones, S., Sitaraman, M., Smith, D.R., Stump, A.: Roadmap for enhanced languages and methods to aid verification. In: The 5th International Conference on Generative Programming and Component Engineering (GPCE), pp. 221–236. ACM (2006)Google Scholar
- 18.Litovsky, I., Métivier, Y., Sopena, E.: Handbook of graph grammars and computing by graph transformation. In: Chapter Graph Relabelling Systems and Distributed Algorithms, pp. 1–56. World Scientific (1999)Google Scholar
- 19.Roy, R.: Mobile ad hoc networks. In: Handbook of Mobile Ad-Hoc Networks for Mobility Models, pp. 3–22. Springer, US (2011)Google Scholar
- 20.Tel, G.: Introduction to Distributed Algorithms. Cambridge University Press (2000)Google Scholar