In this paper we explore the practical possibilities of using formal methods to analyze gossiping networks. In particular, we use mCRL and Groove to model the peer sampling service, and analyze it through a series of model transformations to CTMCs and finally MRMs. Our tools compute the expected value of various network quality indicators, such as average path lengths, over all possible system runs. Both transient and steady state analysis are supported. We compare our results with the simulation and emulation results found in .
|Number of pages||10|
|Journal||Performance Evaluation Review|
|Publication status||Published - Dec 2008|
- FMT-FMPA: FORMAL METHODS FOR PERFORMANCE ANALYSIS