Logarithmic inapproximability results for the minimum shortest path routing conflict problem

not available

shortest path routing, computational complexity

Nowadays most data networks use shortest path protocols such as OSPF or IS-IS to route traffic. Given administrative routing lengths for the links of a network, all data packets are sent along shortest paths with respect to these lengths from their source to their destination. One of the most fundamental problems in planning shortest path networks is to decide whether a given set S of routing paths forms a valid routing and, if this is not the case, to find a small subset Rsubseteq S of paths that cannot occur together in any valid routing. In this paper we show that it is NP-hard to approximate the minimal size or the minimal weight of a shortest path conflict Rsubseteq S by a factor less than clog |S| for some c>0.

Download as [PDF]