Approximating optimal spare capacity allocation by successive survivable routing

IEEE/ACM Transactions on Networking

Volumn 13, Issue 1, 2005, Pages 198-211

  Liu, Yu ^a   Tipper, David ^b   Siripongwutikorn, Peerapon ^c  

^a OPNET Technologies Inc   (United States)

^b UNIVERSITY OF PITTSBURGH   (United States)

^c KING MONGKUT'S UNIVERSITY OF TECHNOLOGY THONBURI   (Thailand)

Author keywords

MPLS traffic engineering; Multi commodity flow; Network planning and optimization; Network survivability; Protection and restoration; Spare capacity allocation; Survivable routing

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; GENETIC ALGORITHMS; MATHEMATICAL MODELS; MATRIX ALGEBRA; OPTIMIZATION; ROUTERS; TELECOMMUNICATION SERVICES;

MPLS TRAFFIC ENGINEERING; MULTI-COMMODITY FLOW; NETWORK SURVIVABILITY; SPARE CAPACITY ALLOCATION; SURVIVABLE ROUTING;

TELECOMMUNICATION NETWORKS;

EID: 15544375036     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2004.842220     Document Type: Article

References (64)

1. W. D. Grover. Mesh-Based Survivable Transport Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking. New York: Prentice-Hall, 2003.
2. C. Dovrolis and P. Ramanathan, "Resource aggregation for fault tolerance in integrated service networks," ACM Comput. Commun. Rev. vol. 28, no. 2, pp. 39-53, 1998.
3. M. Kodialam and T. V. Lakshman, "Dynamic routing of bandwidth guaranteed tunnels with restoration," in Proc. IEEE INFOCOM, Mar. 2000.
4. M. Kodialam and T. V. Lakshman, "Dynamic routing of restorable bandwidth-guaranteed tunnels using aggregated network resource usage information," IEEE/ACM Trans. Networking, vol. 11, no. 3, pp. 399-410, Jun. 2003.
5. S. Chaudhuri, G. Hjalmtysson, and J. Yates. (2000) Control of Lightpaths in an Optical Network. IETF. [Online]. Availablé: draft-chaudhuri-ip-olxc-control-00.txt
6. R. Doverspike and J. Yates, "Challenges for MPLS in optical network restoration," IEEE Commun. Mag., vol. 39, no. 2, pp. 89-96. Feb. 2001.
7. L. Nederlof, K. Struyue, C. Shea, H. Misser, Y. Du, and B. Tamayo, "End-to-end survivable broadband networks," IEEE Commun. Mag., vol. 9, pp. 63-70, 1995.
8. R. Diestel, Graph Theory, 2 ed: Springer-Verlag, 2000, vol. 173. Graduate Textbooks in Mathematics.
9. R. Sedgewick, Algorithms, 2 ed. Reading, MA: Addison-Wesley, 1988.
10. W.-P. Wang, D. Tipper, B. Jæger, and D. Medhi, "Fault recovery routing in wide area packet networks," in Proc. 15th Int. Teletraffic Congr., Washington, DC, Jun. 1997.
11. B. Jæger and D. Tipper, "Prioritized traffic restoration in connection oriented QoS based networks," Comput. Netw., vol. 26, no. 18, pp. 2025-2036, Dec. 2003.
12. T.-H. Wu, Fiber Network Service Survivability. Boston, MA: Artech House, 1992.
13. T.-H. Wu, "Emerging technologies for fiber network survivability," IEEE Commun. Mag., vol. 33, no. 2, pp. 58-74, Feb. 1995.
14. R. Doverspike and B. Wilson, "Comparison of capacity efficiency of DCS network restoration routing techniques," J. Netw. Syst. Manag., vol. 2, no. 2, pp. 95-123, 1994.
15. Y. Xiong and L. G. Mason, "Restoration strategies and spare capacity requirements in self-healing ATM networks," IEEE/ACM Trans. Networking, vol. 7, no. 1, pp. 98-110, Feb. 1999.
16. Y. Xiong and L. Mason, "Comparison of two path restoration schemes in self-healing networks," Comput. Netw., vol. 38, no. 5, 2002.
17. Y. Liu, "Spare Capacity Allocation: Model. Analysis and Algorithm," Ph.D., Sch. Information Sciences, Univ. Pittsburgh, PA, 2001.
18. Y. Liu and D. Tipper, "Spare capacity allocation for nonlinear cost and failure-dependent path restoration," in 3rd Int. Workshop on Design of Reliable Communication Networks (DRCN), Budapest, Hungary, Oct. 7-10, 2001.
19. D. A. Dunn, W. D. Grover, and M. H. MacGregor, "Comparison of k-shortest paths and maximum flow routing for network facility restoration," IEEE J. Select. Areas Commun., vol. 2, no. 1, pp. 88-99, Jan. 1994.
20. W. D. Grover, "Distributed restoration of the transport network," in Telecommunications Network Management into the 21st Century, Techniques, Standards, Technologies and Applications, S. Aidarous and T. Plevyak, Eds. New York: IEEE Press, 1994, ch. 11, pp. 337-417.
21. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms and Applications. New York: Prentice-Hall, 1993.
22. J. W. Suurballe, "Disjoint paths in a network," Networks, vol. 4, pp. 125-145, 1974.
23. 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. R. Bhandari, Survivable Networks Algorithms for Diverse Routing. Boston, MA: Kluwer, 1999.
25. Y. Liu and D. Tipper, "Successive survivable routing to protect node failures," in Proc. IEEE Global Communications Conf., San Antonio, TX, Nov. 2001.
26. E. Oki, N. Matsuura, K. Shiomoto, and N. Yamanaka, "A disjoint path selection scheme with shared risk link groups in GMPLS networks," IEEE Commun. Lett., vol. 6, no. 9, pp. 406-408, Sep. 2002.
27. D. Xu. Y. Xiong, C. Qiao, and G. Li, "Trap avoidance and protection schemes in networks with shared risk link groups," J. Lightwave Technol., vol. 21, no. 11, pp. 2683-2693, Nov. 2003.
28. M. Stoer, Design of Survivable Networks. New York: Springer-Verlag, 1992, vol. 1531, Lecture Notes in Mathematics.
29. E. Modiano and A. Narula-Tam, "Survivable routing of logical topologies in WDM networks," in Proc. IEEE INFOCOM, Apr. 2001.
30. O. Crochat, J.-Y. Le Boudec, and O. Gerstel, "Protection interoperability for WDM optical networks," IEEE/ACM Trans. Networking, vol. 8, no. 3, pp. 384-395, Jun. 2000.
31. P. Demeester and M. Gryseels, "Resilience in multilayer networks," IEEE Commun. Mag., vol. 37, no. 8, pp. 70-76, Aug. 1999.
32. R. Doverspike, "Trends in layered network management of ATM, SONET and WDM technologies for network survivability and fault management," J. Netw. Syst. Manag., vol. 5, pp. 215-220, 1997.
33. M. Médard, S. G. Finn, R. A. Barry, and R. G. Gallager, "Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs," IEEE/ACM Trans. Networking, vol. 7, no. 5, pp. 641-652, Oct. 1999.
34. M. Herzberg, S. J. Bye, and U. Utano, "The hop-limit approach for spare-capacity assignment in survivable networks," IEEE/ACM Trans. Networking, vol. 3, no. 6, pp. 775-784, Dec. 1995.
35. R. Iraschko, M. MacGregor, and W. Grover, "Optimal capacity placement for path restoration in STM or ATM mesh survivable networks," IEEE/ ACM Trans. Networking, vol. 6, no. 3, pp. 325-336, Jun. 1998.
36. M. Herzberg, D. Wells, and A. Herschtal "Optimal resource allocation for path restoration in mesh-type self-healing networks," in Proc. 15th Int. Teletraffic Congr., vol. 15, Washington, DC, Jun. 1997.
37. W. D. Grover, R. R. Iraschko, and Y. Zheng, "Comparative methods and issues in design of mesh-restorable STM and ATM networks," in Telecommunication Network Planning, P. Soriano and B. Sanso, Eds. Boston, MA: Kluwer, 1999, pp. 169-200.
38. A. Al-Rumaih, D. Tipper, Y. Liu, and B. A. Norman, "Spare capacity planning for survivable mesh networks," in Proceedings IFIP-TC6 Net- working 2000, vol. 1815, Lecture Notes in Computer Science (LNCS), Paris, France, May 2000, pp. 957-968.
39. B. Van Caenegem, W. Van Parys, F. De Turck, and P. M. Demeester, "Dimensioning of survivable WDM networks," IEEE J. Select. Areas Commun., vol. 16, no. 7, pp. 1146-1157, Sep. 1998.
40. S. Ramamurthy and B. Mukherjee, "Survivable WDM mesh networks, part I - Protection," in Proc. IEEE INFOCOM, New York, Mar. 1999.
41. T. H. Oh, T. M. Chen, and J. L. Kennington, "Fault restoration and spare capacity allocation with QoS constraints for MPLS networks," in Proc. IEEE Global Communications Conf., vol. III, Nov. 2000, pp. 1731-1735.
42. D. Medhi and D. Tipper, "Some approaches to solving a multi-hour broadband network capacity design problem with single-path routing," Telecommun. Syst., vol. 13, no. 2, pp. 269-291, 2000.
43. K.-T. Ko, K.-S. Tang, C.-Y. Chan, K.-F. Man, and S. Kwong, "Using genetic algorithms to design mesh networks," IEEE Comput. Mag., vol. 30, no. 8, pp. 56-60, Aug. 1997.
44. L. T. M. Berry, B. A. Murtagh, G. McMahon, S. Sugden, and L. Welling, "An integrated GA-LP approach to communication network design," Telecommun. Syst., vol. 12, pp. 265-280, 1999.
45. C.-C. Shyur, T.-C. Lu, and U.-P. Wen, "Applying tabu search to spare capacity planning for network restoration," Comput. Oper. Res., vol. 26, no. 10, pp. 1175-1194, Oct. 1999.
46. H. Sakauchi, Y. Nishimura, and S. Hasegawa, "A self-healing network with an economical spare-channel assignment," in Proc. IEEE Global Communications Conf., Nov. 1990, pp. 438-442.
47. J. L. Kennington and M. W. Lewis, "Models and Algorithms for Creating Restoration Paths in Survivable Mesh Networks," Southern Methodist Univ., Dept. Computer Sci. Eng., 99-CSE-5, 1999.
48. M. H. MacGregor, W. D. Grover, and K. Ryhorchuk, "Optimal spare capacity preconfiguration for faster restoration of mesh networks," J. Netw. Syst. Manag., vol. 5, no. 2, pp. 159-171, 1997.
49. R. Braden, L. Zhang, S. Berson, S. Herzog, and S. Jamin, "Resource ReSerVation Protocol (RSVP) - Version 1 Functional Specification," IETF, RFC 2205, 1997.
50. E. Bouillet, P. Mishra, J.-F. Labourdette, K. Perlove, and S. French, "Lightpath re-optimization in mesh optical networks," in Proc. Eur. Conf. Networks & Optical Communications (NOC'02), Darsmstadt, Germany, Jun. 2002.
51. P. Charalambous, G. Ellinas, C. Dennis, E. Bouillet, J.-F. Labourdette, A. A. Akyamaç, S. Chaudhuri, M. Morokhovich, and D. Shales, "A national mesh network using optical cross-connect switches," in Proc. Optical Fiber Communication Conference (OFC'03), Atlanta, GA, Mar. 2003.
52. W. D. Grover, V. Rawat, and M. H. MacGregor, "Fast heuristic principle for spare capacity placement in mesh-restorable SONET/SDH transport networks," Electron. Lett., vol. 33, no. 3, pp. 195-196, Jan. 1997.
53. W. D. Grover and D. Y. Li, "The forcer concept and express route planning in mesh-survivable networks," J. Netw. Syst. Manag., vol. 7, no. 2. pp. 199-223, 1999.
54. J. Duato, "A theory of fault-tolerant routing in wormhole networks," IEEE Trans. Parallel Distrib. Syst., vol. 8, no. 8, pp. 790-802, Aug. 1997.
55. S. Cwilich, M. Deng, D. F. Lynch, and S. J. Phillips, "Algorithms for restoration planning in a telecommunications network," in Algorithm Engineering and Experimentation Int. Workshop (ALENEX'99), vol. 1619, Lecture Notes in Computer Science 1619, 1999, pp. 194-209.
56. X. Su and C.-F. Su, "An online distributed protection algorithm in WDM networks," in Proc. IEEE Int. Conf. Communications, 2001, pp. 1571-1575.
57. C. Qiao and D. Xu. "Distributed partial information management (DPIM) schemes for survivable networks-Part I," in Proc. IEEE INFOCOM, 2002, pp. 302-311.
58. D. Xu, C. Qiao, and Y. Xiong, "An ultra-fast shared path protection scheme-Distributed partial information management, part II," in Proc. 10th Int. Conf. Network Protocols (ICNP), Nov. 2002, pp. 344-353.
59. B. Kolman, R. C. Busby, and S. Ross, Discrete Mathematical Structures. New York: Prentice-Hall, 1996.
60. D. O. Awduche, L. Berger, D. Gan, T. Li, V. Srinivasan, and G. Swallow, "RSVP-TE: Extensions to RSVP for LSP Tunnels," IETF, RFC 3209, 2001.
61. S. Darisala, A. Fumagalli, P. Kothandaraman, M. Tacca, L. Valcarenghi, M. Ali, and D. Elie-Dit-Cosaque, "On the convergence of the link-state advertisement protocol in survivable WDM mesh networks," in Proc. 7th IFIP Working Conf Optical Network Design and Modeling (ONDM 2003) Budapest, Hungary, Feb. 2003.
62. R. Fourer, D. M. Gay, and B. W. Kernighan, AMPL: A Modeling Language for Mathematical Programming. San Francisco, CA: Scientific Press, 1993.
63. CPLEX User Manual v6.0, ILOG, Inc., 1998.
64. Y. Liu, D. Tipper, and P. Siripongwutikorn, "Approximating optimal spare capacity allocation by successive survivable routing," in Proc. IEEE INFOCOM, Anchorage, AL, Apr. 2001, pp. 699-708.