Filters








17,821 Hits in 4.8 sec

Resource Bounds for Self-Stabilizing Message-Driven Protocols

Shlomi Dolev, Amos Israeli, Shlomo Moran
1997 SIAM journal on computing (Print)  
Self-stabilizing message driven protocols are defined and discussed.  ...  Then we present three self-stabilizing message driven protocols for token-passing. The rate of growth of configuration size for all three protocols matches the aforementioned lower bound.  ...  We thank Alan Fekete for helpful remarks.  ... 
doi:10.1137/s0097539792235074 fatcat:6ypcyzxavvat3jvv332hl7cv7y

Resource bounds for self stabilizing message driven protocols

Shlomi Dolev, Amos Israeli, Shlomo Moran
1991 Proceedings of the tenth annual ACM symposium on Principles of distributed computing - PODC '91  
Self-stabilizing message driven protocols are defined and discussed.  ...  Then we present three self-stabilizing message driven protocols for token-passing. The rate of growth of configuration size for all three protocols matches the aforementioned lower bound.  ...  We thank Alan Fekete for helpful remarks.  ... 
doi:10.1145/112600.112624 dblp:conf/podc/DolevIM91 fatcat:6aemtyqkz5hepjvss3uosxn6ny

Brief Announcement: Self-stabilizing Synchronization of Arbitrary Digraphs in Presence of Faults [chapter]

Mahyar R. Malekpour
2012 Lecture Notes in Computer Science  
The protocol deterministically converges within a time bound that is a linear function of the self-stabilization period.  ...  Introduction This brief announcement presents a fault-tolerant self-stabilizing distributed clock synchronization protocol for an arbitrary, non-partitioned digraph.  ... 
doi:10.1007/978-3-642-33536-5_4 fatcat:54fw2kpwvjhiflmjegje5mj3sy

A self-stabilizing hybrid fault-tolerant synchronization protocol

Mahyar R. Malekpour
2015 2015 IEEE Aerospace Conference  
The model checking effort is focused on verifying correctness of the bounded model of the protocol as well as confirming claims of determinism and linear convergence with respect to the self-stabilization  ...  This paper presents a strategy for solving the Byzantine general problem for self-stabilizing a fully connected network from an arbitrary state and in the presence of any number of faults with various  ...  The Self-Stabilizing, Symmetric-Fault Tolerant Synchronization Protocol In this section, we present the self-stabilizing, symmetricfault tolerant synchronization protocol that is based on message symmetry  ... 
doi:10.1109/aero.2015.7119170 fatcat:uocywizesjgizglb7tcaudxep4

Model checking a self-stabilizing synchronization protocol for arbitrary digraphs

M. R. Malekpour
2012 2012 IEEE/AIAA 31st Digital Avionics Systems Conference (DASC)  
This protocol deterministically converges within a time bound that is a linear function of the self-stabilization period.  ...  This report presents the mechanical verification of a self-stabilizing distributed clock synchronization protocol for arbitrary digraphs in the absence of faults.  ...  Figure 2 . 2 The self-stabilizing clock synchronization protocol for arbitrary digraphs.  ... 
doi:10.1109/dasc.2012.6382444 fatcat:ozvofv4wdffgvblhvdishiyey4

A Self-Stabilizing Synchronization Protocol for Arbitrary Digraphs: A Self-Stabilizing Distributed Clock Synchronization Protocol For Arbitrary Digraphs

Mahyar R. Malekpour
2011 2011 IEEE 17th Pacific Rim International Symposium on Dependable Computing  
This protocol deterministically converges within a time bound that is a linear function of the self-stabilization period.  ...  This paper presents a self-stabilizing distributed clock synchronization protocol in the absence of faults in the system.  ...  Figure 4 . 4 The self-stabilizing clock synchronization protocol for arbitrary digraphs. IV.  ... 
doi:10.1109/prdc.2011.37 dblp:conf/prdc/Malekpour11 fatcat:xiujrp6mofapxgo2fyfjvaxrsy

Page 6355 of Mathematical Reviews Vol. , Issue 97J [page]

1997 Mathematical Reviews  
bounds for self-stabilizing message-driven protocols.  ...  Summary: “Self-stabilizing message-driven protocols are defined and discussed.  ... 

Stabilizing Reconfiguration in Wireless Sensor Networks [chapter]

Sandip Bapat, Anish Arora
2009 Security in Ad Hoc and Sensor Networks  
Our stabilizing reconfiguration protocol uses local detectors and correctors that can detect version inconsistencies and prevent their propagation in a timely and efficient manner, while ultimately allowing  ...  Due to physical constraints, these version numbers are bounded in size and use wraparound arithmetic to handle rollover.  ...  There does not exist a self-stabilizing reconfiguration protocol with bounded version numbers.  ... 
doi:10.1142/9789814271097_0013 fatcat:7pmkiy66qrhd5ayhbnikh5red4

Crash failures can drive protocols to arbitrary states

