Analysis of a gossip protocol in PRISM

Kwiatkowska, M., Norman, G. and Parker, D. (2008) Analysis of a gossip protocol in PRISM. ACM SIGMETRICS Performance Evaluation Review, 36(3), pp. 17-22. (doi:10.1145/1481506.1481511)

Full text not currently available from Enlighten.

Publisher's URL: http://doi.acm.org/10.1145/1481506.1481511

Abstract

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.

Item Type:Articles
Status:Published
Refereed:Yes
Glasgow Author(s) Enlighten ID:Norman, Dr Gethin
Authors: Kwiatkowska, M., Norman, G., and Parker, D.
Subjects:Q Science > QA Mathematics > QA76 Computer software
College/School:College of Science and Engineering > School of Computing Science
Journal Name:ACM SIGMETRICS Performance Evaluation Review
Journal Abbr.:Performance Evaluation Review
Publisher:ACM
ISSN:0163-5999
ISSN (Online):1557-9484

University Staff: Request a correction | Enlighten Editors: Update this record