Maintenance of a spanning tree in dynamic networks

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

Volumn 1693, Issue , 1999, Pages 342-355

  Kutten, Shay ^a,b   Porat, Avner ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DISTRIBUTED COMPUTER SYSTEMS; EFFICIENCY; POLYNOMIALS; TREES (MATHEMATICS);

ASYNCHRONOUS NETWORKS; COMMUNICATION COMPLEXITY; CONNECTED COMPONENT; DATABASE MAINTENANCE; POLYLOGARITHMIC; TOPOLOGY CHANGES; TREE CONSTRUCTION; VIRTUAL COMPONENTS;

COMPLEX NETWORKS;

EID: 33750326685     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48169-9_24     Document Type: Conference Paper

References (16)

1. Yehuda Afek, Baruch Awerbuch and Eli Gafni. Applying static network protocols to dynamic networks. In Proc. 28th IEEE Symp. on Foundations of Computer Science, October 1987.
2. Baruch Awerbuch, Israel Cidon, Inder Gopal, Marc Kaplan, and Shay Kutten. DIStributed control for PARIS. In Proc. 9th ACMSymp. on Principles of Distributed Computing, 1990.
3. Baruch Awerbuch, Israel Cidon, and Shay Kutten. Optimal maintenance of replicated Information. Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science (FOCS 90), St. Louis, MO, USA, pp.492–502, October 1990.
4. Baruch Awerbuch and Leonard J.Schulman. The maintenance of common data in distributed system. In Proc. 32nd IEEE Symp. On Foundations of Computer Science, October 1991.
5. Baruch Awerbuch. On the effects of feedback in dynamic network protocols. In Proc. 29th IEEE Symp. on Foundations of Computer Science, pages 231-245, October 1988.
6. A.E. Baratz, J.P. Gray, P.E. Green Jr., J.M. Jaffe, and D.P. Pozefski. Sna networks of small systems. IEEE journal on Selected Areas in Communications, SAC-3(3):416-426, May 1985.
7. Israel Cidon, Inder Gopal, Mark Kaplan, and Shay Kutten. Distributed Control for Fast Networks. IEEE Transactions on Communications,Vol. 43, No. 5, pp. 1950–1960, May 1995.
8. Edsger W. Dijkstra and C.S. Scholten. Termination detection for diffusing computations. Info. Process. Letters, 11(1):1-4, August 1980.
9. R. Gallager, P. Humblet, and P. Spira. A distributed algorithm for minimum weight spanning trees. ACM Transaction on programming language and Systems, 4(1):66-77, January 1983.
10. Lamport, L. Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21 (1978), 558-564.
11. John McQuillan, Ira Richer, and Eric Rosen. The new routing algorithm for the ARPANET. IEEE Trans. on Commun., 28(5):711-719, May 1980.
12. J. Moy. OSPF Version2 RFC1247, October 1991.
13. A. Segall. Distributed network protocols. IEEE Transaction on Information Theory, IT-29(1):23-35, January 1983.
14. John M. Spinelli and Robert G. Gallager. Broadcasting topology information in computer networks. IEEE Trans. on Commun., May 1989.
15. Gerard Tel. Introduction to Distributed Algorithms. Cambridge University Press, 1994.
16. U. Vishkin. A distributed orientation algorithm. IEEE Trans. on Info. Theory, June 1983.