In this paper we survey a variant of the inverse shortest paths problem. Given is a network in which certain node-pairs require connections over specific predefined single paths. The aim is to find link weights such that the desired paths are uniquely induced by a shortest-path algorithm. Further we require that the link weights fit existing shortest-path based routing protocols. We give a motivation for this problem, discuss a number of its solvability aspects, and show how a feasible solution can be obtained from its linear relaxation. A network operator who wants to obtain a specific routing pattern by adjusting link weights, will find practical use of the solution to the considered problem.
[1]
Mikkel Thorup,et al.
Traffic engineering with traditional IP routing protocols
,
2002,
IEEE Commun. Mag..
[2]
Walid Ben-Ameur,et al.
Internet Routing and Related Topology Issues
,
2003,
SIAM J. Discret. Math..
[3]
Michal Pióro,et al.
On open shortest path first related network optimisation problems
,
2002,
Perform. Evaluation.
[4]
P. Toint,et al.
The inverse shortest paths problem with upper bounds on shortest paths costs
,
1997
.
[5]
Deep Medhi,et al.
Routing, flow, and capacity design in communication and computer networks
,
2004
.