Increasing internet capacity using local search
DOI10.1023/B:COAP.0000039487.35027.02zbMATH Open1069.90024MaRDI QIDQ702469FDOQ702469
Authors: Bernard Fortz, Mikkel Thorup 
Publication date: 17 January 2005
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Recommendations
Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Circuits, networks (94C99) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35) Traffic problems in operations research (90B20)
Cited In (45)
- A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion
- Multi-hour design of survivable classical IP networks
- Biased random-key genetic algorithms with applications in telecommunications
- Survivable IP network design with OSPF routing
- Title not available (Why is that?)
- On the minimization of traffic congestion in road networks with tolls
- An integer programming algorithm for routing optimization in IP networks
- Linear programming models for traffic engineering in 100\% survivable networks under combined IS-IS/OSPF and MPLS-TE
- Internet routing between autonomous systems: fast algorithms for path trading
- An Integer Programming Algorithm for Routing Optimization in IP Networks
- Priority-Based Genetic Algorithm for Shortest Path Routing Problem in OSPF
- Applications of meta-heuristics to traffic engineering in IP networks
- Efficient techniques and tools for intra-domain traffic engineering
- Enhanced-robustness Dijkstra algorithm for control of routing in the IP-networks
- Telecommunications network design: Technology impacts and future directions
- Models for the piecewise linear unsplittable multicommodity flow problems
- On the complexity of equal shortest path routing
- Intra-domain traffic engineering with shortest path routing protocols
- Route optimization in IP networks
- Competitive online multicommodity routing
- Approximability of unsplittable shortest path routing problems
- Edge-based traffic engineering for OSPF networks
- On the Internet routing protocol Enhanced Interior Gateway Routing Protocol: is it optimal?
- Optimally routing data in fiber-optic networks with existing flow
- Design of mixed MPLS/OSPF routing in IP networks
- Optimization of OSPF routing in IP networks
- Avoiding routing loops on the internet
- Constrained rerouting in networks: an integer programming formulation
- Impact of routing parameters on route diversity and path inflation
- A genetic algorithm for the weight setting problem in OSPF routing
- Routing and capacity optimization for IP networks
- Title not available (Why is that?)
- Resilient capacity-aware routing
- A practicable robust counterpart formulation for decomposable functions: a network congestion case study
- 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
- On open shortest path first related network optimisation problems
- Valid cycles: A source of infeasibility in open shortest path first routing
- Computational Science – ICCS 2005
- OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty
- Intra-domain traffic engineering with shortest path routing protocols
- Compatible weights and valid cycles in non-spanning OSPF routing patterns
- Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty
- Learned load balancing
- Better alternatives to OSPF routing
This page was built for publication: Increasing internet capacity using local search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q702469)
