Shortest node-disjoint path using dual-network topology in optical switched networks

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)
15 Downloads (Pure)


This paper presents a new method for finding shortest node-disjoint paths in optical-switched networks with no wavelength conversion. The proposed method is based on a modified version of Dijkstra algorithm that works on an expanded so-called dual-network topology with n×n- nodes and 2×m×n links, where n is the number of nodes and m is the number of links in the original network. Despite the larger network size, the execution time of the algorithm is in polynomial order (mn + n 2 log n). Considering that the problem is NP-complete, the presented algorithm takes much less time than using ILP, which takes exponential time. Yet, it is able to find all available disjoint paths obtainable by ILP.

Original languageEnglish
Pages (from-to)365-372
Number of pages9
JournalInternational Arab Journal of Information Technology
Issue number4
Publication statusPublished - 01 Jul 2013


Dive into the research topics of 'Shortest node-disjoint path using dual-network topology in optical switched networks'. Together they form a unique fingerprint.

Cite this