Refined Mean Field Analysis: The Gossip Shuffle Protocol Revisited - Coordination Models and Languages Access content directly
Conference Papers Year : 2020

Refined Mean Field Analysis: The Gossip Shuffle Protocol Revisited

Abstract

Gossip protocols form the basis of many smart collective adaptive systems. They are a class of fully decentralised, simple but robust protocols for the distribution of information throughout large scale networks with hundreds or thousands of nodes. Mean field analysis methods have made it possible to approximate and analyse performance aspects of such large scale protocols in an efficient way that is independent of the number of nodes in the network. Taking the gossip shuffle protocol as a benchmark, we evaluate a recently developed refined mean field approach. We illustrate the gain in accuracy this can provide for the analysis of medium size models analysing two key performance measures: replication and coverage. We also show that refined mean field analysis requires special attention to correctly capture the coordination aspects of the gossip shuffle protocol.
Fichier principal
Vignette du fichier
495623_1_En_15_Chapter.pdf (383.48 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03273995 , version 1 (29-06-2021)

Licence

Attribution

Identifiers

Cite

Nicolas Gast, Diego Latella, Mieke Massink. Refined Mean Field Analysis: The Gossip Shuffle Protocol Revisited. COORDINATION 2020 - 22nd IFIP WG 6.1 International Conference on Coordination Languages and Models, Jun 2020, Valletta, Malta. pp.230-239, ⟨10.1007/978-3-030-50029-0_15⟩. ⟨hal-03273995⟩
43 View
10 Download

Altmetric

Share

Gmail Facebook X LinkedIn More