This paper analyzes two classes of consensus algorithms in presence of bounded measurement errors. The considered protocols adopt an updating rule based either on constant or vani...
— This paper analyzes two classes of consensus algorithms in presence of bounded measurement errors. The protocols taken into account adopt an updating rule based either on const...
— We describe a distributed algorithm for solving the rendezvous problem based on consensus protocols. We extend our previous work by considering the case when the evolution of t...
Protocols which solve agreement problems are essential building blocks for fault tolerant distributed applications. While many protocols have been published, little has been done ...
This paper introduces a simple notion of layering as a tool for analyzing well-behaved runs of a given model of distributed computation. Using layering, a model-independent analysi...