Skip to main content
SpringerLink
Log in

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

  • Published:
Computational Optimization and Applications Aims and scope Submit manuscript

Abstract

Our discussion in this article centers on the application of a Lagrangean relaxation and a subgradient optimization technique to the problem of primary route assignment (PRA) in survivable connection-oriented networks. The PRA problem consists in a static optimization of primary routes minimizing the Lost Flow in Node (LFN) function. The major contribution of this work is a combination of the Lagrangean relaxation with other heuristic algorithms. We evaluate the performance of the proposed Lagrangean-based heuristic by making a comparison with their counterparts including evolutionary algorithm and GRASP using various network topologies and demand patterns. The results of simulation tests show that the new algorithm provides sub-optimal results, which are better than other heuristics.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  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)

    Article  Google Scholar 

  2. Burns, J., Ott, T., Krzesinski, A., Muller, K.: Path selection and bandwidth allocation in MPLS networks. Perform. Eval. 52, 133–152 (2003)

    Article  Google Scholar 

  3. Calvert, K.I., Doar, M.B., Zegura, E.W.: Modeling Internet topology. IEEE Commun. Mag. 35, 160–163 (1997)

    Article  Google Scholar 

  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)

    Article  MathSciNet  MATH  Google Scholar 

  6. Gavish, B., Huntler, S.: An algorithm for optimal route selection in SNA networks. IEEE Trans. Commun. 31(10), 1154–1160 (1983)

    Article  Google Scholar 

  7. Gavish, B., Neuman, I.: A system for routing and capacity assignment in computer communication networks. IEEE Trans. Commun. 37, 360–366 (1989)

    Article  Google Scholar 

  8. Gavish, B., Neuman, I.: Routing in a network with unreliable components. IEEE Trans. Commun. 40, 1248–1258 (1992)

    Article  Google Scholar 

  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)

    Google Scholar 

  10. Grover, W.: Mesh-based Survivable Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking. Prentice Hall, Upper Saddle River (2004)

    Google Scholar 

  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)

    Google Scholar 

  12. Gunluk, O.: A branch-and-cut algorithm for capacitated network design problems. Math. Program. 86, 17–39 (1999)

    Article  MathSciNet  Google Scholar 

  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)

    Article  Google Scholar 

  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)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Article  Google Scholar 

  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)

    Google Scholar 

  18. Jæger, B., Tipper, D.: Prioritized traffic restoration in connection oriented QoS based networks. Comput. Commun. 26(18), 2025–2036 (2003)

    Article  Google Scholar 

  19. Kasprzak, A.: Topological Design of Wide Area Networks. Wroclaw University of Technology Press, Wroclaw (2001)

    Google Scholar 

  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)

    Google Scholar 

  23. Murakami, K., Kim, H.: Virtual path routing for survivable ATM networks. IEEE/ACM Trans. Netw. 4, 22–39 (1996)

    Article  Google Scholar 

  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)

    MATH  Google Scholar 

  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)

    Google Scholar 

  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)

    Google Scholar 

  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)

    Google Scholar 

  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)

    Google Scholar 

  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)

    Google Scholar 

  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)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Chair of Systems and Computer Networks, Faculty of Electronics, Wroclaw University of Technology, Wybrzeze Wyspianskiego 27, 50-370, Wroclaw, Poland

    Krzysztof Walkowiak

Authors
  1. Krzysztof Walkowiak
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Krzysztof Walkowiak.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Walkowiak, K. Lagrangean heuristic for primary routes assignment in survivable connection-oriented networks. Comput Optim Appl 40, 119–141 (2008). https://doi.org/10.1007/s10589-007-9077-1

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10589-007-9077-1

Keywords

Search

Navigation