Lagrangean heuristic for primary routes assignment in survivable connection-oriented networks

Computational Optimization and Applications

Volumn 40, Issue 2, 2008, Pages 119-141

  Walkowiak, Krzysztof ^a  

^a WROCLAW UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

Lagrangean relaxation; Network survivability; Optimization

Indexed keywords

FUNCTION EVALUATION; HEURISTIC ALGORITHMS; OPTIMIZATION; PROBLEM SOLVING; TOPOLOGY;

LAGRANGEAN RELAXATION; NETWORK SURVIVABILITY; NETWORK TOPOLOGIES;

LAGRANGE MULTIPLIERS;

EID: 42149098722     PISSN: 09266003     EISSN: 15732894     Source Type: Journal    
DOI: 10.1007/s10589-007-9077-1     Document Type: Article

References (34)

1. Barnhart, C., Hane, C., Vance, P.: Using branch-and-price-and-cut to solve origin-destination integer multicommodity flow problems. Oper. Res. 48(2), 318-326 (2000)
2. Burns, J., Ott, T., Krzesinski, A., Muller, K.: Path selection and bandwidth allocation in MPLS networks. Perform. Eval. 52, 133-152 (2003)
3. Calvert, K.I., Doar, M.B., Zegura, E.W.: Modeling Internet topology. IEEE Commun. Mag. 35, 160-163 (1997)
4. Dias, R.A., Camponogara, E., Farines, J.M., Willrich, R., Campestrini, A.: Implementing traffic engineering in MPLS-based IP networks with Lagrangean relaxation. In: Proc. of Computers and Communication (ISCC 2003), 30 June-3 July 2003, vol. 1, pp. 373-378 (2003)
5. Fratta, L., Gerla, M., Kleinrock, L.: The flow deviation method: An approach to store-and-forward communication network design. Networks 3, 97-133 (1973)
6. Gavish, B., Huntler, S.: An algorithm for optimal route selection in SNA networks. IEEE Trans. Commun. 31(10), 1154-1160 (1983)
7. Gavish, B., Neuman, I.: A system for routing and capacity assignment in computer communication networks. IEEE Trans. Commun. 37, 360-366 (1989)
8. Gavish, B., Neuman, I.: Routing in a network with unreliable components. IEEE Trans. Commun. 40, 1248-1258 (1992)
9. Gola, M., Kasprzak, A.: The two-criteria topological design problem in WAN with delay constraint: An algorithm and computational results. In: Lecture Notes in Computer Science, vol. 2667, pp. 180-189. Springer, New York (2003)
10. Grover, W.: Mesh-based Survivable Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking. Prentice Hall, Upper Saddle River (2004)
11. Guerin, R., Ahmadi, M., Nagshineh, M.: Equivalent capacity and its application to bandwidth allocation in high-speed networks. IEEE JSAC 9, 968-981 (1991)
12. Gunluk, O.: A branch-and-cut algorithm for capacitated network design problems. Math. Program. 86, 17-39 (1999)
13. Holmberg, K.: Lagrangean heuristics for linear cost multicommodity network flow problems. Working Paper LiTH-MAT-OPT/WP-1995-01, Department of Mathematics, Linkoping Institute of Technology, Sweden (1995)
14. Holmberg, K., Yuan, D.: A Lagrangean approach to network design problems. Int. Trans. Oper. Res. 5, 529-539 (1998)
15. Holmberg, K., Yuan, D.: A Lagrangean heuristic based branch-and-bound approach for the capacitated network design problem. Oper. Res. 48, 461-481 (2000)
16. Herzberg, M., Bye, S., Utano, A.: The hop-limit approach for spare-capacity assignment in survivable networks. IEEE/ACM Trans. Netw. 3, 775-784 (1995)
17. Hui, J., Gursoy, M., Moayeri, N., Yates, R.: A layered broadband switching architecture with physical and virtual path configurations. IEEE JSAC 9, 1416-1426 (1991)
18. Jæger, B., Tipper, D.: Prioritized traffic restoration in connection oriented QoS based networks. Comput. Commun. 26(18), 2025-2036 (2003)
19. Kasprzak, A.: Topological Design of Wide Area Networks. Wroclaw University of Technology Press, Wroclaw (2001)
20. Markowski, M., Kasprzak, A.: An approximate algorithm for web replica allocation and topology assignment problem in WAN. In: Proceedings of 17th IMACS World Congress, Paris, France (2005)
21. Medhi, D., Tipper, D.: Some approaches to solving a multi-hour broadband network capacity design problem with single-path routing. Technical Report, CST/UMKC, July 1996
22. Mitchell, J.: Branch-and-cut methods for combinatorial optimization problems. In: Handbook of Applied Optimization. Oxford University Press, London (2002)
23. Murakami, K., Kim, H.: Virtual path routing for survivable ATM networks. IEEE/ACM Trans. Netw. 4, 22-39 (1996)
24. Nilsson, P., Pióro, M., Dziong, Z.: Link protection within an existing backbone network. In: Proc. of International Network Optimization Conference (INOC) 2003, Evry, Paris, 27-29 October 2003
25. Pióro, M., Medhi, D.: Routing, Flow, and Capacity Design in Communication and Computer Networks. Morgan Kaufman, San Mateo (2004)
26. Przewozniczek, M., Walkowiak, K.: Evolutionary algorithm for congestion problem in connection-oriented networks. In: Lecture Notes in Computer Science, vol. 3483, pp. 802-811. Springer, New York (2005)
27. Rétvári, G., Cinkler, T., Bíró, J.: A novel Lagrangian-relaxation to the minimum cost multicommodity flow problem and its application to OSPF traffic engineering. In: Proc. of ISCC 2004 (2004)
28. Resende, M.G.C., Ribeiro, C.C.: A GRASP with path-relinking for private virtual circuit routing. Technical report, AT&T Labs Research (2001)
29. Ryba, P., Kasprzak, A.: The gateways location and capacity assignment problem in hierarchical WANs: An approximate algorithm and computational results. In: Proc. of 18th European Meetings on Cybernetics and Systems Research (EMCSR) (2006)
30. Walkowiak, K.: A new approach to survivability of connection oriented networks. In: Lecture Notes in Computer Science, vol. 2657, pp. 501-510. Springer, New York (2003)
31. Walkowiak, K.: A branch and bound algorithm for primary routes assignment in survivable connection oriented networks. In: Computational Optimization and Applications, vol. 27, pp. 149-171. Kluwer Academic, Dordrecht (2004)
32. Walkowiak, K.: A new method of primary routes selection for local restoration. In: Lecture Notes in Computer Science, vol. 3042, pp. 1024-1035. Springer, New York (2004)
33. Walkowiak, K.: Survivable online routing for MPLS traffic engineering. In: Lecture Notes in Computer Science, vol. 3266, pp. 288-297. Springer, New York (2004)
34. Walkowiak, K.: The hop-limit approach for flow assignment in survivable connection-oriented networks. In: New Trends in Computer Networks, vol. 1. Imperial College Press, London (2005)