Empire of colonies: Self-stabilizing and self-organizing distributed algorithm

Theoretical Computer Science

Volumn 410, Issue 6-7, 2009, Pages 514-532

  Dolev, Shlomi ^a   Tzachar, Nir ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

Clustering; Communication and routing; Self organizing; Self stabilizing

Indexed keywords

ALGORITHMS; COMMUNICATION; CONVERGENCE OF NUMERICAL METHODS; MESSAGE PASSING; PARALLEL ALGORITHMS; SENSOR NETWORKS; TOPOLOGY; TREES (MATHEMATICS);

CLUSTERING; COMMUNICATION AND ROUTING; COMMUNICATION GRAPHS; CONVERGENCE TIME; DYNAMIC CHANGES; LEADER ELECTION; OVERLAY NETWORKS; SELF-ORGANIZATION (SO); SELF-ORGANIZING; SELF-STABILIZATION; SELF-STABILIZING; SUBLINEAR TIME; UPPER BOUNDS;

CLUSTERING ALGORITHMS;

EID: 58549100289     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2008.10.006     Document Type: Article

References (28)

1. Afek Y., and Dolev S. Local stabilizer. Self-stabilizing Distributed Systems. Journal of Parallel and Distributed Computing 62 5 (2002) 745-765 (special issue). Also in Proc. of the 5th Israeli Symposium on Theory of Computing and Systems, ISTCS 1997, 1997, pp. 74-84
2. E. Anceaume, X. Defago, M. Gradinariu, M. Roy, Towards a theory of self-organization, in: 9th International Conference on Principels of Distributed Systems, OPODIS, 2005, pp. 146-156
3. J. Burman, S. Kutten, T. Herman, B. Patt-Shamir, Asynchronous and fully self-stabilizing time-adaptive majority consensus, in: 9th International Conference on Principels of Distributed Systems, OPODIS, 2005
4. Chandy M., and Lamport L. Distributed snapshots: determining global states of distributed systems. ACM Transactions on Computing Systems 3 1 (1985) 63-75
5. Tanenbaum A. Computer Networking. 4th ed. (2002), Prentice Hall
6. A. Cournier, A. Datta, F. Petit, V Villain, Enabling snap-stabilization, in: Proc. of the 23rd International Conference on Distributed Computing Systems, 2003, pp. 12-19
7. A. Costello, G. Varghese, Self-stabilization by window washing, in: Proc. of the 15th Annual ACM Symposium on Principles of Distributed Computing, 1996, pp. 35-44
8. Dijkstra E.W. Self-stabilizing systems in spite of distributed control. Communications of the ACM 17 11 (1974) 643-644
9. Dolev S. Self-Stabilization (2000), MIT Press
10. Dolev S., and Herman T. Superstabilizing protocols for dynamic distributed systems. Proc. of the 2nd Workshop on Self-Stabilizing Systems, May 1995. Chicago Journal of Theoretical Computer Science 3 4 (1997) special issue on Self-stabilization
11. S. Dolev, A. Israeli, S. Moran, Resource bounds for self-stabilizing message driven protocols, in: Symposium on Principles of Distributed Computing, 1991, pp. 281-293
12. Dolev S., Kranakis E., Krizanc D., and Peleg D. Bubbles: Adaptive routing scheme for high-speed dynamic networks. SIAM Journal on Computing 29 3 (1999) 804-833 Also in Proc. of the 27th ACM Symposium on Theory of Computing, STOC 1995, 1995, pp. 528-537
13. Felix C. Gärtner, Henning Pagnia, Time-efficient self-stabilizing algorithms through hierarchical structures, in: Proc. to the Sixth Symposium on Self-Stabilizing Systems, 2003, pp. 154-168
14. S. Ghosh, A. Gupta, T. Herman, S. Pemmaraju, Fault-containing self-stabilizing algorithms, in: PODC, 1996, pp. 45-54
15. A. Goldberg, S. Plotkin, G. Shannon, Parallel symmetry- breaking in sparse graphs, in: Proceedings of the Nineteenth Annual ACM Conference on theory of Computing, STOC, 1987, pp. 315-324
16. Henzinger M., and King V. Randomized fully dynamic graph algorithms with polylogrithmic time per operation. Journal of the ACM 46 4 (1999) 502-516
17. S. Katz, K. Perry, Self-stabilizing extensions for message-passing systems, in: Proceedings of the Ninth Annual ACM Symposium on Principles of Distributed Computing, 1990, pp. 91-101
18. P. Kirschenhofer, H. Prodinger, A result in order statistics related to probabilistic counting, in: Computing, vol. 46 pp. 15-27
19. S. Kutten, D. Peleg, Tight fault locality, in: Annual Symposium on Foundations of Computer Science, FOCS, 1995
20. F. Kuhn, T. Moscibroda, T. Nieberg, R. Wattenhofer, Fast deterministic distributed maximal independent set computation on growth-bounded graphs, in: Distributed Computing: 19th International Conference, DISC 2005, pp. 273-283
21. F. Kuhn, T. Moscibroda, R. Wattenhofer, What cannot be computed locally!, in: Proceedings of the 23rd ACM Symposium on Principles of Distributed Computing, PODC, 2004, pp. 300-309
22. Lamport L. Time, clocks, and the ordering of events in a distributed system. Communications of the ACM 12 7 (1978) 558-565
23. N. Linial, E. London, Y. Rabinovich, The geometry of graphs and some of its algorithmic applications, in: Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, October 1994, pp. 577-591
24. Luby M. A simple parallel algorithm for the maximal independent set proble. SIAM journal of Computing 15 4 (1986) 1036-1053
25. T. Moscibroda, R. Wattenhofer, Efficient computation of maximal independent sets in unstructured multi-hop radio networks, in: The 1st IEEE International Conference on Mobile Ad-hoc and Sensor Systems, Fort Lauderdale, Florida, 2004
26. Plaxton C.G., Rajaraman R., and Richa A.W. Accessing nearby copies of replicated objects in a distributed environment. Proceedings of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures (1997), ACM Press, New York, NY 311-320
27. Varghese G. Self-stabilization by counter flushing. SIAM Journal on Computing 30 2 (2000) 486-510 Also in: Symposium on Principles of Distributed Computing, 1994, pp. 244-253
28. 3: Scalable self-configuration and self-healing in wireless networks, in: Symposium on Principles of Distributed Computing, 2002, pp. 58-67