On the complexity of equal shortest path routing

DOI10.1002/NET.21612MaRDI QIDQ4565765zbMATH OpenOpenAlexFDO

Authors F. Giroire, Stéphane Pérennes, 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

zbMATH Keywords

\textsc{ospf-ecmp} protocolapproximation algorithmsinverse shortest pathmaximum flowNP-hardroutingshortest path

Mathematics Subject Classification ID

Communication networks in operations research (90B18)

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

Cited in

(6)

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

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)