Filters








2,313 Hits in 6.1 sec

Self-stabilizing Leader Election in Networks of Finite-State Anonymous Agents [chapter]

Michael Fischer, Hong Jiang
2006 Lecture Notes in Computer Science  
This paper considers the self-stabilizing leader-election problem in a model of interacting anonymous finite-state agents.  ...  Anonymous finite-state agents model systems of identical simple computational nodes such as sensor networks and biological computers.  ...  Conclusion We study the problem of self-stabilizing leader election in a model of finite-state anonymous agents.  ... 
doi:10.1007/11945529_28 fatcat:gift76x7rbhybdjtxt4lwe5gge

Stabilizing Tiny Interaction Protocols [article]

Davide Canepa, Maria Gradinariu Potop-Butucaru
2010 arXiv   pre-print
Nevertheless, in order to reach the full power of classical self-stabilizing algorithms more complex classes of agents have to be considered (e.g. agents with memory, identifiers or communication skills  ...  While interacting, a pair of neighbouring nodes may create mobile agents (that materialize in the current work the token abstraction) that perform traversals of the network and accelerate the system stabilization  ...  A system is silently self-stabilizing for the leader election specification iff each execution of the system converges in a finite number of steps to a unique token legitimate configuration and no node  ... 
arXiv:0806.3471v2 fatcat:odfdkntoifb5dmcfol4t2rucre

Easy Stabilization with an Agent [chapter]

Joffroy Beauquier, Thomas Hérault, Elad Schiller
2001 Lecture Notes in Computer Science  
Basically, an agent performs a traversal of the network and if necessary, modifies the local states of the nodes, yielding stabilization.  ...  The paper presents a technique for achieving stabilization in distributed systems.  ...  The leader election algorithm is agent-stabilizing. Sketch of Proof. The agent has a finite time to live, as it was proven in theorem 2.  ... 
doi:10.1007/3-540-45438-1_3 fatcat:wmhx3nlyzve4rk5kgie7mc7b6e

On the Self-stabilization of Mobile Robots in Graphs [article]

Lélia Blin, Maria Gradinariu Potop-Butucaru (INRIA Rocquencourt, LIP6), Sébastien Tixeuil
2007 arXiv   pre-print
We concentrate on the core building blocks of robot and agents problems: naming and leader election.  ...  Second, in this model, we study the possibility of designing self-stabilizing algorithms when those algorithms are run by mobile robots (or agents) evolving on a graph.  ...  By contrast, in this paper, we focus on the self-stabilization of the agents themselves, and our model keeps the number of agents fixed for the whole life of the network.  ... 
arXiv:0708.0909v2 fatcat:irnajdebmvge5oe4ik4heaqvbu

Self-stabilizing population protocols

Dana Angluin, James Aspnes, Michael J. Fischer, Hong Jiang
2008 ACM Transactions on Autonomous and Adaptive Systems  
Self-stabilization in a model of anonymous, asynchronous interacting agents deployed in a network of unknown size is considered.  ...  Constant-space protocols are given for leader election in rings, local-addressing in degree-bounded graphs, and establishing consistent global direction in an undirected ring.  ...  There are impossibility results and space bounds on self-stabilizing leader election in general rings in various other models [3, 8] .  ... 
doi:10.1145/1452001.1452003 fatcat:7inf6oo7vvhn7kyvbe6yw66m2u

Self-stabilizing Population Protocols [chapter]

Dana Angluin, James Aspnes, Michael J. Fischer, Hong Jiang
2006 Lecture Notes in Computer Science  
Self-stabilization in a model of anonymous, asynchronous interacting agents deployed in a network of unknown size is considered.  ...  Constant-space protocols are given for leader election in rings, local-addressing in degree-bounded graphs, and establishing consistent global direction in an undirected ring.  ...  There are impossibility results and space bounds on self-stabilizing leader election in general rings in various other models [3, 8] .  ... 
doi:10.1007/11795490_10 fatcat:ojvtg73gzvcmfggr2wnqwc6mhm

Loosely-stabilizing leader election in a population protocol model

Yuichi Sudo, Junya Nakamura, Yukiko Yamauchi, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa
2012 Theoretical Computer Science  
This result proves that introduction of the loose-stabilization circumvents the already-known impossibility result; the self-stabilizing leader election problem in the PPP model of complete networks cannot  ...  To show the effectiveness and feasibility of this new concept, we present a probabilistic loosely-stabilizing leader election protocol in the Probabilistic Population Protocol (PPP) model of complete networks  ...  leader while the self-stabilizing leader election in the PPP model of complete networks is impossible without the knowledge of the exact network size [11] .  ... 
doi:10.1016/j.tcs.2012.01.007 fatcat:knfqbyna3zez5ikwd3ug72mcyy

Mediated Population Protocols: Leader Election and Applications [chapter]

Shantanu Das, Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta
2017 Lecture Notes in Computer Science  
We study the leader election problem and some applications in constant-state mediated population protocols.  ...  We show how to elect a unique leader if the graph of the possible interactions between agents is complete (as in the traditional population protocol model) or a tree.  ...  Formally, the set of agent states includes some leader states, and leader election is the task consisting of the executions in which eventually there is a unique agent in the network with a leader state  ... 
doi:10.1007/978-3-319-55911-7_13 fatcat:nkjzc4olj5gkph4oe6fco4g4au

Polylogarithmic-Time Leader Election in Population Protocols Using Polylogarithmic States [article]

Dan Alistarh, Rati Gelashvili
2017 arXiv   pre-print
Population protocols are networks of finite-state agents, interacting randomly, and updating their states using simple rules.  ...  The election of a unique leader agent is a key requirement in such computational constructions.  ...  Agents are anonymous, so any two agents in the same state are identical and interchangeable.  ... 
arXiv:1502.05745v3 fatcat:ik4b46m2kvbmjipwewvhs5qyfi

A Combinatorial Characterization of Self-Stabilizing Population Protocols [article]

Shaan Mathur, Rafail Ostrovsky
2020 arXiv   pre-print
In particular, we investigate self-stabilization in systems of n finite state agents in which a malicious scheduler selects an arbitrary sequence of pairwise interactions under a global fairness condition  ...  Our positive construction uses Dickson's Lemma to develop the notion of the root set, a concept that turns out to fundamentally characterize self-stabilization in this model.  ...  Acknowledgments We greatly thank the anonymous reviewers of this paper for their helpful comments. This work is supported in part by DARPA under  ... 
arXiv:2010.03869v2 fatcat:wf5f5b4z2fahfjdayqbjazpgju

The computational power of simple protocols for self-awareness on graphs

Ioannis Chatzigiannakis, Othon Michail, Stavros Nikolaou, Paul G. Spirakis
2013 Theoretical Computer Science  
We propose a simple model, the Mediated Graph Protocol (MGP ) model, similar to the Population Protocol model of Angluin et al., in which each network link is characterized by a state taken from a finite  ...  The agents are modeled as finite-state automata and run the same global graph protocol.  ...  We would like to specifically thank Theofanis Raptis for his useful comments throughout the writing of this work.  ... 
doi:10.1016/j.tcs.2012.08.026 fatcat:psusxzmbevfhhdrhtfftldvyhu

The Computational Power of Simple Protocols for Self-awareness on Graphs [chapter]

Ioannis Chatzigiannakis, Othon Michail, Stavros Nikolaou, Paul G. Spirakis
2011 Lecture Notes in Computer Science  
We propose a simple model, the Mediated Graph Protocol (MGP ) model, similar to the Population Protocol model of Angluin et al., in which each network link is characterized by a state taken from a finite  ...  The agents are modeled as finite-state automata and run the same global graph protocol.  ...  We would like to specifically thank Theofanis Raptis for his useful comments throughout the writing of this work.  ... 
doi:10.1007/978-3-642-24550-3_12 fatcat:imp4jikohjaohlb3nxi5m5qd4y

An Introduction to Population Protocols [chapter]

James Aspnes, Eric Ruppert
2009 Middleware for Network Eccentric and Mobile Applications  
A preliminary version of this survey appeared in [11] .  ...  Acknowledgments James Aspnes was supported in part by NSF grant CNS-0435201. Eric Ruppert was supported in part by the Natural Sciences and Engineering Research Council of Canada.  ...  Other results in this paper include a partial characterization of which network topologies do or do not support self-stabilizing leader election.  ... 
doi:10.1007/978-3-540-89707-1_5 fatcat:vd5srezgxncgfl33k2n4y7zgzq

Verifying Self-stabilizing Population Protocols with Coq

Yuxin Deng, Jean-François Monin
2009 2009 Third IEEE International Symposium on Theoretical Aspects of Software Engineering  
We propose a general formalization of self-stabilizing population protocols with the Coq proof assistant. It is used in reasoning about a concrete protocol for leader election in complete graphs.  ...  Population protocols are an elegant model recently introduced for distributed algorithms running in large and unreliable networks of tiny mobile agents.  ...  Acknowledgments We thank the anonymous referees for useful comments on an earlier version of the paper.  ... 
doi:10.1109/tase.2009.9 dblp:conf/tase/DengM09 fatcat:3opvhcpeezadrnrat2r3bzkn4m

Time-Optimal Self-Stabilizing Leader Election on Rings in Population Protocols [article]

Daisuke Yokota, Yuichi Sudo, Toshimitsu Masuzawa
2020 arXiv   pre-print
We propose a self-stabilizing leader election protocol on directed rings in the model of population protocols.  ...  Given an upper bound N on the population size n, the proposed protocol elects a unique leader within O(nN) expected steps starting from any configuration and uses O(N) states.  ...  Self-stabilization is of great importance in the PP model because self-stabilization tolerates any finite number of transient faults, and this is a necessary property in a network consisting of a large  ... 
arXiv:2009.10926v1 fatcat:yqtpdljpbfdjjnijbflcf52cf4
« Previous Showing results 1 — 15 out of 2,313 results