| Article ID: | iaor20112708 |
| Volume: | 60 |
| Issue: | 1 |
| Start Page Number: | 21 |
| End Page Number: | 45 |
| Publication Date: | May 2011 |
| Journal: | Algorithmica |
| Authors: | Bley Andreas |
| Keywords: | networks: path, programming: integer |
Most data networks nowadays use shortest path protocols to route the traffic. Given administrative routing lengths for the links of the network, all data packets are sent along shortest paths with respect to these lengths from their source to their destination. In this paper, we present an integer programming algorithm for the minimum congestion unsplittable shortest path routing problem, which arises in the operational planning of such networks. Given a capacitated directed graph and a set of communication demands, the goal is to find routing lengths that define a unique shortest path for each demand and minimize the maximum congestion over all links in the resulting routing. We illustrate the general decomposition approach our algorithm is based on, present the integer and linear programming models used to solve the master and the client problem, and discuss the most important implementational aspects. Finally, we report computational results for various benchmark problems, which demonstrate the efficiency of our algorithm.