SP-graphs for IP/OSPF network design

This page contains data for Shortest Path graphs (SP-graphs) for IP/OSPF network design, as described in the following articles.

Peter Broström and Kaj Holmberg. Valid Cycles: A Source of Infeasibility in Open Shortest Path First Routing Routing. Networks 52: 206-215, 2008.
Peter Broström and Kaj Holmberg. Compatible Weights and Valid Cycles in Non-spanning OSPF Routing Patterns. Algorithmic Operations Research 4: 19-35, 2009.
Peter Broström and Kaj Holmberg. Design of OSPF Networks using Subpath Consistent Routing Patterns. Telecommunication Systems 41: 293-309, 2009.

For more detailed information, contact Kaj Holmberg.

Any use of these problem data should be accompanied with a reference to (the most relevant of) the articles above. You might also want to send me an email.

We have used Vineopt in the process of generating the instances. Some of the instances are based on data from SNDlib, howvere much simplified.

Download all data in a zip-file.

Kaj Holmberg, email: kaj.holmberg@liu.se, homepage: http://www.mai.liu.se/~kajho48/.
Division of Optimization, Department of Mathematics, Linköping Institute of Technology, SE-581 83 Linköping, SWEDEN.