Article ID: | iaor20071856 |
Country: | Germany |
Volume: | 147 |
Issue: | 1 |
Start Page Number: | 235 |
End Page Number: | 253 |
Publication Date: | Oct 2006 |
Journal: | Annals of Operations Research |
Authors: | Holmberg Kaj, Brostrm Peter |
Keywords: | networks: path, programming: multiple criteria, internet |
Modern communication networks often use Internet Protocol routing and the intra-domain protocol OSPF (Open Shortest Path First). The routers in such a network calculate the shortest path to each destination and send the traffic on these paths, using load balancing. The issue of survivability, i.e. the question of how much traffic the network will be able to accommodate if components fail, is increasingly important. We consider the problem of designing a survivable IP network, which also requires determining the routing of the traffic. This is done by choosing the weights used for the shortest path calculations.