Skip to main content
SpringerLink
Log in

Intra-domain traffic engineering with shortest path routing protocols

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

Throughout the last decade, extensive deployment of popular intra-domain routing protocols such as open shortest path first (OSPF) and intermediate system–intermediate system (IS-IS), has drawn an ever increasing attention to internet traffic engineering. This paper reviews optimization techniques that have been deployed for managing intra-domain routing in networks operated with shortest path routing protocols, and the state-of-the-art research that has been carried out in this direction.

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

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Algorithm 1
Algorithm 2

Similar content being viewed by others

References

  • Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1993). Network flows: theory, algorithms, and applications. Englewood Cliffs: Prentice Hall.

    Google Scholar 

  • Altın, A., Belotti, P., & Pinar, M. (2006). OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty (Tech. Rep.). Bilkent University.

  • Altin, A., Fortz, B., Thorup, M., & Ümit, H. (2009). Intra-domain traffic engineering with shortest path routing protocols. 4OR, 7(4), 301–335.

    Article  Google Scholar 

  • Altin, A., Fortz, B., & Ümit, H. (2012). Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty. Networks, 60(2), 132–139. http://dx.doi.org/10.1002/net.21461.

    Google Scholar 

  • Applegate, D., & Cohen, E. (2003). Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs. In SIGCOMM ’03: proceedings of the 2003 conference on applications, technologies, architectures, and protocols for computer communications (pp. 313–324). New York: ACM. http://doi.acm.org/10.1145/863955.863991.

    Chapter  Google Scholar 

  • Applegate, D., & Cohen, E. (2006). Making routing robust to changing traffic demands: algorithms and evaluation. IEEE/ACM Transactions on Networking, 14(6), 1193–1206.

    Article  Google Scholar 

  • Balon, S., & Leduc, G. (2008). Combined intra- and inter-domain traffic engineering using hot-potato aware link weights optimization. In SIGMETRICS ’08: proceedings of the 2008 ACM SIGMETRICS international conference on measurement and modeling of computer systems (pp. 441–442). New York: ACM. http://doi.acm.org/10.1145/1375457.1375511.

    Chapter  Google Scholar 

  • Balon, S., & Leduc, G. (2009). BGP-aware IGP link weight optimization in presence of route reflectors. In Proc. of IEEE INFOCOM, Rio de Janeiro, Brazil, 20–24 April 2009 (pp. 316–324).

    Google Scholar 

  • Balon, S., Skivée, F., & Leduc, G. (2006). How well do traffic engineering objective functions meet TE requirements? In LNCS: Vol. 3976. Proceedings of IFIP networking 2006, Coimbra. Berlin: Springer.

    Google Scholar 

  • Bauer, D., Yuksel, M., Carothers, C., & Kalyanaraman, S. (2006). A case study in understanding OSPF and BGP interactions using efficient experiment design. In PADS ’06: proceedings of the 20th workshop on principles of advanced and distributed simulation (pp. 158–165). Washington: IEEE Comput. Soc. http://dx.doi.org/10.1109/PADS.2006.6.

    Chapter  Google Scholar 

  • Bean, J. (1994). Genetic algorithms and random keys for sequencing and optimization. ORSA Journal on Computing, 6, 154–160.

    Article  Google Scholar 

  • Bellman, R. (1958). On a routing problem. Quarterly of Applied Mathematics, 16(1), 87–90.

    Google Scholar 

  • Belotti, P., & Pinar, M. (2008). Optimal oblivious routing under statistical uncertainty. Optimization and Engineering, 9(3), 257–271.

    Article  Google Scholar 

  • Ben-Ameur, W. (2002). Multi-hour design of survivable classical IP networks. International Journal of Communication Systems, 15, 553–572.

    Article  Google Scholar 

  • Ben-Ameur, W., & Gourdin, E. (2003). Internet routing and related topology issues. SIAM Journal on Discrete Mathematics, 17(1), 18–49.

    Article  Google Scholar 

  • Ben-Ameur, W., & Kerivin, H. (2005). Routing of uncertain demands. Optimization and Engineering, 3, 283–313.

    Article  Google Scholar 

  • Ben-Ameur, W., Gourdin, E., Liau, B., & Michel, N. (2000a). Dimensioning of internet networks. In Proc. international workshop on design of reliable communication networks (DRCN’2000), Munich, Germany (pp. 56–61).

    Google Scholar 

  • Ben-Ameur, W., Gourdin, E., Liau, B., & Michel, N. (2000b). Optimizing administrative weights for efficient single-path routing. In Proc. of networks.

    Google Scholar 

  • Blanchy, F., Mélon, L., & Leduc, G. (2003). Routing in a MPLS network featuring preemption mechanisms. In Proc. of 10th international conference on telecommunications (ICT’2003) (pp. 253–260). Papeete, Tahiti: IEEE Press.

    Google Scholar 

  • Bley, A. (2003). A Lagrangian approach for integrated network design and routing in IP networks. In Proceedings of the 1st international network optimization conference (INOC 2003), Paris, France (pp. 107–113).

    Google Scholar 

  • Bley, A. (2005). Finding small administrative lengths for shortest path routing. In Proceedings of international network optimization conference (INOC 2005), Lisbon, Portugal (pp. 121–128).

    Google Scholar 

  • Bley, A. (2007a). Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths. Networks, 50(1), 29–36.

    Article  Google Scholar 

  • Bley, A. (2007b). Routing and capacity optimization for IP networks. PhD thesis, Technische Universität Berlin.

  • Bley, A., & Koch, T. (2002). Integer programming approaches to access and backbone IP-network planning (Tech. Rep. ZR-02-41). ZIB. In Proceedings of 3rd international conference on high performance scientific computing, Hanoi, 2006. http://dx.doi.org/10.1007/978-3-540-79409-7_7.

  • Bley, A., Grötschel, M., & Wessäly, R. (2000). Design of broadband virtual private networks: model and heuristics for the B-WIN. Robust Communication Networks: Interconnection and Survivability, 53, 1–16.

    Google Scholar 

  • Bley, A., Fortz, B., Gourdin, E., Holmberg, K., Klopfenstein, O., Pióro, M., Tomaszewski, A., & Ümit, H. (2010). Optimization of OSPF routing in IP networks. In A. M. C. A. Koster & X. Muñoz (Eds.), Graphs and algorithms in communication networks: studies in broadband, optical, wireless and ad hoc networks (pp. 199–240). Berlin: Springer. Chap. 8.

    Google Scholar 

  • Broström, P., & Holmberg, K. (2005). Design of IP/OSPF networks using a Lagrangean heuristic on an in-graph based model. In L. Gouveia & C. Mourao (Eds.), Proc. INOC 2005, University of Lisbon, Lisbon, Portugal (pp. 702–709).

    Google Scholar 

  • Broström, P., & Holmberg, K. (2008). Valid cycles: a source of infeasibility in open shortest path first routing. Networks, 52(4), 206–215. http://dx.doi.org/10.1002/net.v52:4.

    Article  Google Scholar 

  • Buriol, L., Resende, M., Ribeiro, C., & Thorup, M. (2005). A hybrid genetic algorithm for the weight setting problem in OSPF/IS-IS routing. Networks, 46(1), 36–56.

    Article  Google Scholar 

  • Buriol, L. S., Resende, M. G. C., & Thorup, M. (2008). Speeding up dynamic shortest-path algorithms. INFORMS Journal on Computing, 20(2), 191–204. http://dx.doi.org/10.1287/ijoc.1070.0231.

    Article  Google Scholar 

  • Cerav-Erbas, S., Delcourt, O., Fortz, B., & Quoitin, B. (2006). The interaction of IGP weight optimization with BGP. In International conference on internet surveillance and protection (Vol. 0, p. 9). Los Alamitos: IEEE Comput. Soc. http://doi.ieeecomputersociety.org/10.1109/ICISP.2006.33.

    Chapter  Google Scholar 

  • CISCO (2009). Tunnel builder pro. http://www.cisco.com/.

  • De Giovanni, L., Fortz, B., & Labbé, M. (2005). A lower bound for the internet protocol network design problem. In L. Gouveia (Ed.), Proc. INOC 2005 (pp. 401–407).

    Google Scholar 

  • Degrande, N., Hoey, G. V., de la Vallée-Poussin, P., & van den Busch, S. (2003). Inter-area traffic engineering in a differentiated services network. Journal of Network and Systems Management, 11(4), 427–445.

    Article  Google Scholar 

  • Dijkstra, E. W. (1959). A note on two problems in connexion with graphs. Numerische Mathematik, 1, 269–271.

    Article  Google Scholar 

  • Elwalid, A., Jin, C., Low, S., & Widjaja, I. (2001). MATE: MPLS adaptive traffic engineering. In Proc. of IEEE INFOCOM (pp. 1300–1309).

    Google Scholar 

  • Ericsson, M., Resende, M., & Pardalos, P. (2002). A genetic algorithm for the weight setting problem in OSPF routing. Journal of Combinatorial Optimization, 6, 299–333.

    Article  Google Scholar 

  • Farago, A., Szentesi, A., & Szviatovszki, A. (2003). Inverse optimization in high-speed networks. Discrete Applied Mathematics, 129, 83–98.

    Article  Google Scholar 

  • Feldmann, A., & Rexford, J. (2001). IP network configuration for intradomain traffic engineering. IEEE Network, 15, 46–57.

    Article  Google Scholar 

  • Feldmann, A., Greenberg, A., Lund, C., Reingold, N., & Rexford, J. (2000). Netscope: traffic engineering for IP networks. IEEE Network, March/April, 11–19.

    Article  Google Scholar 

  • Ford, L. R., & Fulkerson, D. R. (1962). Flows in networks. Princeton: Princeton University Press.

    Google Scholar 

  • Fortuny, C. (2008). Estimation du trafic, planification et optimisation des ressources pour l’ingénierie des réseaux IP/MPLS. PhD thesis, Université de Toulouse III–Paul Sabatier, UFR Mathématiques, Informatique, Gestion.

  • Fortuny, C., Brun, O., & Garcia, J. M. (2005). Metric optimization in IP networks. In Proc. of 19th international teletraffic congress, Beijing, China, September 2005 (pp. 1225–1234).

    Google Scholar 

  • Fortz, B., & Thorup, M. (2000). Internet traffic engineering by optimizing OSPF weights. In Proc. 19th IEEE conf. on computer communications (INFOCOM) (pp. 519–528).

    Google Scholar 

  • Fortz, B., & Thorup, M. (2002). Optimizing OSPF/IS-IS weights in a changing world. IEEE Journal on Selected Areas in Communications, 20(4), 756–767.

    Article  Google Scholar 

  • Fortz, B., & Thorup, M. (2003). Robust optimization of OSPF/IS-IS weights. In W. Ben-Ameur & A. Petrowski (Eds.), Proc. INOC 2003 (pp. 225–230).

    Google Scholar 

  • Fortz, B., & Thorup, M. (2004). Increasing internet capacity using local search. Computational Optimization and Applications, 29(1), 13–48.

    Article  Google Scholar 

  • Fortz, B., & Ümit, H. (2011). Efficient techniques and tools for intra-domain traffic engineering. International Transactions in Operational Research, 18(3), 359–376.

    Article  Google Scholar 

  • Gajowniczek, O., Pióro, M., Szentesi, A., Harmatos, J., & Jüttner, A. (2000). Solving an OSPF routing problem with simulated allocation. In Proc. 1st Polish-German teletraffic symposium, Dresden, Germany (pp. 177–184).

    Google Scholar 

  • Hawkinson, J. (1996). RFC 1930—guidelines for creation, selection, and registration of an autonomous system (AS).

  • Holmberg, K., & Yuan, D. (2000). A Lagrangian heuristic based branch-and-bound approach for the capacitated network design problem. Operations Research, 48, 461–481.

    Article  Google Scholar 

  • Holmberg, K., & Yuan, D. (2004). Optimization of internet protocol network design and routing. Networks, 43(1), 39–53.

    Article  Google Scholar 

  • Inc CS (2000). Internetworking technologies handbook (3rd ed.). Indianapolis: Cisco Press.

    Google Scholar 

  • Jüttner, A., Szentesi, A., Harmatos, J., & Pióro, M. (2000). On solvability of an OSPF routing problem. In Proceedings 15th Nordic teletraffic seminar, Lund.

    Google Scholar 

  • Kodialam, M., & Lakshman, T. (2000). Minimum interference routing with applications to MPLS routing. In Proc. of IEEE INFOCOM (pp. 884–893).

    Google Scholar 

  • Leduc, G., Abrahamsson, H., Balon, S., Bessler, S., D’Arienzo, M., Delcourt, O., Domingo-Pascual, J., Cerav-Erbas, S., Gojmerac, I., Masip, X., Pescaph, A., Quoitin, B., Romano, S., Salvatori, E., Skivée, F., Tran, H., Uhlig, S., & Ümit, H. (2006). An open source traffic engineering toolbox. Computer Communications, 29(5), 593–610.

    Article  Google Scholar 

  • MATE C (2009). http://www.cariden.com/products/.

  • Mortier, R. (2002). Internet traffic engineering (Tech. Rep. 532). University of Cambridge.

  • Moy, J. (1998). RFC 2328—OSPF Version 2.

  • Mulyana, E., & Killat, U. (2002). An alternative genetic algorithm to optimize OSPF weights. In 15th ITC specialist seminar, Würzburg, Germany (pp. 186–192).

    Google Scholar 

  • Mulyana, E., & Killat, U. (2005). Optimizing IP networks for uncertain demands using outbound traffic constraints. In Proc. INOC 2005 (pp. 695–701).

    Google Scholar 

  • Parmar, A., Ahmed, S., & Sokol, J. (2006). An integer programming approach to the OSPF weight setting problem (Tech. Rep.). School of Industrial & Systems Engineering, Georgia Tech.

  • Pióro, M., & Medhi, D. (2004). Routing, flow, and capacity design in communication and computer networks. San Mateo: Morgan Kaufman.

    Google Scholar 

  • Pióro, M., Szentesi, A., Harmatos, J., & Jüttner, A. (2000). On OSPF related network optimization problems. In 8th IFIP workshop on performance modelling and evaluation of ATM & IP networks, Ilkley, UK (pp. 70/1–70/14).

    Google Scholar 

  • QoSDesign (2009). NEST: network engineering and simulation tool. http://www.qosdesign.com.

  • Ramalingam, G., & Reps, T. (1996). An incremental algorithm for a generalization of the shortest-path problem. Journal of Algorithms, 21(2), 267–305.

    Article  Google Scholar 

  • Smit, H., & Li, T. (2003). IS-IS extensions for traffic engineering (Tech. Rep.). Network Working Group, IETF.

  • Srivastava, S., Agrawal, G., Pióro, M., & Medhi, D. (2005). Determining link weight system under various objectives for OSPF networks using a Lagrangian relaxation-based approach. IEEE Transactions on Network & Service Management, 2(1), 9–18.

    Article  Google Scholar 

  • Tanenbaum, A. S. (2003). Computer networks (4th ed.). New York: Prentice Hall PTR.

    Google Scholar 

  • Tomaszevski, A., Pióro, M., Dzida, M., Mycek, M., & Zagozdzon, M. (2007). Valid inequalities for a shortest-path routing optimization problem. In Proc. INOC 2007.

    Google Scholar 

  • Tomaszewski, A., Pióro, M., Dzida, M., & Zagozdzon, M. (2005). Optimization of administrative weights in IP networks using the branch-and-cut approach. In Proc. INOC 2005 (Vol. 2, pp. 393–400).

    Google Scholar 

  • Wang, Y., Wang, Z., & Zhang, L. (2001). Internet traffic engineering without full mesh overlaying. In Proceedings of IEEE INFOCOM (pp. 565–571).

    Google Scholar 

  • Wang, H., Xie, H., Qiu, L., Yang, Y. R., Zhang, Y., & Greenberg, A. (2006). Cope: traffic engineering in dynamic networks. In SIGCOMM ’06: proceedings of the 2006 conference on applications, technologies, architectures, and protocols for computer communications (pp. 99–110). New York: ACM. http://doi.acm.org/10.1145/1159913.1159926.

    Chapter  Google Scholar 

  • Waxman, B. (1988). Routing of multipoint connections. IEEE Journal on Selected Areas in Communications, 6(9), 1617–1622.

    Article  Google Scholar 

  • Zhang, C. (2006). Comparison on objective functions of the unique shortest path problem. In Proceedings of the eighth INFORMS telecommunications conference, Dallas, Texas, USA.

    Google Scholar 

  • Zhang, C., & Rodosek, R. (2005). Modelling and constraint hardness characterisation of the unique-path OSPF weight setting problem. In Proceedings ICCS—5th international conference, Atlanta, GA, USA.

    Google Scholar 

  • Zhang, C., Liu, Y., Gong, W., Kurose, J., & Moll, R. (2005). On optimal routing with multiple traffic matrices. In Proc 24th IEEE conf. on computer communications (INFOCOM).

    Google Scholar 

