References
- Abraham I, Fiat A, Goldberg AV and Werneck RE (2010). Highway dimension, shortest paths, and provably efficient algorithms. In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA’10, pp. 782–793. Society for Industrial and Applied Mathematics.
- Ahuja RK and Orlin JB (2001). Inverse optimization. Operations Research49(5): 771–783.
- Ahuja RK and Orlin JB (2002). Combinatorial algorithms for inverse network flow problems. Networks40(4): 181–187.
- Ahuja RK, Magnanti TL, and Orlin JB (1993). Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Inc.: Englewood Cliffs, NJ.
- Altin A, Fortz B, Thorup M and Ümit H (2013). Intra-domain traffic engineering with shortest path routing protocols. Annals of Operations Research204(1): 65–95.
- Altın A, Belotti P and Pınar MÇ (2010). OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty. Optimization and Engineering11(3): 395–422.
- Amaldi E, Capone A, and Gianoli LG (2013). Energy-aware IP traffic engineering with shortest path routing. Computer Networks57(6): 1503–1517.
- Applegate D and Cohen E (2006). Making routing robust to changing traffic demands: Algorithms and evaluation. IEEE/ACM Transactions on Networking14(6): 1193–1206.
- Balon S, Skivée F and Leduc G (2006). How well do traffic engineering objective functions meet TE requirements? In: Boavida F, Plagemann T, Stiller B, Westphal C and Monteiro E (eds) NETWORKING 2006. Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems: 5th International IFIP-TC6 Networking Conference, Coimbra, Portugal, May 15-19, 2006. Proceedings, pp. 75–86. Springer: Berlin.
- Barnhart C, Hane CA and Vance PH (2000). Using branch-and-price-and-cut to solve origin-destination integer multicommodity flow problems. Operations Research48(2): 318–326.
- Bellman R (1958). On a routing problem. Quarterly of Applied Mathematics16(1): 87–90.
- Ben-Ameur W and Gourdin E (2003). Internet routing and related topology issues. SIAM Journal on Discrete Mathematics17(1): 18–49.
- Benders JF (1962). Partitioning procedures for solving mixed-variables programming problems. Numerische mathematik4(1): 238–252.
- Bertsekas D and Gallager R (1992). Data Networks. Prentice-Hall, Inc.: Upper Saddle River, NJ.
- Black U (2000). IP Routing Protocols: RIP, OSPF, BGP, PNNI and Cisco Routing Protocols. Prentice Hall PTR: Upper Saddle River, NJ.
- Bley A (2007). Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths. Networks50(1): 29–36.
- Bley A (2009). Approximability of unsplittable shortest path routing problems. Networks54(1): 23–46.
- Bley A and Koch T (2008). Integer programming approaches to access and backbone IP network planning. In: Modeling, Simulation and Optimization of Complex Processes, pp. 87–110. Springer: Berlin.
- Bley A, Fortz B, Gourdin E, Holmberg K, Klopfenstein O, Pióro M, Tomaszewski A and Ümit H (2010). Optimization of OSPF routing in IP networks. In: Koster A and Muñoz X (eds) Graphs and Algorithms in Communication Networks, Texts in Theoretical Computer Science. An EATCS Series, pp. 199–240. Springer: Berlin.
- Buriol LS, Resende MGC, Ribeiro CC and Thorup M (2005). A hybrid genetic algorithm for the weight setting problem in OSPF/IS-IS routing. Networks46(1): 36–56.
- Buriol LS, Resende MGC and Thorup M (2008). Speeding up dynamic shortest-path algorithms. INFORMS Journal on Computing20(2): 191–204.
- Burton D and Toint PL (1992). On an instance of the inverse shortest paths problem. Mathematical Programming53(1): 45–61.
- Burton D and Toint PL (1994). On the use of an inverse shortest paths algorithm for recovering linearly correlated costs. Mathematical Programming63(1): 1–22.
- Cianfrani A, Eramo V, Listanti M, Polverini M and Vasilakos AV (2012). An OSPF-integrated routing strategy for QoS-aware energy saving in IP backbone networks. IEEE Transactions on Network and Service Management9(3): 254–267.
- Cisco Systems Inc. (2000). Internetworking Technologies Handbook, 3rd edn. Cisco Press: Indianapolis, IN.
- Dijkstra EW (1959). A note on two problems in connexion with graphs. Numerische Mathematik1(1): 269–271.
- Dinitz Y, Garg N and Goemans XM (1999). On the single-source unsplittable flow problem. Combinatorica19(1): 17–41.
- Ericsson M, Resende MGC and Pardalos PM (2002). A genetic algorithm for the weight setting problem in OSPF routing. Journal of Combinatorial Optimization6(3): 299–333.
- Faragó A, Szentesi A and Szviatovszki B (2003). Inverse optimization in high-speed networks. Discrete Applied Mathematics129(1): 83–98.
- Feldmann A, Greenberg A, Lund C, Reingold N, Rexford J and True F (2001). Deriving traffic demands for operational IP networks: Methodology and experience. IEEE/ACM Transactions on Networking9(3): 265–280.
- Ford DR and Fulkerson DR (2010). Flows in Networks. Princeton University Press: Princeton, NJ.
- Fortz B and Thorup M (2000). Internet traffic engineering by optimizing OSPF weights. In: INFOCOM 2000. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE, Vol. 2, pp. 519–528.
- Fortz B and Thorup M (2004). Increasing internet capacity using local search. Computational Optimization and Applications29(1): 13–48.
- Fortz B and Ümit H (2011). Efficient techniques and tools for intra-domain traffic engineering. International Transactions in Operational Research18(3): 359–376.
- Giroire F, Pérennes S and Tahiri I (2015). On the complexity of equal shortest path routing. Networks65(4): 344–352.
- Hock D, Hartmann M, Menth M and Schwartz C (2010). Optimizing unique shortest paths for resilient routing and fast reroute in IP-based networks. In: 2010 IEEE Network Operations and Management Symposium (NOMS), pp. 309–316.
- Holmberg K and Yuan D (2000). A Lagrangian heuristic based branch-and-bound approach for the capacitated network design problem. Operations Research48(3): 461–481.
- Holmberg K and Yuan D (2004). Optimization of internet protocol network design and routing. Networks43(1): 39–53.
- Kolliopoulos S and Stein C (2011). Approximation algorithms for single-source unsplittable flow. SIAM Journal on Computing31(3): 919–946.
- Lin FYS and Wang JL (1993). Minimax open shortest path first routing algorithms in networks supporting the SMDS service. In: Proceedings of IEEE International Conference on Communications, Vol. 2, pp. 666–670.
- Moy JT (1998). OSPF: Anatomy of an Internet Routing Protocol. Addison-Wesley Longman Publishing Co., Inc.: Boston, MA.
- Mulyana E and Killat U (2002). An alternative genetic algorithm to optimize OSPF weights. In: Proceedings of Internet Traffic Engineering and Traffic Management, 15th ITC Specialist Seminar.
- Park K, Kang S and Park S (1996). An integer programming approach to the bandwidth packing problem. Management Science42(9): 1277–1291.
- Pióro M, Szentesi Á, Harmatos J, Jüttner A, Gajowniczek P and Kozdrowski S (2002). On open shortest path first related network optimisation problems. Performance Evaluation48(1–4): 201–223.
- Pióro M and Medhi D (2004). Routing, Flow, and Capacity Design in Communication and Computer Networks. Morgan Kaufmann Publishers Inc.: San Francisco, CA.
- Ramakrishnan KG and Rodrigues MA (2001). Optimal routing in shortest-path data networks. Bell Labs Technical Journal6(1): 117–138.
- Ramalingam G and Reps T (1996). An incremental algorithm for a generalization of the shortest-path problem. Journal of Algorithms21(2): 267–305.
- Skutella M (2002). Approximating the single source unsplittable min-cost flow problem. Mathematical Programming91(3): 493–514.
- Srivastava S, Agrawal G, Pioro M and Medhi D (2005). Determining link weight system under various objectives for OSPF networks using a Lagrangian relaxation-based approach. IEEE Transactions on Network and Service Management2(1): 9–18.
- Tanenbaum AS and Wetherall D (2011). Computer Networks. Pearson Prentice: Boston, MA.
- Thomas TM (2003). OSPF Network Design Solutions. Cisco Press: Indianapolis, IN.
- Wang H, Xie H, Qiu L, Yang YR, Zhang Y and Greenberg A (2006). COPE: Traffic engineering in dynamic networks. SIGCOMM Computer Communication Review36(4): 99–110.
- Wang Y, Wang Z and Zhang L (2001). Internet traffic engineering without full mesh overlaying. In: INFOCOM 2001. Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE, Vol. 1, pp. 565–571.
- Xu S and Zhang J (1995). An inverse problem of the weighted shortest path problem. Japan Journal of Industrial and Applied Mathematics12(1): 47–59.
- Zhan EB and Noon CE (1998). Shortest path algorithms: An evaluation using real road networks. Transportation Science32(1): 65–73.
- Zhang C (2006). Comparison on objective functions of the unique shortest path routing problem. In: Proceedings of the Eighth INFORMS Telecommunications Conference, Dallas, Texas, March 30 April 2.
- Zhang C and Rodošek R (2005a). Modelling and constraint hardness characterisation of the unique-path OSPF weight setting problem. In: Lecture Notes in Computer Science, Vol. 3514, pp. 804–811. Springer: Berlin.
- Zhang C and Rodošek R (2005b). Two mathematically equivalent models of the unique-path OSPF weight setting problem. In: Lecture Notes in Computer Science, Vol. 3421, pp. 318–326. Springer: Berlin.
- Zhang J and Liu Z (1996). Calculating some inverse linear programming problems. Journal of Computational and Applied Mathematics72(2): 261–273.