Optimal capacity and flow assignment for self-healing ATM networks based on line and end-to-end restoration

IEEE/ACM Transactions on Networking

Volumn 6, Issue 2, 1998, Pages 207-221

  Murakami, Kazutaka ^a,b   Kim, Hyong S ^a,c  

^a IEEE   (United States)

^b LUCENT TECHNOLOGIES   (United States)

^c CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Jointly optimal capacity and flow control; Self healing networks; Survivable network design

Indexed keywords

CHANNEL CAPACITY; COMPUTATIONAL METHODS; CONGESTION CONTROL (COMMUNICATION); CONSTRAINT THEORY; COST EFFECTIVENESS; DATA COMMUNICATION SYSTEMS; ELECTRIC NETWORK TOPOLOGY; LINEAR PROGRAMMING; MATRIX ALGEBRA; TELECOMMUNICATION LINKS; TELECOMMUNICATION TRAFFIC;

END TO END RESTORATION METHODS; SELF HEALING NETWORKS; SURVIVABLE NETWORK DESIGN;

ASYNCHRONOUS TRANSFER MODE;

EID: 0032046121     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/90.664269     Document Type: Article

References (27)

1. Special issue on "Integrity of public telecommunication networks," IEEE J. Select. Areas Commun., vol. 12, Jan. 1994.
2. J. Anderson, B. T. Doshi, S. Dravida, and P. Harshavardhana, "Fast restoration of ATM networks," IEEE J. Select. Areas Commun., vol. 12, pp. 128-138, Jan. 1994.
3. A. A. Assad, "Multicommodity network flows - A survey," Networks, vol. 8, pp. 31-91, 1978.
4. J. E. Baker, "A distributed link restoration algorithm with robust preplanning," in Proc. IEEE GLOBECOM'91, Phoenix, AZ, Dec. 1991, pp. 306-311.
5. R. H. Bartels and G. H. Golub, "The simplex method of linear programming using LU decomposition," Commun. ACM, vol. 12, no. 5, pp. 266-268, May 1969.
6. V. Chvatal, Linear Programming. New York: Freeman, 1983.
7. R. Doverspike, "A multi-layered model for survivability in intra-LATA transport networks," in Proc. IEEE GLOBECOM'91, Phoenix, AZ, Dec. 1991, pp. 2025-2031.
8. L. Fratta, M. Gerla, and L. Kleinrock, "The flow deviation method: An approach to store-and-forward communication network design," Networks, vol. 3, pp. 97-133, 1973.
9. B. Gavish and I. Neuman, "A system for routing and capacity assignment in computer communication networks," IEEE Trans. Commun., vol. 37, pp. 360-366, Apr. 1989.
10. A. Gersht and S. Kheradpir, "Real-time bandwidth allocation and path restorations in SONET-based self-healing mesh networks," in Proc. IEEE ICC'93, Geneva, Switzerland, May 1993, pp. 250-255.
11. W. D. Grover, "The selfhealing network: A fast distributed restoration technique for networks using digital cross-connect machines," in Proc. IEEE GLOBECOM'87, Tokyo, Japan, Nov. 1987, pp. 1090-1095.
12. W. D. Grover, T. D. Bilodeau, and B. D. Venables, "Near optimal spare capacity planning in a mesh restorable network," in Proc. IEEE GLOBECOM'91, Phoenix, AZ, Dec. 1991, pp. 2007-2012.
13. C. G. Kang and H. H. Tan, "Fault-tolerant capacity and flow assignment in packet switched networks," in Proc. IEEE MILCOM'92, San Diego, CA, 1992, pp. 165-171.
14. R. Kawamura, K. Sato, and I. Tokizawa, "Self-healing ATM networks based on virtual path concept," IEEE J. Select. Areas Commun., vol. 12, pp. 120-127, Jan. 1994.
15. T. Leventhal, G. Nemhauser, and L. Trotter, "A column generation algorithm for optimal traffic assignment," Transp. Sci., vol. 7, no. 2, pp. 168-176, May 1973.
16. D. G. Luenberger, Linear and Nonlinear Programming, 2nd ed. Reading, MA: Addison-Wesley, 1984.
17. M. Minoux, "Optimum synthesis of a network with nonsimultaneous multicommodity flow requirements," in Studies on Graphs and Discrete Programming (Annals of Discrete Mathematics 11), P. Hansen, Ed. North Holland, 1981, pp. 269-277,.
18. M. Minoux and J. Y. Serreault, "Subgradient optimization and large scale programming: An application to optimum multicommodity network synthesis with security constraints," RAIRO/Operations Res., vol. 15, no. 2, pp. 185-203, May 1981.
19. K. Murakami and H. S. Kim, "Near-optimal virtual path routing for survivable ATM networks," in Proc. IEEE INFOCOM'94, Toronto, Ont., Canada, pp. 208-215, June 1994.
20. _, "Virtual path routing for survivable ATM networks," IEEE/ACM Trans. Networking, vol. 4, pp. 22-39, Feb. 1996.
21. K. Murakami, "Survivable network management for high-speed ATM networks," Ph.D. dissertation, Dep. Elec. Comput. Eng., Carnegie-Mellon Univ., Pittsburgh, PA, Sept. 1995.
22. J. K. Reid, "A sparsity-exploiting variant of the Bartels-Golub decomposition for linear programming basis," Mathemat. Programming, vol. 24, pp. 55-69, 1982.
23. H. Sakauchi, Y. Nishimura, and S. Hasegawa, "A self-healing network with an economical spare-channel assignment," in Proc. IEEE GLOBECOM'90, San Diego, CA, pp. 438-443, Dec. 1990.
24. C. H. Yang and S. Hasegawa, "FITNESS: Failure immunization technology for network service survivability," in Proc. IEEE GLOBECOM'88, Hollywood, FL, Nov. 1988, pp. 1549-1554.
25. W. L. Winston, Operations Research: Applications and Algorithms. Boston, MA: PWS-KENT, 1987.
26. T.-H. Wu, Fiber Network Service Survivability. Norwood, MA: Artech, 1992.
27. T.-H. Wu, H. Kobrinski, D. Ghosal, and T. V. Lakshman, "The impact of SONET digital cross-connect system architecture on distributed restoration," IEEE J. Select. Areas Commun., vol. 12, pp. 79-87, Jan. 1994.