Filters








21,511 Hits in 8.8 sec

A Maximum Degree Self-Stabilizing Spanning Tree Algorithm [chapter]

Deniz Cokuslu, Kayhan Erciyes, Abdelkader Hameurlain
2010 Lecture Notes in Electrical Engineering  
Although there are known advantages of the self stabilization paradigm such as fault tolerance, tradeoffs between classical and self-stabilizing approaches to build spanning trees using distributed algorithms  ...  In this paper, we examine and compare two similar existing spanning tree construction algorithms which rely on different paradigms: classical versus self stabilization approach and propose a new selfstabilizing  ...  According to our experimental observations, we can conclude that in dynamic environments in which the nodes come and go, self stabilization algorithms can be used effectively if the runtime tradeoff is  ... 
doi:10.1007/978-90-481-9794-1_73 fatcat:klcaaui73bblbc34ryemd5enbu

Fast Self-Stabilizing Minimum Spanning Tree Construction [article]

Lélia Blin, Shlomi Dolev, Maria Potop-Butucaru (LIP6, INRIA Rocquencourt), Stephane Rovedakis
2010 arXiv   pre-print
We present a novel self-stabilizing algorithm for minimum spanning tree (MST) construction. The space complexity of our solution is O(^2n) bits and it converges in O(n^2) rounds.  ...  The main ingredient used in our algorithm is the design, for the first time in self-stabilizing settings, of a labeling scheme for computing the nearest common ancestor with only O(^2n) bits.  ...  The emergence of large scale and dynamic systems, often subject to transient faults, revives the study of scalable and self-stabilizing algorithms.  ... 
arXiv:1006.3141v2 fatcat:ufv723nnlzfdxacjla662ps5lu

Fast Self-stabilizing Minimum Spanning Tree Construction [chapter]

Lélia Blin, Shlomi Dolev, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis
2010 Lecture Notes in Computer Science  
We present a novel self-stabilizing algorithm for minimum spanning tree (MST) construction. The space complexity of our solution is O(log 2 n) bits and it converges in O(n 2 ) rounds.  ...  The main ingredient used in our algorithm is the design, for the first time in self-stabilizing settings, of a labeling scheme for computing the nearest common ancestor with only O(log 2 n) bits.  ...  The emergence of large scale and dynamic systems, often subject to transient faults, revives the study of scalable and self-stabilizing algorithms.  ... 
doi:10.1007/978-3-642-15763-9_46 fatcat:eduahdf4g5gf5abmt42mp5t7ce

Self-stabilizing minimum degree spanning tree within one from the optimal degree

Lélia Blin, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis
2011 Journal of Parallel and Distributed Computing  
We propose a self-stabilizing algorithm for constructing a Minimum-Degree Spanning Tree (MDST) in undirected networks.  ...  To the best of our knowledge our algorithm is the first self-stabilizing solution for the construction of a minimum-degree spanning tree in undirected graphs.  ...  An appealing research direction would be to design a super-stabilizing algorithm [18] for approximating a MDST.  ... 
doi:10.1016/j.jpdc.2010.08.019 fatcat:tspkrmzflfgfvje4rrxjuflrna

Self-stabilizing minimum-degree spanning tree within one from the optimal degree

Lelia Blin, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis
2009 2009 IEEE International Symposium on Parallel & Distributed Processing  
We propose a self-stabilizing algorithm for constructing a Minimum-Degree Spanning Tree (MDST) in undirected networks.  ...  To the best of our knowledge our algorithm is the first self-stabilizing solution for the construction of a minimum-degree spanning tree in undirected graphs.  ...  An appealing research direction would be to design a super-stabilizing algorithm [18] for approximating a MDST.  ... 
doi:10.1109/ipdps.2009.5161042 dblp:conf/ipps/BlinPR09 fatcat:rkazjvg5nbb65pcogmn3jp4zwi

SNAP-STABILIZING PREFIX TREE FOR PEER-TO-PEER SYSTEMS

EDDY CARON, FRÉDÉRIC DESPREZ, FRANCK PETIT, CÉDRIC TEDESCHI
2010 Parallel Processing Letters  
Self-stabilization is an efficient approach in the design of reliable solutions for dynamic systems. A snap-stabilizing algorithm guarantees that it always behaves according to its specification.  ...  Resource Discovery is a crucial issue in the deployment of computational grids over large scale peer-to-peer platforms.  ...  In [18] , a new model for distributed algorithms designed for large scale systems is introducted.  ... 
doi:10.1142/s012962641000003x fatcat:turjairrwzebdita6ma6jddji4

Message efficient global snapshot recording using a self stabilizing spanning tree in a MANET

Parmeet Kaur Jaggi, Awadhesh Kumar Singh
2011 International Journal of Communication Networks and Information Security  
The proposed algorithm imposes a self stabilizing spanning tree upon the network topology to reduce the message overhead in the system due to the algorithm and to deal with the dynamic nature of MANETs  ...  The paper presents an algorithm for recording the global state of a clustered and multi-hop mobile ad hoc network.  ...  Regardless of the initial state, the algorithm always builds a spanning tree in the system in a finite number of moves and hence is self-stabilizing.  ... 
dblp:journals/ijcnis/JaggiS11 fatcat:sdff4fl4hrgqzitfnlkqxfe66q

Derivation of Fault Tolerance Measures of Self-Stabilizing Algorithms by Simulation

Nils Müllner, Abhishek Dhama, Oliver Theel
2008 Annual Simulation Symposium : Proceedings  
of the influence of schedulers on a meta level and the possibility to simulate large scale systems featuring dynamic fault probabilities.  ...  We describe a simulation framework to derive fault tolerance measures for self-stabilizing algorithms which can deal with the complete class of self-stabilizing algorithms.  ...  The DFS spanning tree algorithm (see Figures 6 and 7) builds the rooted DFS tree of a graph in self-stabilizing manner.  ... 
doi:10.1109/anss-41.2008.26 dblp:conf/anss/MullnerDT08 fatcat:wheyyy3z4jewlonsfuebr6byly

