Low communication self-stabilization through randomization

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6343 LNCS, Issue , 2010, Pages 465-479

  Kutten, Shay ^a   Zinenko, Dmitry ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION COST; COMMUNICATION EFFICIENCY; COMMUNICATION OVERHEADS; COMPLETE GRAPHS; DENSE GRAPHS; POTENTIAL EFFECTS; SELF-STABILIZATION; SELF-STABILIZING ALGORITHM; SELF-STABILIZING PROTOCOL; SPANNING TREE CONSTRUCTION;

FAULT DETECTION; FAULT TOLERANT COMPUTER SYSTEMS; STABILIZATION;

COMMUNICATION;

EID: 78649840880     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15763-9_45     Document Type: Conference Paper

References (31)

1. Afek, Y., Gafni, E.: Time andmessage bounds for election in synchronous and asynchronous complete networks. In: PODC'85, pp. 186-195. ACM, New York (1985)
2. Afek, Y., Kutten, S., Yung, M.: Memory-efficient self-stabilization on general networks. In: Toueg, S., Kirousis, L.M., Spirakis, P.G. (eds.) WDAG 1991. LNCS, vol. 579, pp. 15-28. Springer, Heidelberg (1992)
3. Afek, Y., Matias, Y.: Elections in anonymous networks. Information and Computation Journal 113(2), 312-330 (1994)
4. Aggarwal, S., Kutten, S.: Time optimal self-stabilizing spanning tree algorithm. In: Shyamasundar, R.K. (ed.) FSTTCS 1993. LNCS, vol. 761, pp. 400-410. Springer, Heidelberg (1993)
5. Arora, A., Gouda, M.: Distributed reset. IEEE Transactions on Computing 43(9), 1026-1038 (1994)
6. Arora, A., Dolev, S., Gouda, M.G.: Maintaining digital clocks in step. In: Toueg, S., Kirousis, L.M., Spirakis, P.G. (eds.) WDAG 1991. LNCS, vol. 579, pp. 71-79. Springer, Heidelberg (1992)
7. Awerbuch, B., Kutten, S., Mansour, Y., Patt-Shamir, B., Varghese, G.: Time optimal self-stabilizing synchronization. In: STOC'93, pp. 652-661 (1993)
8. Awerbuch, B., Patt-Shamir, B., Varghese, G., Dolev, S.: Self-stabilization by local checking and global reset. In: Tel, G., Vitányi, P.M.B. (eds.) WDAG 1994. LNCS, vol. 857, pp. 326-339. Springer, Heidelberg (1994)
9. Blin, L., Potop-Butucaru, M., Rovedakis, S., Tixeuil, S.: A new self-stabilizing minimum spanning tree construction with loop-free property. In: Keidar, I. (ed.) DISC 2009. LNCS, vol. 5805, pp. 407-422. Springer, Heidelberg (2009)
10. Boulinier, C., Petit, F., Villain, V.: When graph theory helps self-stabilization. In: PODC'04, pp. 150-159 (2004)
11. Burman, J., Kutten, S.: Time optimal asynchronous self-stabilizing spanning tree. In: Pelc, A. (ed.) DISC 2007. LNCS, vol. 4731, pp. 92-107. Springer, Heidelberg (2007)
12. Chou, C.-T., Cidon, I., Gopal, I.S., Zaks, S.: Synchronizing asynchronous bounded delay networks. In: van Leeuwen, J. (ed.) WDAG 1987. LNCS, vol. 312, pp. 212-218. Springer, Heidelberg (1988)
13. Delporte-Gallet, C., Devismes, S., Fauconnier, H.: Robust stabilizing leader election. In: Masuzawa, T., Tixeuil, S. (eds.) SSS 2007. LNCS, vol. 4838, pp. 219-233. Springer, Heidelberg (2007)
14. Devismes, S., Masuzawa, T., Tixeuil, S.: Communication efficiency in selfstabilizing silent protocols. In: ICDCS'09, pp. 474-481. IEEE, Los Alamitos (2009)
15. Devroye, L.: Branching processes and their applications in the analysis of tree structures and tree algorithms. In: Probabilistic Methods for Algorithmic Discrete Mathematics, vol. 16, pp. 249-314. Springer, Heidelberg (1998)
16. Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Commununications of the ACM 17(11), 643-644 (1974)
17. Dolev, S., Israeli, A., Moran, S.: Self-stabilization of dynamic systems assuming only read/write atomicity. In: PODC'90, pp. 103-117 (1990)
18. Dolev, S., Israeli, A., Moran, S.: Uniform dynamic self-stabilizing leader election. IEEE Transactions on Parallel and Distributed Systems 8(4), 424-440 (1997)
19. Feige, U., Peleg, D., Raghavan, P., Upfal, E.: Randomized broadcast in networks. In: Asano, T., Imai, H., Ibaraki, T., Nishizeki, T. (eds.) SIGAL 1990. LNCS, vol. 450, pp. 128-137. Springer, Heidelberg (1990)
20. Gärtner, F.C.: A survey of self-stabilizing spanning-tree construction algorithms. Technical report, Ecole Polytechnique Fèdèrale de Lausanne (2003)
21. Gouda, M.G., Herman, T.: Stabilizing unison. Information Processing Letters 35(4), 171-175 (1990)
22. Hérault, T., Lemarinier, P., Peres, O., Pilard, L., Beauquier, J.: A model for large scale self-stabilization. In: IPDPS'07, pp. 1-10 (2007)
23. Karp, R., Schindelhauer, C., Shenker, S., Vocking, B.: Randomized rumor spreading. In: FOCS'00, p. 565. IEEE Computer Society, Los Alamitos (2000)
24. Katz, S., Perry, K.J.: Self-stabilizing extensions for message-passing systems. Distributed Computing 7(1), 17-26 (1993)
25. Koldehofe, B.: Simple gossiping with balls and bins. Studia Informatica Universalis 3(1), 43-60 (2004)
26. Masuzawa, T., Izumi, T., Katayama, Y., Wada, K.: Brief announcement: Communication-efficient self-stabilizing protocols for spanning-tree construction. In: Abdelzaher, T., Raynal, M., Santoro, N. (eds.) OPODIS 2009. LNCS, vol. 5923, pp. 219-224. Springer, Heidelberg (2009)
27. Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, Cambridge (2005)
28. Pittel, B.: On spreading a rumor. SIAM Journal of Applied Mathematics 47(1), 213-223 (1987)
29. Segall, A.: Distributed network protocols. IEEE Transactions on Information Theory IT-29, 23-35 (1983)
30. Varghese, G., Jayaram, M.: The fault span of crash failures. Journal of the ACM 47, 47-52 (1997)
31. Vogels, W., van Renesse, R., Birman, K.: The power of epidemics: robust communication for large-scale distributed systems. SIGCOMM Comput. Commun. Rev. 33(1), 131-135 (2003)