On the complexity of equal shortest path routing

DOI10.1002/NET.21612zbMATH Open1390.90162OpenAlexW1997440971MaRDI QIDQ4565765FDOQ4565765

Stéphane Pérennes, F. Giroire, Issam Tahiri

Publication date: 13 June 2018

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01218473/file/ospf-journal.pdf

Recommendations

• Increasing internet capacity using local search
• On open shortest path first related network optimisation problems
• Optimization of OSPF routing in IP networks
• OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty
• Valid cycles: A source of infeasibility in open shortest path first routing

zbMATH Keywords

approximation algorithmsshortest pathmaximum flowNP-hardrouting\textsc{ospf-ecmp} protocolinverse shortest path

Mathematics Subject Classification ID

Communication networks in operations research (90B18)

Cited In (6)

• The equity constrained shortest path problem
• An enhanced Benders decomposition method for unique shortest path routing
• On the complexity of the shortest-path broadcast problem
• On the equivalence between some shortest path algorithms
• The complexity of routing with few collisions
• Traffic distribution over equal-cost-multi-paths

This page was built for publication: On the complexity of equal shortest path routing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4565765)