The First Fully Polynomial Stabilizing Algorithm for BFS Tree Construction

Alain Cournier, Stéphane Rovedakis, Vincent Villain
2019 Information and Computation  
Moreover, as far as we know, it is also the first fully polynomial stabilizing algorithm for spanning tree construction. Its round complexity is in Θ(d 2 ) and its step complexity is in O(n 6 ).  ...  The construction of a spanning tree is a fundamental task in distributed systems which allows to resolve other tasks (i.e., routing, mutual exclusion, network reset).  ...  This model was largely used for the design of self-stabilizing algorithms.  ... 
doi:10.1016/j.ic.2019.01.005 fatcat:erlby2otfffgpdo5af7rofta3q

Self-stabilizing sensor networks for emergency management

Stefan Lohs, Reinhardt Karnapke, Jorg Nolte, Andreas Lagemann
2012 2012 IEEE International Conference on Pervasive Computing and Communications Workshops  
A large scale emergency scenario represents one of these hard situations. One of the most fundamental problems in large scale emergencies is the coordination of rescue workers.  ...  The large number of sensor nodes makes configuring them before deployment impossible, resulting in the need for self configuration.  ...  ACKNOWLEDGMENT This work was supported by the Brandenburg Ministry of Science, Research and Culture (MWFK) as part of the International Graduate School at Brandenburg University of Technology (BTU).  ... 
doi:10.1109/percomw.2012.6197607 dblp:conf/percom/LohsKNL12 fatcat:hdcyjgf5lzgkxcjzj3qoev3bqm

Self-Stabilizing Small k-Dominating Sets

Stephane Devismes, Karel Heurtefeux, Yvan Rivierre, Ajoy K. Datta, Lawrence L. Larmore
2011 2011 Second International Conference on Networking and Computing  
In this paper, we give a distributed asynchronous silent self-stabilizing algorithm for finding a minimal k-dominating set of at most n k+1 processes in an arbitrary identified network of size n.  ...  A self-stabilizing algorithm, after transient faults hit the system and place it in some arbitrary global state, causes the system to recover in finite time without external (e.g., human) intervention.  ...  Acknowledgments We are grateful to the anonymous reviewers for constructive feedback and insightful suggestions which greatly improved this article.  ... 
doi:10.1109/icnc.2011.15 dblp:conf/ic-nc/DevismesHRDL11 fatcat:smbuulljebaehcdrmw3fkilo2u

Self-Stabilizing Small k-Dominating Sets

Ajoy K. Datta, Lawrence L. Larmore, Stéphane Devismes, Karel Heurtefeux, Yvan Rivierre
2013 International Journal of Networking and Computing  
In this paper, we give a distributed asynchronous silent self-stabilizing algorithm for finding a minimal k-dominating set of at most n k+1 processes in an arbitrary identified network of size n.  ...  A self-stabilizing algorithm, after transient faults hit the system and place it in some arbitrary global state, causes the system to recover in finite time without external (e.g., human) intervention.  ...  Acknowledgments We are grateful to the anonymous reviewers for constructive feedback and insightful suggestions which greatly improved this article.  ... 
doi:10.15803/ijnc.3.1_116 fatcat:64owzmdenvhkjpk26mlzk6khpy

Fast Self-Stabilizing Minimum Spanning Tree Construction Using Compact Nearest Common Ancestor Labeling Scheme [article]

Lélia Blin, Shlomi Dolev, Maria Gradinariu Potop-Butucaru
2013 arXiv   pre-print
We present a novel self-stabilizing algorithm for minimum spanning tree (MST) construction. The space complexity of our solution is O(^2n) bits and it converges in O(n^2) rounds.  ...  Thus, this algorithm improves the convergence time of previously known self-stabilizing asynchronous MST algorithms by a multiplicative factor Θ(n), to the price of increasing the best known space complexity  ...  The emergence of large scale and dynamic systems revives the study of scalable algorithms.  ... 
arXiv:1311.0798v1 fatcat:kxf6m5tys5gfzaky6gzh44xfju

Maximum-Leaf Spanning Trees for Efficient Multi-Robot Recovery with Connectivity Guarantees [chapter]

Golnaz Habibi, James McLurkin
2014 Springer Tracts in Advanced Robotics  
This paper presents a self-stabilizing distributed algorithm for the recovery of a large population of robots in a complex environment-that is, to gather them all in a goal location.  ...  Our approach constructs a spanning tree for physical routing, but only allows the leaves of this tree to navigate the goal location.  ...  The authors would like to thank Artie Shen for his great efforts in simulating the brute force algorithm to compute the competitive ratio. They would also like to thank Dr.  ... 
doi:10.1007/978-3-642-55146-8_20 fatcat:skv3xt74qneq3dt2e3uj773pfq

Scalable fault tolerance [chapter]

Shay Kutten
1996 Lecture Notes in Computer Science  
Rather, for a fault handling mechanism to scale to large networks, it should involve local measures, or, at worse, fault local measures, i.e. measures the cost of which depends only on the number of failed  ...  This decreases the recovery time and, moreover, often allows the non-faulty regions of the networks to continue their operation even during the recovery of the faulty parts.  ...  Acknowledgments I would like to thank my coathors, as well as authors of other papers mentioned here, for their help, and for parts of the papers I quoted and summed up here.  ... 
doi:10.1007/bfb0037411 fatcat:2pl3cbflkjbwlj5ndh4krouauq
« Previous Showing results 1 — 15 out of 21,511 results