Regular ArticleFault-Local Distributed Mending
References (33)
- et al.
Applying static network protocols to dynamic networks
Proceedings 28th IEEE Symposium on Foundations of Computer Science
(October 1987) - B. Awerbuch, I. Cidon, S. Kutten, Optimal maintenance of replicated informations, in, Proceedings 31st IEEE Symposium...
- et al.
Optimal broadcasting with partial knowledge
SIAM J Comput.
(1998) - B. Awerbuch, B. Patt-Shamir, G. Varghese, Self-stabilization by local checking and correction, in, Proceedings of the...
- Y. Afek, S. Kutten, M. Yung, Memory-efficient self-stabilizing protocols for general networks, in, Proceedings of the...
- B. Awerbuch, S. Kutten, Y. Mansour, B. Patt-Shamir, G. Varghese, Time-optimal self-stabilizing synchronization, in,...
Internetworking with TCP/IP
(1991)- et al.
Designing broadcasting algorithms in the postal model for message-passing systems
Math. Systems Theory
(1994) - J-C. Bermond, D. Peleg, The power of small coalitions in graphs, in, Proceedings of the 2nd Colloquium on Structural...
- J-C. Bermond, J. Bond, D. Peleg, S. Perennes, Tight bounds on the size of 2-monopolies, in, Proceedings of the 3rd...
Distributed control for fast networks
IEEE Trans. Commun.
New models and algorithms for future networks
IEEE Trans. Inform. Theory
Cited by (36)
Error-sensitive proof-labeling schemes
2022, Journal of Parallel and Distributed ComputingDynamic networks of finite state machines
2020, Theoretical Computer ScienceA computational study of f-reversible processes on graphs
2018, Discrete Applied MathematicsAn analysis of fault detection strategies in wireless sensor networks
2017, Journal of Network and Computer ApplicationsCitation Excerpt :In a majority of cases, the faults are local to specific component of WSN. Faults are extremely local in the network and only affect a few components of the network (Kutten and Peleg, 1999). Generally, the entire WSN is not faulty.
Irreversible conversion processes with deadlines
2014, Journal of Discrete AlgorithmsCitation Excerpt :The spreading of something like a property or a commodity within a network is a recurrent feature in many contexts such as social influence [8,12,16,20], gene expression networks [15], immune systems [1], cellular automata [2], percolation [4], marketing strategies [7,16], and distributed computing [5,10,17–19].
Reversible iterative graph processes
2012, Theoretical Computer Science
- *
Alexander Goldberg lecturer.
- †
Supported in part by a Walter and Elise Haas Career Development Award and by a grant from the Israel Science Foundation. Part of the work was done while visiting the IBM T. J. Watson Research Center.