Pages that link to "Item:Q702469"
From MaRDI portal
The following pages link to Increasing internet capacity using local search (Q702469):
Displaying 36 items.
- A flow allocation strategy for routing over multiple flow classes with an application to air cargo terminals (Q337099) (← links)
- OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty (Q374694) (← links)
- On the minimization of traffic congestion in road networks with tolls (Q513622) (← links)
- Linear programming models for traffic engineering in 100\% survivable networks under combined IS-IS/OSPF and MPLS-TE (Q547138) (← links)
- An integer programming algorithm for routing optimization in IP networks (Q547285) (← links)
- Impact of routing parameters on route diversity and path inflation (Q605638) (← links)
- Better alternatives to OSPF routing (Q818835) (← links)
- Competitive online multicommodity routing (Q839644) (← links)
- Enhanced-robustness Dijkstra algorithm for control of routing in the IP-networks (Q1002872) (← links)
- A genetic algorithm for the weight setting problem in OSPF routing (Q1610662) (← links)
- Optimal design of switched Ethernet networks implementing the multiple spanning tree protocol (Q1686055) (← links)
- Models for the piecewise linear unsplittable multicommodity flow problems (Q1753554) (← links)
- Avoiding routing loops on the internet (Q1762992) (← links)
- Biased random-key genetic algorithms with applications in telecommunications (Q1935883) (← links)
- Resilient capacity-aware routing (Q2044217) (← links)
- Internet routing between autonomous systems: fast algorithms for path trading (Q2341707) (← links)
- Edge-based traffic engineering for OSPF networks (Q2484983) (← links)
- Compatible weights and valid cycles in non-spanning OSPF routing patterns (Q2867358) (← links)
- Optimally routing data in fiber-optic networks with existing flow (Q2918412) (← links)
- Approximability of unsplittable shortest path routing problems (Q3057101) (← links)
- Applications of meta-heuristics to traffic engineering in IP networks (Q3087845) (← links)
- Efficient techniques and tools for intra-domain traffic engineering (Q3087851) (← links)
- A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion (Q3087853) (← links)
- Optimization of OSPF Routing in IP Networks (Q3404471) (← links)
- Survivable IP network design with OSPF routing (Q3418122) (← links)
- An Integer Programming Algorithm for Routing Optimization in IP Networks (Q3541087) (← links)
- Valid cycles: A source of infeasibility in open shortest path first routing (Q3548721) (← links)
- On the complexity of equal shortest path routing (Q4565765) (← links)
- Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty (Q4648697) (← links)
- A Practicable Robust Counterpart Formulation for Decomposable Functions: A Network Congestion Case Study (Q4969341) (← links)
- Routing and Capacity Optimization for IP Networks (Q5391869) (← links)
- On the Internet routing protocol Enhanced Interior Gateway Routing Protocol: is it optimal? (Q5449875) (← links)
- Intra-domain traffic engineering with shortest path routing protocols (Q5900973) (← links)
- Intra-domain traffic engineering with shortest path routing protocols (Q5919993) (← links)
- Telecommunications network design: Technology impacts and future directions (Q6087074) (← links)
- Learned load balancing (Q6549675) (← links)