Routing and Capacity Optimization for IP Networks

DOI10.1007/978-3-540-77903-2_2zbMath1209.68043MaRDI QIDQ5391869

Andreas Bley

Publication date: 7 April 2011

Published in: Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL: http://depositonce.tu-berlin.de/handle/11303/1885

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

68M12: Network protocols

Related Items

Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty, Routing and Capacity Optimization for IP Networks, Intra-domain traffic engineering with shortest path routing protocols, Intra-domain traffic engineering with shortest path routing protocols, Clique-based facets for the precedence constrained knapsack problem, An integer programming algorithm for routing optimization in IP networks, A strengthened formulation and cutting planes for the open pit mine production scheduling problem, Polynomial-time algorithms for special cases of the maximum confluent flow problem, Approximability of unsplittable shortest path routing problems, Optimization of OSPF Routing in IP Networks, An Integer Programming Algorithm for Routing Optimization in IP Networks

Cites Work

• Unnamed Item
• Increasing internet capacity using local search
• A genetic algorithm for the weight setting problem in OSPF routing
• 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
• A hybrid genetic algorithm for the weight setting problem in OSPF/IS‐IS routing
• Routing and Capacity Optimization for IP Networks