Paper Info
Title
Finding a simple path with multiple must-include nodes
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 in reasonable time.
Year
DOI
Venue
2009
10.1109/MASCOT.2009.5366808
London
Keywords
Field
DocType
computational complexity,telecommunication network routing,MANET,NP-complete,OSPF,base stations,divide-and-conquer approach,gateway functions,heuristic algorithm,multiple must-include nodes,near optimal path,optical wavelength converter,simple path finding,telecom monitoring provision
Average path length,Path (graph theory),Shortest path problem,Computer science,Heuristic (computer science),Divide and conquer algorithms,Longest path problem,Fast path,Distributed computing,Computational complexity theory
Conference
ISSN
ISBN
Citations 
1526-7539 E-ISBN : 978-1-4244-4928-6
978-1-4244-4928-6
3
PageRank 
References 
Authors
0.49
3
9
Name
Order
Citations
PageRank
Hars Vardhan1263.84
Shreejith Billenahalli251.19
Wan-Jun Huang3235.86
Miguel Razo4198.27
Arularasi Sivasankaran592.36
Limin Tang692.36
Paolo Monti78818.22
Marco Tacca815028.05
A. Fumagalli930944.27