Time-efficient self-stabilizing algorithms through hierarchical structures

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

Volumn 2704, Issue , 2003, Pages 154-168

  Gärtner, Felix C ^a   Pagnia, Henning ^b  

^a EPFL   (Switzerland)

^b Berufsakademie Mannheim   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

STABILIZATION; TREES (MATHEMATICS);

FAULT CONTAINMENT; HIERARCHICAL STRUCTURES; SELF-STABILIZING ALGORITHM; SPANNING TREE ALGORITHMS; STABILIZATION TIME; TIME-EFFICIENT;

ALGORITHMS;

EID: 35248818730     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45032-7_12     Document Type: Article

References (14)

1. Y. Afek, S. Kutten, and M. Yung. Memory-efficient self stabilizing protocols for general networks. In J. van Leeuwen and N. Santoro, editors, Distributed Algorithms, 4th International Workshop, volume 486 of LNCS, pages 15-28, Bari, Italy, 24-26 Sept. 1990. Springer, 1991.
2. J. E. Burns, M. G. Gouda, and R. E. Miller. Stabilization and pseudo-stabilization. Distributed Computing, 7:35-42, 1993.
3. Cisco Systems Inc. Using VlanDirector system documentation. Internet: http://www.cisco.com/univercd/cc/td/doc/product/rtrmgmt/sw_ntman/ cwsimain/cwsi2/cvsiug2/vlan2/index.htm, 1998.
4. E. W. Dijkstra. Self stabilizing systems in spite of distributed control. Comm. of the ACM, 17(11):643-644, 1974.
5. S. Dolev. Self-Stabilization. MIT Press, 2000.
6. S. Dolev, A. Israeli, and S. Moran. Self-stabilization of dynamic systems assuming only read/write atomicity. In C. Dwork, editor, Proceedings of the 9th Annual ACM Symp. on Principles of Distribted Computing, pages 103-118, Québec City, Québec, Canada, Aug. 1990. ACM Press.
7. S. Dolev, A. Israeli, and S. Moran. Self-stabilization of dynamic systems assuming only read/write atomicity. Distributed Computing, 7:3-16, 1993.
8. L. Fiege, M. Mezini, G. Mühl, and A. P. Buchmann. Engineering event-based systems with scopes. In B. Magnusson, editor, Proc. European Conference on Object-Oriented Programming (ECOOP), volume 2374 of LNCS, pages 309-333, Malaga, Spain, June 2002. Springer.
9. C. Génolini and S. Tixeuil. A lower bound on dynamic k-stabilization in asynchronous systems. In Proc. 21st Symposium on Reliable. Distributed Systems (SRDS 2002), IEEE Computer Society Press, pages 211-221, 2002.
10. D. E. Knuth. The Art of Computer Programming, volume III (Sorting and Searching). Addison-Wesley, Reading, MA, second edition, 1997.
11. M. Maekawa. A √N algorithm for mutual exclusion in decentralized systems. ACM Irans, on Computer Systems, 3(2):145-159, 1985.
12. J. Moy. OSPF version 2. Internet: RFC 1583, Mar. 1994.
13. H. Pagnia and O. Theel. Sacrificing true distribution for gaining access efficiency of replicated objects. In Proc. 31st IEEE Hawaii Intl. Conference on System Sciences (HICSS-31), Big Island, HI, USA, 1998.
14. Y. Rekhter. A border gateway protocol 4 (BGP-4). Internet: RFC 1771, Mar. 1995.