Design of IP/OSPF Networks Using a Lagrangean Heuristic on an In-graph Based Model
2005 (English)In: Proceedings of the International Network Optimization Conference, INOC 2005 / [ed] L. Gouveia and C. Mourao, Lisbon, Portugal: University of Lisbon , 2005, 702- p.Conference paper (Refereed)
This paper address the problem of designing IP networks where traffic is distributed in accordance with the OSPF protocol. Routers use link weights for determining how traffic is distributed. All shortest paths between pairs of routers are used and the traffic is evenly divided when several paths are shortest. We formulate a new model for the design of IP networks with OSPF and ECM distribution where weights are implicitly included. Necessary constraints for representing the shortest paths obtained from link weights by in-graphs are described. A Lagrangean heuristic is developed for verifying the usefulness of the model. Numerical experiments on test problems shows that acceptable gaps are obtained in reasonable time.
Place, publisher, year, edition, pages
Lisbon, Portugal: University of Lisbon , 2005. 702- p.
Internet Protocol, OSPF, network design, in-graph
IdentifiersURN: urn:nbn:se:liu:diva-30654Local ID: 16250OAI: oai:DiVA.org:liu-30654DiVA: diva2:251477
INOC 2005: Lisbon, Portugal, March 20-23, 2005