Comparing restoration concepts using optimal network configurations with integrated hardware and routing decisions

Journal of Network and Systems Management

Volumn 13, Issue 1, 2005, Pages 99-118

  Orlowski, Sebastian ^a   Wessäly, Roland ^a  

^a ZUSE INSTITUTE BERLIN   (Germany)

Author keywords

Branch and cut algorithm; Hardware configuration; Link and path restoration; Routing; Survivable network design

Indexed keywords

ALGORITHMS; COMPUTER HARDWARE; DECISION MAKING; INTERFACES (COMPUTER); OPTIMIZATION; PRODUCT DESIGN; ROUTERS; TOPOLOGY;

BRANCH-AND-CUT ALGORITHM; HARDWARE CONFIGURATION; LINK AND PATH RESTORATION; SURVIVABLE NETWORK DESIGN;

TELECOMMUNICATION LINKS;

EID: 18244408797     PISSN: 10647570     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10922-005-1864-3     Document Type: Article

References (19)

1. Y. Xiong, L. Mason, Restoration strategies and spare capacity requirements in selfhealing ATM networks, IEEE infocom'97, pp. 353-360, 1997.
2. R. Iraschko, M. MacGregor, and W. D. Grover, Optimal capacity placement for path restoration in STM or ATM mesh survivable networks, IEEE/ACM Transactions on Networking, Vol. 6, No. 3, pp. 325-336, 1998.
3. J. L. Kennington, V. S. S. Nair, and G. Spride, Optimal spare capacity assignment for path restorable mesh networks: Cuts, decomposition, and an empirical analysis, Technical Report 98-CSE-1, Department of Computer Science and Engineering, Southern methodist University, Dallas, 1998.
4. F. Poppe and P. Demeester, Economic allocation of spare capacity in mesh-restorable networks: Models and algorithms, 6th International Conference on Telecommunications Systems, Modelling and Analysis, Nashville, pp. 77-86, March 1998.
5. J. Doucette and W. D. Grover, Comparision of mesh protection and restoration schemes and the dependency on graph connectivity. 3rd International Workshop on Design of Reliable Communication networks (DRCN 2001), pp. 121-128, October 2001.
6. M. Iri, On and extension of the maximum-flow minimum-cut theorem to multicommodity flows, Journal of the Operations Research Society of Japan, Vol. 13, No. 3, pp. 129-135, 1971.
7. K. Murakami, Survivable network management for high-speed ATM networks, PhD thesis, Camegie-Mellon University, 1995.
8. B. Van Caenegem, N. Wauters, and P. Demeester, Spare capacity assignment for different restoration strategies in mesh survivable networks, IEEE International Conference on Communication 1997, pp. 288-292, 1997.
9. DISCNET, Network planning and configuration engine. Atesio GmbH, www.atesio.de, 2000-2004.
10. G. Dahl and M. Stoer, A polyhedral approach to multicommodity survivable network design, Numerische Mathematik, Vol. 68, No. 1, pp. 149-167, 1994.
11. J. Doucett and W. D. Grover, Increasing the efficiency of span-restorable mesh networks on low-connectivity graphs, 3rd International workshop on Design of Reliable Communication Networks (DRCN 2001), Budapest, pp. 99-106, 2001.
12. M. Minoux, Optimum synthesis of a network with non-simultaneous MCF requirements, Studies on Graphs and Discrete Programming, P. Hansen (ed.), pp. 269-277. North Holland Publishing Company, 1981.
13. R. Wessäly, Dimensioning Survivable Capacitated Networks, PhD thesis, TU Berlin, 2000.
14. J. Benders, Pardoning procedures for solving mixed-variables programming problems, Numerische Mathematik, Vol. 4, No. 1, pp. 238-252, 1962.
15. M. Padberg and G. Rinaldi, A branch and cut algorithm for the resolution of large-scale symmetric travelling salesman problems, SIAM Review, No. 33, pp. 60-100, 1991.
16. L. A. Wolsey, Valid inequality for 0/1 knapsacks and MIPs with generalised upper bound constraints, Discrete Applied Mathematics, No. 29, pp. 251-261, 1990.
17. S. Orlowski, Local and global restoration of node and link failures in telecommunication networks, Diploma thesis, TU Berlin, 2003.
18. ILOG CPLEX 8.0, Retrieved from www.ilog.com/products/cplex.
19. S. Orlowski and R. Wessäly, The effect of hop limits on optimal cost in survivable network design, Telecommunications Network Design and Economics and Management, G. Anandalingam and S. Raghavan (eds.), 2004, to appear. Preprint version available at ftp://ftp.zib.de/pub/zip-publications/reports/ZR- 04-23.pdf.