Pages that link to "Item:Q1039914"
From MaRDI portal
The following pages link to Optimal oblivious routing under linear and ellipsoidal uncertainty (Q1039914):
Displaying 11 items.
- OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty (Q374694) (← links)
- Linear programming models for traffic engineering in 100\% survivable networks under combined IS-IS/OSPF and MPLS-TE (Q547138) (← links)
- Dynamic vs. oblivious routing in network design (Q634684) (← links)
- Routing of uncertain traffic demands (Q833385) (← links)
- On improving optimal oblivious routing (Q833579) (← links)
- Robust multiobjective optimization with application to Internet routing (Q1730555) (← links)
- Optimal routing for minimizing the maximal link congestion (Q2861545) (← links)
- Applications of meta-heuristics to traffic engineering in IP networks (Q3087845) (← links)
- Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty (Q4648697) (← links)
- Intra-domain traffic engineering with shortest path routing protocols (Q5900973) (← links)
- Intra-domain traffic engineering with shortest path routing protocols (Q5919993) (← links)