Valid cycles: A source of infeasibility in open shortest path first routing

DOI10.1002/net.20232zbMath1154.94493WikidataQ115150496 ScholiaQ115150496MaRDI QIDQ3548721

Kaj Holmberg, Peter Broström

Publication date: 17 December 2008

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20232

zbMATH Keywords

routing; telecommunication networks; OSPF; compatible weights; Internet Protocol

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

90B18: Communication networks in operations research

05C38: Paths and cycles

94C99: Circuits, networks

Related Items

Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty, Intra-domain traffic engineering with shortest path routing protocols, Intra-domain traffic engineering with shortest path routing protocols, An integer programming algorithm for routing optimization in IP networks, Optimization of OSPF Routing in IP Networks

Uses Software

• SNDlib

Cites Work

• Unnamed Item
• Unnamed Item
• On the extremal structure of an OSPF related cone
• On an instance of the inverse shortest paths problem
• Inverse combinatorial optimization: a survey on problems, methods, and results
• Inverse problems of matroid intersection
• Finding a Useful Subset of Constraints for Analysis in an Infeasible Linear Program
• Internet Routing and Related Topology Issues
• Optimization of Internet Protocol network design and routing