Analysis of a gossip protocol in PRISM

Gossip protocols have been proposed as a robust and efficient method for disseminating information throughout dynamically changing networks. We present an analysis of a gossip protocol using probabilistic model checking and the tool PRISM. Since the behaviour of these protocols is both probabilistic and nondeterministic in nature, this provides a good example of the exhaustive, quantitative analysis that probabilistic model checking techniques can provide. In particular, we compute minimum and maximum values, representing the best- and worst-case performance of the protocol under any scheduling, and investigate both their relationship with the average values that would be obtained through simulation and the precise scheduling which achieve these values.

[1]  Marta Z. Kwiatkowska,et al.  Performance analysis of probabilistic timed automata using digital clocks , 2003, Formal Methods Syst. Des..

[2]  Lijun Zhang,et al.  Probabilistic Model Checking Modulo Theories , 2007, Fourth International Conference on the Quantitative Evaluation of Systems (QEST 2007).

[3]  Marta Z. Kwiatkowska,et al.  Probabilistic Model Checking of the IEEE 802.11 Wireless Local Area Network Protocol , 2002, PAPM-PROBMIV.

[4]  Christel Baier,et al.  Model-Checking Algorithms for Continuous-Time Markov Chains , 2002, IEEE Trans. Software Eng..

[5]  Peng Gao,et al.  Formal Verification and Simulation for Performance Analysis for Probabilistic Broadcast Protocols , 2006, ADHOC-NOW.

[6]  J. Kemeny,et al.  Denumerable Markov chains , 1969 .

[7]  Andrew Hinton,et al.  PRISM: A Tool for Automatic Verification of Probabilistic Systems , 2006, TACAS.

[8]  Jan J. M. M. Rutten,et al.  Mathematical techniques for analyzing concurrent and probabilistic systems , 2004, CRM monograph series.

[9]  Marta Z. Kwiatkowska,et al.  Symbolic model checking for probabilistic timed automata , 2007, Inf. Comput..

[10]  Christel Baier,et al.  Model checking for a probabilistic branching time logic with fairness , 1998, Distributed Computing.

[11]  Bengt Jonsson,et al.  A logic for reasoning about time and reliability , 1990, Formal Aspects of Computing.

[12]  F. Werner,et al.  Analysis of the Authenticated Query Flooding Protocol by Probabilistic Means , 2008, 2008 Fifth Annual Conference on Wireless on Demand Network Systems and Services.

[13]  Marta Z. Kwiatkowska,et al.  Game-based Abstraction for Markov Decision Processes , 2006, Third International Conference on the Quantitative Evaluation of Systems - (QEST'06).

[14]  Andrea Bianco,et al.  Model Checking of Probabalistic and Nondeterministic Systems , 1995, FSTTCS.

[15]  Marta Z. Kwiatkowska,et al.  Symmetry Reduction for Probabilistic Model Checking , 2006, CAV.

[16]  Boudewijn R. Haverkort,et al.  Formal analysis techniques for gossiping protocols , 2007, OPSR.

[17]  Marie Duflot,et al.  A formal analysis of bluetooth device discovery , 2006, 37th Annual Hawaii International Conference on System Sciences, 2004. Proceedings of the.

[18]  Anne-Marie Kermarrec,et al.  Gossip-based peer sampling , 2007, TOCS.