Formal analysis techniques for gossiping protocols

Abstract. We consider distributed timed systems that implement leader election protocols which are at the heart of clock synchronization protocols. We develop abstraction techniques for parameterized model checking of such protocols under arbitrary network topologies, where nodes have independently evolving clocks. We apply our technique for model checking the root election part of the flooding time synchronisation protocol (FTSP), and obtain improved results compared to previous work. We model check the protocol for all topologies in which the distance to the node to be elected leader is bounded by a given parameter.

show abstract

“…1≤i≤n to S; this models the periodic task of the node i. 4 . Let us assume that all states of A i accept a transition with tick i ?.…”

Section: Predicates and Ltl Satisfactionmentioning

confidence: 99%

An Abstraction Technique for Parameterized Model Checking of Leader Election Protocols: Application to FTSP

Sankur

Talpin

2017

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

show abstract

“…Conditions C2 and C3 hold, since there are only finitely many pairs of states, each of which has finitely many possible transitions per time step; see (4), (5), (6) where the domain of the distribution functions is required to be finite. For condition C3 note that the maximum multiplicity is bounded for all local transitions and this yields a global bound since there are only finitely many possible transitions.…”

Section: B Mean-field Convergence Revisitedmentioning

confidence: 99%

“…Straightforward analytical models are too large to be handled by model checkers (e.g. [1], [2], [3], [4]). Abstracting away from details of a system can be an efficient approach to cope with the infamous state space explosion.…”

Section: Introductionmentioning

confidence: 99%

Automating the Mean-Field Method for Large Dynamic Gossip Networks

Bakhshi

Endrullis

et al. 2010

2010 Seventh International Conference on the Quantitative Evaluation of Systems

Self Cite

View full text Add to dashboard Cite

Abstract-We investigate an abstraction method, called meanfield method, for the performance evaluation of dynamic networks with pairwise communication between nodes. It allows us to evaluate systems with very large numbers of nodes, that is, systems of a size where traditional performance evaluation methods fall short.While the mean-field analysis is well-established in epidemics and for chemical reaction systems, it is rarely used for communication networks because a mean-field model tends to abstract away the underlying topology.To represent topological information, however, we extend the mean-field analysis with the concept of classes of states. At the abstraction level of classes we define the network topology by means of connectivity between nodes. This enables us to encode physical node positions and model dynamic networks by allowing nodes to change their class membership whenever they make a local state transition. Based on these extensions, we derive and implement algorithms for automating a mean-field based performance evaluation.

show abstract

“…Bakhshi et al [1] surveyed formal analysis techniques for gossiping protocols. Our evaluation metrics were influenced by a consistency count metric described by Kuenning et al [8].…”

Section: Related Workmentioning

confidence: 99%

Designing an asynchronous group communication middleware for wireless users

Chandra²

2009

Proceedings of the 12th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems

View full text Add to dashboard Cite

We evaluate an asynchronous gossiping middleware for wireless users that propagates messages from any group member to all the other group members. This propagation can either be implemented through distributed mechanisms or can be mediated through servers. Our analysis of asynchronous mechanisms using wireless user availability traces from an university, corporation and a hot spot federation shows that the fundamental impediment to the system performance is the wireless user availability patterns. We then investigate the relative performance for several distributed as well as server mediated approaches. We show that pull mechanisms effectively randomizes the times when messages are propagated and thus achieves better performance than push based mechanisms. We then develop an adaptive approach that customizes the propagation frequency using the last session duration and show that this mechanism exhibits good performance when the required propagation intervals are large. We also show that for a given number of gossips, it is preferable to propagate messages to all available nodes rather than increasing the frequency while correspondingly reducing the number of nodes to propagate messages. Our results allow middleware developers to choose the appropriate propagation model to satisfy their application constraints.

show abstract

Formal analysis techniques for gossiping protocols

Cited by 28 publications

References 85 publications

An Abstraction Technique for Parameterized Model Checking of Leader Election Protocols: Application to FTSP

An Abstraction Technique for Parameterized Model Checking of Leader Election Protocols: Application to FTSP

Automating the Mean-Field Method for Large Dynamic Gossip Networks

Designing an asynchronous group communication middleware for wireless users

Contact Info

Product

Resources

About