Efficient techniques and tools for intra-domain traffic engineering

DOI10.1111/j.1475-3995.2010.00769.xzbMath1219.90175OpenAlexW2023374592MaRDI QIDQ3087851

Hakan Ümit, Bernard Fortz

Publication date: 17 August 2011

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/j.1475-3995.2010.00769.x

zbMATH Keywords

column generationOSPFshortest path routingopen sourceinternet traffic engineeringIGP

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Traffic problems in operations research (90B20)

Related Items (3)

Telecommunications network design: Technology impacts and future directions ⋮ Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty ⋮ Intra-domain traffic engineering with shortest path routing protocols

Cites Work

• A note on two problems in connexion with graphs
• A genetic algorithm for the weight setting problem in OSPF routing
• Internet Routing and Related Topology Issues
• On open shortest path first related network optimisation problems
• An Incremental Algorithm for a Generalization of the Shortest-Path Problem
• A hybrid genetic algorithm for the weight setting problem in OSPF/IS‐IS routing
• Intra-domain traffic engineering with shortest path routing protocols

This page was built for publication: Efficient techniques and tools for intra-domain traffic engineering