Abstract
Leader election protocols are fundamental for coordination problems—such as consensus—in distributed computing. Recently, hierarchical leader election protocols have been proposed for dynamic systems where processes can dynamically join and leave, and no process has global information. However, quantitative analysis of such protocols is generally lacking. In this paper, we present a probabilistic model checking based approach to verify quantitative properties of these protocols. Particularly, we employ the compositional technique in the style of assume-guarantee reasoning such that the sub-protocols for each of the two layers are verified separately and the correctness of the whole protocol is guaranteed by the assume-guarantee rules. Moreover, within this framework we also augment the proposed model with additional features such as rewards. This allows the analysis of time or energy consumption of the protocol. Experiments have been conducted to demonstrate the effectiveness of our approach.
Similar content being viewed by others
References
Tucci-Piergiovanni S, Baldoni R. Eventual leader election in infinite arrival message-passing system model with bounded concurrency. In: Proceedings of European Dependable Computing Conference (EDCC). 2010, 127–134
Singh G. Leader election in the presence of link failures. IEEE Transactions on Parallel & Distributed Systems, 1996, 7(3): 231–236
Nakano K, Olariu S. A survey on leader election protocols for radio networks. In: Proceedings of International Symposium on Parallel Architectures, Algorithms and Networks. 2002, 63–68
Fischer M, Jiang H. Self-stabilizing leader election in networks of finite-state anonymous agents. In: Proceedings of the 10th International Conference on Principles of Distributed Systems. 2006, 395–409
Bakhshi R, Fokkink W, Pang J, Van De Pol J. Leader election in anonymous rings: Franklin goes probabilistic. In: Proceedings of the 5th IFIP International Conference on Theoretical Computer Science–Tcs. 2008, 57–72
Mostefaoui A, Raynal M, Travers C, Patterson S, Agrawal D, Abbadi A. From static distributed systems to dynamic systems. In: Proceedings of the 24th IEEE Symposium on Reliable Distributed Systems. 2005, 109–118
Larrea M, Raynal M, Soraluze I, Cortiñas R. Specifying and implementing an eventual leader service for dynamic systems. International Journal of Web and Grid Services. 2012, 8(3): 204–224
Gómez-Calzado C, Lafuente A, Larrea M, Raynal M. Fault-tolerant leader election in mobile dynamic distributed systems. In: Proceedings of the 19th Pacific Rim International Symposium on Dependable Computing. 2013, 78–87
Li H G, Wu W G, Zhou Y. Hierarchical eventual leader election for dynamic systems. In: Proceedings of International Conference on Algorithms and Architectures for Parallel Processing. 2014, 338–351
Baier C, Katoen J P. Principles of Model Checking. Cambridge: MIT Press. 2008.
Forejt V, Kwiatkowska M, Norman G, Parker D. Automated verification techniques for probabilistic systems. In: Bernardo M, Issarny V, eds. Formal Methods for the Design of Computer, Communication and Software Systems. Springer International Publishing, 2011, 53–113
Kwiatkowska M, Norman G, Parker D. Prism 4. 0: verification of probabilistic real-time systems. Lecture Notes in Computer Science. 2011, 6806: 585–591
Gu J Y, Zhou Y, Chen T L, Wu W G. Analyzing eventual leader election protocols for dynamic systems by probabilistic model checking. In: Proceedings of International Conference on Cloud Computing and Security. 2015, 192–205
Wu W G, Cao J N, Raynal M. Eventual clusterer: a modular approach to designing hierarchical consensus protocols in manets. IEEE Transactions on Parallel and Distributed Systems. 2009, 20(6): 753–765
Yang Z W, Wu WG, Chen Y S, Zhang J. Efficient information dissemination in dynamic networks. In: Proceedings of the 42nd International Conference on Parallel Processing. 2013, 603–610
Kwiatkowska M, Norman G, Parker D, Qu H Y. Assume-guarantee verification for probabilistic systems. In: Proceedings of International Conference on Tools and Algorithms for the Construction and Analysis of Systems. 2010, 23–37
Kwiatkowska M, Norman G, Parker D, Qu H Y. Compositional probabilistic verification through multi-objective model checking. Information and Computation. 2013, 232: 38–65
Shen J, Tan HW, Wang J, Wang J W, Lee S Y. A novel routing protocol providing good transmission reliability in underwater sensor networks. Journal of Internet Technology. 2015, 16(1): 171–178
Xie S D, Wang Y X. Construction of tree network with limited delivery latency in homogeneous wireless sensor networks. Wireless Personal Communications. 2014, 78(1): 231–246
Yue H D, Katoen J P. Leader election in anonymous radio networks: model checking energy consumption. In: Proceedings of International Conference on Analytical and Stochastic Modeling Techniques and Applications. 2010, 247–261
Rault T, Bouabdallah A, Challal Y. Energy efficiency in wireless sensor networks: A top-down survey. Computer Networks. 2014, 67: 104–122
Gupta I, Van Renesse R, Birman K P. A probabilistically correct leader election protocol for large groups. In: Proceedings of International Symposium on Distributed Computing. 2000, 89–103
Jiménez E, Arévalo V E, Herrera C, Tang J. Eventual election of multiple leaders for solving consensus in anonymous systems. The Journal of Supercomputing. 2015, 71(10): 3726–3743
Duflot M, Kwiatkowska M, Norman G, Parker D, Peyronnet D, Picaronny C, Sproston J. Practical applications of probabilistic model checking to communication protocols. In: Gnesi S, Margaria T, eds. Formal Methods for Industrial Critical Systems: A Survey of Applications. Wiley, 2012, 133–150
Baier C, Dubslaff C, Klein J, Klü ppelholz S, Wunderlich S. Probabilistic model checking for energy-utility analysis. In: van Breugel F, Kashefi E, Palamidessi C, et al, eds. Horizons of the Mind. A Tribute to Prakash Panangaden. Springer International Publishing, 2014, 96–123
Naskos A, Stachtiari E, Gounaris A, Katsaros P, Tsoumakos D, Konstantinou I, Sioutas S. Dependable horizontal scaling based on probabilistic model checking. In: Proceedings of the 15th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing. 2015, 31–40
He K L, Zhang M, He J, Chen Y X. Probabilistic model checking of pipe protocol. In: Proceedings of International Symposium on Theoretical Aspects of Software Engineering. 2015, 135–138
Zhang F L, Bu L, Wang L Z, Zhao J H, Chen X, Zhang T, Li X D. Modeling and evaluation of wireless sensor network protocols by stochastic timed automata. Electronic Notes in Theoretical Computer Science. 2013, 296: 261–277
Acknowledgements
This work was supported by the Fundamental Research Funds for the Central Universities (NS2016093).
Author information
Authors and Affiliations
Corresponding author
Additional information
Yu Zhou is an associate professor at Nanjing University of Aeronautics and Astronautics, China. He received his PhD degree in computer science from Nanjing University, China in 2009. His research interests are mainly in software engineering, with a particular focus on software evolution, software architecture and reliability analysis with formal methods. He has published more than 50 papers in these fields. He is currently a senior member of China Computer Federation (CCF) and a member of CCF Technical Committees on System Software, and Software Engineering.
Nvqi Zhou is a master student at Nanjing University of Aeronautics and Astronautics, China. Her research interest is formal methods and software verification. She is a student member of China Computer Federation (CCF).
Tingting Han is a lecturer at Birkbeck, University of London, UK. She received the BS and ME degrees in computer science from Nanjing University, China and her PhD degree in computer science from RWTH Aachen University, Germany in 2009. Her research interests are mainly in formal modelling and verification, especially the probabilistic aspects. She has published more than 30 papers in these fields.
Jiayi Gu is a master student at Nanjing University of Aeronautics and Astronautics, China. His research interest is formal methods and software verification. He is a student member of China Computer Federation (CCF).
Weigang Wu received the BS and MS degrees in computer science from Xi’an Jiaotong University, China in 1998 and 2003, respectively, and the PhD degree in computer science from Hong Kong Polytechnic University, China in 2007. He is currently a professor at Sun Yat-sen University, China. His research interests include distributed systems and wireless networks, especially cloud computing platforms and ad hoc networks. He has published more than 60 papers in conferences and journals. Dr. Wu has served as a member of editorial board of two international journals: Frontiers of Computer Science and Ad Hoc & SensorWireless Networks. He is also an organizing/program committee member for many international conferences.
Electronic supplementary material
Rights and permissions
About this article
Cite this article
Zhou, Y., Zhou, N., Han, T. et al. Probabilistic verification of hierarchical leader election protocol in dynamic systems. Front. Comput. Sci. 12, 763–776 (2018). https://doi.org/10.1007/s11704-018-6173-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11704-018-6173-6