Filters








63,180 Hits in 7.5 sec

The Power of Global Knowledge on Self-stabilizing Population Protocols [article]

Yuichi Sudo, Masahiro Shibata, Junya Nakamura, Yonghwan Kim, Toshimitsu Masuzawa
2020 arXiv   pre-print
In this paper, we investigate the effect of global knowledge on the possibility of self-stabilizing population protocols in arbitrary graphs.  ...  However, global knowledge, such as the number of nodes in a network, sometimes allows us to design a self-stabilizing protocol for such problems.  ...  This fact and the above propositions show how powerful this kind of global knowledge is when we design self-stabilizing population protocols.  ... 
arXiv:2003.07491v2 fatcat:hrdah26wfzepff73g5ad5nom4m

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  ...  Our work shows that the agent paradigm is an elegant distributed tool for achieving self-stabilization in Tiny Interaction Protocols (TIP).  ...  Another problem addressed in the classical model of population protocols is the self-stabilizing token circulation. This problem has been addressed only in non-uniform population protocols [2] .  ... 
arXiv:0806.3471v2 fatcat:odfdkntoifb5dmcfol4t2rucre

Exploring the interdisciplinary connections of gossip-based systems

Paolo Costa, Vincent Gramoli, Márk Jelasity, Gian Paolo Jesi, Erwan Le Merrer, Alberto Montresor, Leonardo Querzoni
2007 ACM SIGOPS Operating Systems Review  
In addition, we believe that comparisons with other fields also helps clarify the definition of gossip protocols and represents a necessary first step towards an eventual formal definition.  ...  Such a broader perspective would allow us to import knowledge and tools to design and understand gossip-based distributed systems, and we could also export accumulated knowledge to re-interpret some of  ...  On the one hand, it is clear that not all self-stabilizing protocols are gossip-related.  ... 
doi:10.1145/1317379.1317388 fatcat:5wzxk4wumzgzfdf7wecl6x5sxm

Self-stabilizing Population Protocols [chapter]

Dana Angluin, James Aspnes, Michael J. Fischer, Hong Jiang
2006 Lecture Notes in Computer Science  
A general method for eliminating nondeterministic transitions from the self-stabilizing implementation of a large family of behaviors is used to simplify the constructions, and general conditions under  ...  Self-stabilization in a model of anonymous, asynchronous interacting agents deployed in a network of unknown size is considered.  ...  The leader election protocol we presented in this paper depends on the size of the ring.  ... 
doi:10.1007/11795490_10 fatcat:ojvtg73gzvcmfggr2wnqwc6mhm

Self-stabilizing population protocols

Dana Angluin, James Aspnes, Michael J. Fischer, Hong Jiang
2008 ACM Transactions on Autonomous and Adaptive Systems  
A general method for eliminating nondeterministic transitions from the self-stabilizing implementation of a large family of behaviors is used to simplify the constructions, and general conditions under  ...  Self-stabilization in a model of anonymous, asynchronous interacting agents deployed in a network of unknown size is considered.  ...  The leader election protocol we presented in this paper depends on the size of the ring.  ... 
doi:10.1145/1452001.1452003 fatcat:7inf6oo7vvhn7kyvbe6yw66m2u

Strategically Leapfrogging Education in Prehospital Trauma Management: Four-Tiered Training Protocols

Rohit Abraham, Dinesh Vyas, Mayur Narayan, Arpita Vyas
2015 American Journal of Robotic Surgery  
The innovative pedagogy of this trauma education program utilizes MOOC for global scalability and a "train-the-trainer" approach for exponential growth-both components help fast developing countries reach  ...  a critical mass of first responders needed for the base of an evolving EMS.  ...  expansion of two-day, hands-on training programs to interested regions with densely populated user bases.  ... 
doi:10.1166/ajrs.2015.1022 pmid:27419222 pmcid:PMC4941789 fatcat:qy5lfd3wwfhwppnbbowz2plpaq

Space-Optimal Population Protocols for Uniform Bipartition Under Global Fairness

Hiroto YASUMI, Fukuhito OOSHITA, Ken'ichi YAMAGUCHI, Michiko INOUE
2019 IEICE transactions on information and systems  
As a result, we completely clarify solvability of the uniform bipartition problem under global fairness and, if solvable, show the tight upper and lower bounds on the number of states.  ...  The goal of the uniform bipartition problem is to divide a population into two groups of the same size.  ...  [8] proposed a self-stabilizing leader election protocol with knowledge of n, and proved that knowledge of n is necessary to construct a self-stabilizing leader election protocol, where n is the number  ... 
doi:10.1587/transinf.2018fcp0009 fatcat:rytc4cgd4jbnnhhknkgupgtfy4

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

