Change search
ReferencesLink to record
Permanent link

Direct link
Finding a simple path with multiple must-include nodes
The University of Texas at Dallas.
The University of Texas at Dallas.
The University of Texas at Dallas.
The University of Texas at Dallas.
Show others and affiliations
2009 (English)In: 2009 IEEE INTERNATIONAL SYMPOSIUM ON MODELING, ANALYSIS & SIMULATION OF COMPUTER AND TELECOMMUNICATION SYSTEMS (MASCOTS) / [ed] Bradley, JT; Conrad, JM; Field, AJ; Harder, U; Knottenbelt, WJ; Riley, GF, 2009, 607-609 p.Conference paper (Refereed)
Abstract [en]

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.

Place, publisher, year, edition, pages
2009. 607-609 p.
Keyword [en]
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;computational complexity;telecommunication network routing;
National Category
URN: urn:nbn:se:kth:diva-79034DOI: 10.1109/MASCOT.2009.5366808ISI: 000275140200066ScopusID: 2-s2.0-76349101143ISBN: 978-142444926-2OAI: diva2:494700
17th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems. Imperial Coll London, S Kensington Campus, London, ENGLAND. SEP 21-23, 2009

QC 20150706

Available from: 2012-02-08 Created: 2012-02-08 Last updated: 2015-07-06Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Monti, Paolo
By organisation
Photonics (Closed 20120101)

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 470 hits
ReferencesLink to record
Permanent link

Direct link