An Integer Programming Algorithm for Routing Optimization in IP Networks

DOI10.1007/978-3-540-87744-8_17zbMath1158.68309MaRDI QIDQ3541087

Andreas Bley

Publication date: 25 November 2008

Published in: Algorithms - ESA 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-87744-8_17

zbMATH Keywords

integer programming; shortest path routing

Mathematics Subject Classification ID

90C10: Integer programming

68M10: Network design and communication in computer systems

90C59: Approximation methods and heuristics in mathematical programming

68M12: Network protocols

Related Items

Approximability of unsplittable shortest path routing problems, Optimization of OSPF Routing in IP Networks

Cites Work

• Unnamed Item
• Unnamed Item
• Increasing internet capacity using local search
• A genetic algorithm for the weight setting problem in OSPF routing
• Approximability of unsplittable shortest path routing problems
• Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths
• On the Approximability of the Minimum Congestion Unsplittable Shortest Path Routing Problem
• Internet Routing and Related Topology Issues
• Optimization of Internet Protocol network design and routing
• On open shortest path first related network optimisation problems
• A hybrid genetic algorithm for the weight setting problem in OSPF/IS‐IS routing
• Routing and Capacity Optimization for IP Networks