Download references

Acknowledgements

This work has been partially supported by the Walloon Region (DGTRE) in the framework of the TOTEM Project, the Communauté française de Belgique—Actions de Recherche Concertées (ARC) and FRFC program “Groupe de Programmation Mathématique”.

Author information

Authors and Affiliations

  1. Industrial Engineering Department, Faculty of Engineering, TOBB, University of Economics and Technology, Ankara, Turkey

    Ayşegül Altın

  2. Département d’Informatique, Faculté des Sciences, Université Libre de Bruxelles, Brussels, Belgium

    Bernard Fortz

  3. AT&T Labs-Research, Florham Park, NJ, USA

    Mikkel Thorup

  4. Operations & Technology Management Center, Vlerick Leuven Gent Management School, Gent, Belgium

    Hakan Ümit

Authors
  1. Ayşegül Altın
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bernard Fortz
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mikkel Thorup
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Hakan Ümit
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Bernard Fortz.

Additional information

This is an updated version of the paper that appeared in 4OR, 7(4), 301–335 (2009).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Altın, A., Fortz, B., Thorup, M. et al. Intra-domain traffic engineering with shortest path routing protocols. Ann Oper Res 204, 65–95 (2013). https://doi.org/10.1007/s10479-012-1270-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-012-1270-7

Keywords

Search

Navigation