Increasing internet capacity using local search
From MaRDI portal
Publication:702469
DOI10.1023/B:COAP.0000039487.35027.02zbMath1069.90024MaRDI QIDQ702469
Publication date: 17 January 2005
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Circuits, networks (94C99) Traffic problems in operations research (90B20) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35)
Related Items
Competitive online multicommodity routing ⋮ A flow allocation strategy for routing over multiple flow classes with an application to air cargo terminals ⋮ Optimal design of switched Ethernet networks implementing the multiple spanning tree protocol ⋮ Biased random-key genetic algorithms with applications in telecommunications ⋮ Telecommunications network design: Technology impacts and future directions ⋮ An Integer Programming Algorithm for Routing Optimization in IP Networks ⋮ Routing and Capacity Optimization for IP Networks ⋮ On the minimization of traffic congestion in road networks with tolls ⋮ Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty ⋮ Intra-domain traffic engineering with shortest path routing protocols ⋮ Models for the piecewise linear unsplittable multicommodity flow problems ⋮ Linear programming models for traffic engineering in 100\% survivable networks under combined IS-IS/OSPF and MPLS-TE ⋮ An integer programming algorithm for routing optimization in IP networks ⋮ Intra-domain traffic engineering with shortest path routing protocols ⋮ Approximability of unsplittable shortest path routing problems ⋮ Resilient capacity-aware routing ⋮ A Practicable Robust Counterpart Formulation for Decomposable Functions: A Network Congestion Case Study ⋮ Applications of meta-heuristics to traffic engineering in IP networks ⋮ A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion ⋮ Optimization of OSPF Routing in IP Networks
