A fast distributed network restoration algorithm

Proceedings of Phoenix Conference on Computers and Communications, PCCC 1993

Volumn , Issue , 1993, Pages 261-267

  Chow, C Edward ^a   Bicknell, John ^a   Mccaughey, Steve ^a   Syed, Sami ^b  

^a UNIVERSITY OF COLORADO   (United States)

^b MCI   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONVENTIONAL APPROACH; DIGITAL CROSS CONNECT SYSTEMS; DISTRIBUTED NETWORKS; FIBER NETWORKS; FIBER SPANS;

RESTORATION;

EID: 85051104221     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PCCC.1993.344455     Document Type: Conference Paper

References (29)

1. [ABG91] B. Awerbuch, A. Bar-Noy, and M. Gopal, "Approximate distributed bellman-ford algorithms, " in Proceedings of IEEE INFOCOM, pp. 1206-1213, Apnl 1991.
2. [BAKE91] J. E. Baker, "Distributed Link Restoration With Robust Preplanning, " in Proceedings of GiobalCom'91, pp. 306-311, Dec. 1991.
3. [BGGJP85] A. E. Baratz, J. P. Gray, P. E. Green Jr., I. M. Jaffe, and D. P. Pozefsky, "SNA networks of small systems, " IEEE Journal on Selected Areas in Communications, Vol. SAC-3, No. 3, pp. 416-426, May 1985.
4. [BOVE86] J. Bovet, "Une amelioration de la methode de Dijk-stra pour la recherche d'un plus court dans un rdseau, " Discrete Applied Math., vol. 13, pp. 93-96, 1986.
5. [CARR71] B. A. Carre, "An Algebra for network routing problem;, " Journallnst. Math. Appl. Vol. 7, pp. 273-294, 1971.
6. [CLR90] T. I t. Gormen, C. E. Leisersori, R. L. Riovest, Introduction to Algorithms, The MIT Press, 1990.
7. [COAN 91] Coati, B, et al, "Using Distributed Topology Update and Preplanned Configurations to Achieve Trunk Network Survivability, " IEEE Trans, on Reliability, Vol. 40, No. 4, October 1991.
8. [DHR90] D. K. Doherty, W. D. Hutcheson, and K. K. Ray-chaudhuri, "High capacity digital network management and control, " in Proceedings of GiobalCom'90, (San Diego), pp. 30131-30135, Dec. 1990.
9. [D1JK59] E. W. Dijkstra, "A note on two problems in connexion wit? graphs, " Numer. Math., vol. pp. 269-271, 1959.
10. [DP84] N. Deo and C.-Y. Pang, "Shortest-path algorithms: Taxonomy and annotation, " Networks, vol. 14, pp. 275-323, 1984.
11. [DP92] R. D. Doverspike and C. D. Pack, "Using SONET for Dynamic Bandwidth Management in Local Exchange Network, " in Proceedings of 5th International Network Plan-ning Symposium, Kobe, Japan, June 1992.
12. [GROV87] W. D. Graver, "The self-healing network: A fast distributed restoration technique for networks using digital cross-connect machines, " in Proceedings of GiobalCom'87, pp. 2821-2826, 1987.
13. [GROV89] W. D. Graver, Selfhealing Network, Ph.D. thesis, University of Alberta, 1989.
14. [GT88] A. V. Goldberg and R. E. Tarjan, "A New Approach to the Maximum-Flow problem, " Journal of the Association for Computing Machinery, vol. 35, No. 4, pp. 921-940, Oct. 1988.
15. [KCOMS90] H. Komine, T. Chujo, T. Ogura, K. Miyazaki, and T. Soejima, "A distributed restoration algorithm for multiple-link and node failures of transport networks, " in Pro-ceedings of GiobalCom'90, (San Diego), pp. 40341-40345, Dec. 1990.
16. [MFR78] J.M. McQuillan, G. Falk and I Richer, "A review of the development and performance of the ARPANET routing algorithm, IEEE Trans, on Communications, Vol. COM-26, No. 12, pp. 1802-1811, December 1978.
17. [MP88] T. Mohr and C. Pasche, "A parallel shortest path algorithm, " Computing, vol. 40, pp. 281-292, 1988.
18. IMRR80] J.M. McQuillan, I. Richer and E.C. Rosen,'The new routing algorithm for the ARPANET, IEEE Trans, on Communications, Vol. COM-28, No. 5, pp. 711-719, May 1980.
19. [NICH66] T. A. Nicholson, "Finding the shortest route between two points in a network, " Computer J., vol. 9, pp. 276-280, 1966.
20. |PH90] C. Palmer and F. Hummel, "Restoration in a partitioned multi-bandwidth cross-connect network, " in Proceedings of GiobalCom'90, (San Diego), pp. 30171-30175, Dec. 1990.
21. [SNH90] H. Sakauchi, Y. Nishimura, and S Hasegawa, "A self-healing network with an economical spare-channel assignment, " in Proceedings of GiobalCom'90, (San Diego), pp. 40311-40316, Dec. 1990.
22. [SS80] M. Schwartz and T. E. Stern, "Routing techniques used in computer communications networks, " IEEE Trans, on Communications, Vol. COM-28, No 4, pp. 539-552, April 1980.
23. [ST84] J. W. Suurballe and R. E. Tarjan, "A quick method for finding shortest pairs of disjoint paths, " Networks, vol. 14, pp. 325-336 1984.
24. ISUUR74] J. W. Suurballe, "Disjoint paths in a network, " Networks, vol.4, pp-125-145, 1974.
25. [TOPK88] D. M. Topkis, "A k shortest path algorithm for adaptive routing in communications networks, " IEEE Trans, on Communications, vol. 36, pp. 855-859, July 1988.
26. IWK90] J. S. Whalen and J. Kenney, "Finding maximal link disjoint paths in a multigraph, " in Proceedings of GiobalCom 90, (Sain Diego), pp. 40361-40365, Dec. 1990.
27. [ WROB90] L. A. Wrobel, Disaster Recovery Planning for Telecommunications, Artech House, 1990.
28. [WU92] T.-H. Wu, Fiber Network Service Survivability, Artech House, 1992.
29. [YH88] Yang, C. H. and S. Hasegawa, "FITNESS: Failure Immunization Technology for Network Service Survivability, " Proc. of GiobalCom'88, pp. 4731-4736, November 1988.