Routing and Capacity Optimization for IP Networks
From MaRDI portal
Publication:5391869
DOI10.1007/978-3-540-77903-2_2zbMath1209.68043OpenAlexW2132027267MaRDI QIDQ5391869
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
Related Items (12)
Clique-based facets for the precedence constrained knapsack problem ⋮ Polynomial-time algorithms for special cases of the maximum confluent flow problem ⋮ An Integer Programming Algorithm for Routing Optimization in IP Networks ⋮ Routing and Capacity Optimization for IP Networks ⋮ Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty ⋮ Intra-domain traffic engineering with shortest path routing protocols ⋮ An integer programming algorithm for routing optimization in IP networks ⋮ Intra-domain traffic engineering with shortest path routing protocols ⋮ A strengthened formulation and cutting planes for the open pit mine production scheduling problem ⋮ Approximability of unsplittable shortest path routing problems ⋮ Optimization of OSPF Routing in IP Networks ⋮ Non-approximability and Polylogarithmic Approximations of the Single-Sink Unsplittable and Confluent Dynamic Flow Problems
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
This page was built for publication: Routing and Capacity Optimization for IP Networks
