Linear programming models for traffic engineering in 100\% survivable networks under combined IS-IS/OSPF and MPLS-TE
From MaRDI portal
Publication:547138
DOI10.1016/j.cor.2011.02.019zbMath1215.90018OpenAlexW1974412263WikidataQ118165470 ScholiaQ118165470MaRDI QIDQ547138
D. Cherubini, C. Murgia, Ana Cristina Mereu, Antonio Frangioni, Paola Zuddas, Alessandra Fanni, Maria Grazia Scutellà
Publication date: 30 June 2011
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2011.02.019
Programming involving graphs or networks (90C35) Communication networks in operations research (90B18)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Increasing internet capacity using local search
- Routing of uncertain traffic demands
- On improving optimal oblivious routing
- Optimal oblivious routing under linear and ellipsoidal uncertainty
- Multicommodity network flows: The impact of formulation on decomposition
- Robust discrete optimization and network flows
- A genetic algorithm for the weight setting problem in OSPF routing
- Simple bounds and greedy algorithms for decomposing a flow into a minimal set of paths
- Survivable IP network design with OSPF routing
- Hardness of robust network design
- On general routing problems
- Designing Least-Cost Nonblocking Broadband Networks
- A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems
- On open shortest path first related network optimisation problems
- Provisioning a virtual private network
- A hybrid genetic algorithm for the weight setting problem in OSPF/IS‐IS routing
- Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks
This page was built for publication: Linear programming models for traffic engineering in 100\% survivable networks under combined IS-IS/OSPF and MPLS-TE
