Optimization of Internet Protocol network design and routing

Authors:
Kaj Holmberg;Yves Carbonneaux
Affiliations:
Department of Mathematics, Linköping Institute of Technology, SE-581 83 Linköping, Sweden;Department of Science and Technology, Linköping Institute of Technology, SE-601 74 Norrköping, Sweden
Venue:
Networks
Year:
2004

Citing 0
Cited 5

Enforcing path uniqueness in internet routing

Proceedings of the 2006 ACM symposium on Applied computing
An Integer Programming Algorithm for Routing Optimization in IP Networks

ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Optimal link weights for IP-based networks supporting hose-model VPNs

IEEE/ACM Transactions on Networking (TON)
Link weight assignment and loop-free routing table update for link state routing protocols in energy-aware internet

Future Generation Computer Systems
Designing an IP Link Topology for a Metro Area Backbone Network

International Journal of Interdisciplinary Telecommunications and Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider network design and routing for Internet Protocol (IP) traffic. The design problem concerns capacity dimensioning of communication links, where the design cost consists of fixed charges and linear capacity expansion costs. The optimization problem also concerns determining the amount of traffic demand to be carried by the network and the metric used by a shortest path routing protocol. We present a novel linear mixed-integer mathematical formulation and two heuristic solution procedures. The first heuristic uses mixed-integer programming to generate a sequence of routing solutions. The second solution approach is a simulated annealing meta heuristic. Computational experiments for synthesized and real-life networks show that high-quality solutions can be obtained by both approaches. © 2003 Wiley Periodicals, Inc.