Abstract-This paper presents an algorithm to find a simple path in the given network with multiple must-include nodes in the path. The problem of finding a path with must-include node(s) can be easily found in some special cases. However, in general, including multiple nodes in the simple path has been shown to be NP-Complete. This problem may arise in network areas such as forcing the route to go through particular nodes, which have wavelength converter (optical), have monitoring provision (telecom), have gateway functions (in OSPF) or are base stations (in MANET). In this paper, a heuristic algorithm is described that follows divide and conquer approach, by dividing the problem in two subproblems. It is shown that the algorithm does not grow exponentially in this application and initial re-ordering of the given sequence of must-include nodes can improve the result. The experimental results demonstrate that the algorithm successfully computes near optimal path in reasonable time.
Restricting a path to be a simple path with multiple must-stop nodes, without any order requirements, is NP-Complete and in REF , a heuristic is proposed for that.
Finding a simple path with multiple must-include nodes
2009 IEEE International Symposium on Modeling, Analysis & Simulation of Computer and Telecommunication Systems
2009 IEEE International Symposium on Modeling, Analysis & Simulation of Computer and Telecommunication Systems
Computer Science