Self-stabilizing topology maintenance protocols for high-speed networks

IEEE/ACM Transactions on Networking

Volumn 4, Issue 6, 1996, Pages 902-912

  Abu Amara, Hosame ^b   Coan, Brian A ^c   Dolev, Shlomi ^d   Kanevsky, Arkady ^a,e   Welch, Jennifer L ^f  

^a IEEE

^b University of Nevada Las Vegas   (United States)

^c TELCORDIA TECHNOLOGIES   (United States)

^d BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^e MITRE CORPORATION   (United States)

^f TEXAS A AND M UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BANDWIDTH; CHANNEL CAPACITY; ELECTRIC NETWORK TOPOLOGY; NETWORK PROTOCOLS; SWITCHING SYSTEMS;

SELF STABILIZING TOPOLOGY MAINTENANCE PROTOCOLS;

TELECOMMUNICATION NETWORKS;

EID: 0030414689     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/90.556356     Document Type: Article

References (17)

1. H. Abu-Amara, "A fast topology maintenance algorithm for high-bandwidth networks," IEEE/ACM Trans. Networking, vol. 1, no. 3, pp. 386-394, June 1993.
2. H. Abu-Amara, B. Coan, S. Dolev, A. Kanevsky, and J. Welch, "A fault-tolerant layered approach to fiber-optic networks," in Proc. Conf. High-Speed Networking and Multimedia Computing, IS&T/SPIE Symp. Electron. Imaging Science & Technology, 1994, pp. 380-391.
3. _, "A fault-tolerant layered approach to fiber-optic networks," Dept. Computer Science, Texas A&M Univ., Tech. Rep. 94-050, 1994.
4. B. Awerbuch, I. Cidon, I. Gopal, M. Kaplan, and S. Kutten, "Distributed control for PARIS," in Proc. 9th ACM Symp. Principles Distributed Computing, 1990, pp. 145-159.
5. B. Awerbuch and Y. Mansour, "An efficient topology update protocol for dynamic networks," in Proc. 6th Int. Workshop Distributed Algorithms, 1992, pp. 185-202.
6. I. Cidon and I. Gopal, "PARIS: An approach to private integrated networks," J. Analog Digital Cabled Syst., vol. 1, no. 2, pp. 77-86, Apr.-June 1988.
7. I. Cidon, I. Gopal, and S. Kutten, "New models and algorithms for future networks," in Proc. 7th ACM Symp. Principles Distributed Computing, Toronto, Canada, 1988, pp. 75-89.
8. S. Dolev, "Optimal time self stabilization in dynamic systems," in Proc. 7th Int. Workshop Distributed Algorithms, 1993, pp. 129-144.
9. E. W. Dijkstra, "A note on two problems in connection with graphs," Num. Math., vol. 1, pp. 269-271, 1959.
10. E. W. Dijkstra, "Self-stabilizing systems in spite of distributed control," Commun. ACM, vol. 17, no. 11, pp. 643-644, Nov. 1974.
11. S. Even, Graph Algorithms. Rockville, MD: Computer Science Press, 1979.
12. E. Gafni, "Generalized scheme for topology-update in dynamic networks," in Proc. 2nd Int. Workshop Distributed Algorithms, 1987, pp. 187-196.
13. J. M. McQuillan, I. Richer, and E. C. Rosen, "The new routing algorithm for the ARPANET," IEEE Trans. Commun., COM-28, no. 5, pp. 711-719, May 1980.
14. L. Lamport, "A fast mutual exclusion algorithm," ACM Trans. Computer Syst., vol. 5, no. 1, pp. 1-11, 1987.
15. Y. Ofek and M. Yung, "Principles for high-speed network control: Lossless and deadlock-freeness, self-routing and a single buffer per link," in Proc. 9th ACM Symp. Principles Distributed Computing, 1990, pp. 161-175.
16. J. M. Spinelli and R. G. Gallager, "Event driven topology broadcast without sequence numbers," IEEE Trans. Commun., vol. 37, no. 5, pp. 468-474, May 1989.
17. W. D. Tajibnapis, "A correctness proof of a topology information maintenance protocol for a distributed computer network," Commun. ACM, vol. 20, no. 7, pp. 477-485, July 1977.