Mahesh Jayaram, George Varghese
1996 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing - PODC '96  
A crashing network protocol is an asynchronous propamieeioa endhr fee.  ...  Acknowledgements : We would like to thank Alan Fekete and Pete McCann for their detailed comments and helpful suggestions. We also thank Yishay Mansour for his helpful comments.  ...  We define a token passing protocol for a graph4 The CAML result also shows that self-stabilization is not limited to "recovery from bizarre faults".  ... 
doi:10.1145/248052.248104 dblp:conf/podc/JayaramV96 fatcat:ighlcnudk5cg5bbowhwjna2koe

Revisiting Liveness Properties in the Context of Secure Systems [chapter]

Felix C. Gärtner
2003 Lecture Notes in Computer Science  
Distinguishing trace-based system properties into safety properties on the one hand and liveness properties on the other has proven very useful for specifying and validating concurrent and fault-tolerant  ...  We study the adequacy of these abstractions, especially the liveness property abstraction, in the context of secure systems for two different scenarios: (1) Denial-of-service attacks and (2) brute-force  ...  Thanks also to Heiko Mantel, Michael Waidner, Holger Vogt and Hagen Völzer for helpful discussions.  ... 
doi:10.1007/978-3-540-40981-6_18 fatcat:56axxgphovcbhibqds6nky4rhy

Self-tuning batching in total order broadcast protocols via analytical modelling and reinforcement learning

Paolo Romano, Matteo Leonetti
2012 2012 International Conference on Computing, Networking and Communications (ICNC)  
In this paper we address precisely this issue, by presenting an innovative mechanism for self-tuning the batching level in TOB protocols.  ...  Batching is a well known technique to boost the throughput of Total Order Broadcast (TOB) protocols.  ...  To the best of our knowledge, the work in [9] is the only one to have investigated the issue of designing self-tuning mechanisms for TOB protocols.  ... 
doi:10.1109/iccnc.2012.6167531 dblp:conf/iccnc/RomanoL12 fatcat:km4ojxogibb5zdj6np6qe245lu

Distributed self-stabilizing placement of replicated resources in emerging networks

Bong-Jun Ko, D. Rubenstein
2005 IEEE/ACM Transactions on Networking  
Our combination of theoretical results and simulation prove stabilization of the protocol, and evaluate its performance in the context of convergence time, message transmissions, and color distance.  ...  Our results show that the protocol generates colorings that are close to the optimal under a set of metrics, making such a protocol ideal for emerging networking systems.  ...  Once the protocol stabilizes, the leader reelection problem simplifies to having each node take its turn for being the leader.  ... 
doi:10.1109/tnet.2005.850196 fatcat:p64elbi7ynewlfk4fbatro7p3i

Modeling key agreement in multi-hop ad hoc networks

Giovanni Di Crescenzo, Maria Striki, John S. Baras
2006 Proceeding of the 2006 international conference on Communications and mobile computing - IWCMC '06  
We then go beyond natural extensions of such protocols, by proposing non-trivial extensions based on efficient topology-driven simulations of logical networks over an arbitrary physical network, in order  ...  First, we formally model the key agreement problem over multi-hop ad hop networks, and we directly extend known key agreement protocols for wired networks, and evaluate the efficiency of such approaches  ...  More generally, to deal with mobility issues in AHNets (which we do not target in this paper), one may use self-stabilizing spanning tree generation protocols (see, e.g.  ... 
doi:10.1145/1143549.1143559 dblp:conf/iwcmc/CrescenzoSB06 fatcat:qrokfohyobdi3k4mzhz75gsniu

Stabilizing Inter-domain Routing in the Internet [chapter]

Yu Chen, Ajoy K. Datta, Sébastien Tixeuil
2002 Lecture Notes in Computer Science  
Since network topology maintenance protocol is the underlying protocol for most of the routing protocols, its stability is very important.  ...  An algorithm for self-stabilizing shortest path tree construction is presented in [27] . The self-stabilizing spanning tree construction algorithms appeared in [2, 8] . Contributions.  ...  The inputs MAX and NBR (representing two bounds as described below) need to be known for the counter flushing mechanism [29] to stabilize.  ... 
doi:10.1007/3-540-45706-2_104 fatcat:2twh63aejba23hyarlfmbdpbl4

Self-Stabilizing Periodic Mutual-exclusive Propagation in Sparse Networks [article]

Shaolin Yu, Jihong Zhu, Jiali Yang
2022 arXiv   pre-print
It shows that the MEP systems can be stabilized with arbitrary initial system states within a short bounded time.  ...  For providing easy message propagation primitives, the mutual-exclusive propagation (MEP) of one-bit messages is investigated with a simplified discrete system model.  ...  Also, with the self-stabilization property, higherlayer self-stabilizing protocols can be directly built upon this basic mutual-exclusive propagation (MEP) primitive.  ... 
arXiv:2203.03297v1 fatcat:njoznubnj5ainh66gmao2232oa
« Previous Showing results 1 — 15 out of 17,821 results