Compatible weights and valid cycles in non-spanning OSPF routing patterns

zbMATH Open1277.90023MaRDI QIDQ2867358FDOQ2867358

Authors: Peter Broström, Kaj Holmberg 

Publication date: 11 December 2013

Published in: Algorithmic Operations Research (Search for Journal in Brave)

Full work available at URL: http://journals.hil.unb.ca/index.php/AOR/article/view/4175

Recommendations

• Valid cycles: A source of infeasibility in open shortest path first routing
• On the extremal structure of an OSPF related cone
• On open shortest path first related network optimisation problems
• Optimization of OSPF routing in IP networks
• Increasing internet capacity using local search

zbMATH Keywords

routingOSPFtelecommunicationvalid cyclecompatible weightsInternet Protocol

Mathematics Subject Classification ID

Applications of graph theory (05C90) Deterministic network models in operations research (90B10) Extremal problems in graph theory (05C35) Communication networks in operations research (90B18)

Cited In (3)

• Approximability of unsplittable shortest path routing problems
• Optimization of OSPF routing in IP networks
• Valid cycles: A source of infeasibility in open shortest path first routing

This page was built for publication: Compatible weights and valid cycles in non-spanning OSPF routing patterns

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