Shaan Mathur, Rafail Ostrovsky
2020 arXiv   pre-print
We fully characterize self-stabilizing functions in population protocols for complete interaction graphs.  ...  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  ...  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 [chapter]

Ioannis Chatzigiannakis, Othon Michail, Stavros Nikolaou, Paul G. Spirakis
2011 Lecture Notes in Computer Science  
The agents are modeled as finite-state automata and run the same global graph protocol.  ...  We provide some interesting properties of the MGP model among which is the ability to decide properties on stabilizing (initially changing for a finite number of steps) input graphs and we show that the  ...  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

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

Ioannis Chatzigiannakis, Othon Michail, Stavros Nikolaou, Paul G. Spirakis
2013 Theoretical Computer Science  
The agents are modeled as finite-state automata and run the same global graph protocol.  ...  We provide some interesting properties of the MGP model among which is the ability to decide properties on stabilizing (initially changing for a finite number of steps) input graphs and we show that the  ...  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

A Cross-Layer Architecture for Autonomic Communications [chapter]

M. A. Razzaque, Simon Dobson, Paddy Nixon
2006 Lecture Notes in Computer Science  
One obvious shortcoming of the strict layering is the lack of information sharing between protocol layers.  ...  Only CrossTalk [9] is based on a (even partially) global view of the network.  ...  a knowledge plane populated using our gossiping technique.  ... 
doi:10.1007/11880905_3 fatcat:sbmgqqvl5bbg7hgnu5ug6ztmn4

Cross-Layer Architectures for Autonomic Communications

Mohammad Abdur Razzaque, Simon Dobson, Paddy Nixon
2007 Journal of Network and Systems Management  
One obvious shortcoming of the strict layering is the lack of information sharing between protocol layers.  ...  Only CrossTalk [9] is based on a (even partially) global view of the network.  ...  a knowledge plane populated using our gossiping technique.  ... 
doi:10.1007/s10922-006-9051-8 fatcat:67qma45fl5adfbrib4vsk4aupe

Scalable and Efficient Sensor Network Self-Configuration in BioANS

Michael Breza, Richard Anthony, Julie McCann
2007 First International Conference on Self-Adaptive and Self-Organizing Systems (SASO 2007)  
A model of BioANS is used to simulate the performance of the protocol in a variety of possible WSN deployments.  ...  It enables an information requester to access data from a sensor network which meets a qualitative criterion based on context in an efficient manner.  ...  First International Conference on Self-Adaptive and Self-Organizing Systems (SASO 2007) 0-7695-2906-2/07 $25.00 © 2007  ... 
doi:10.1109/saso.2007.47 dblp:conf/saso/BrezaAM07 fatcat:nthbwhd7xre4tighha3khhn24e

Nothing can compare with a population, besides agents

Yann Busnel
2014 2014 21st International Conference on Telecommunications (ICT)  
Particularly, some subclasses of MAS seem to fit the same computational power than population protocols. Population protocols provide theoretical foundations for mobile tiny device networks.  ...  The contribution of this paper arise from the observation that population protocols and multiagent systems (MAS) bear many resemblances.  ...  The author would like to warmly thank Philippe Lamarre (INSA Lyon, France) for his valuable discussions at the early steps of this work.  ... 
doi:10.1109/ict.2014.6845151 dblp:conf/ict/Busnel14 fatcat:45tvjshg5neyjhsadrxlgpqt6a

Terminating Population Protocols via Some Minimal Global Knowledge Assumptions [chapter]

Othon Michail, Ioannis Chatzigiannakis, Paul G. Spirakis
2012 Lecture Notes in Computer Science  
This is simply a known upper bound on the cover time of a random walk. This allows us to introduce termination into population protocols, a capability that is crucial for any distributed system.  ...  By reduction to an oracle-model we arrive at a very satisfactory lower bound on the computational power of the model: we prove that it is at least as strong as a Turing Machine of space log n with input  ...  comments throughout the preparation of this work.  ... 
doi:10.1007/978-3-642-33536-5_8 fatcat:ivzdh6basnbczj7jstol3spzui
« Previous Showing results 1 — 15 out of 63,180 results