![](/images/graphics-bg.png)
Shortest node-disjoint path using dual-network topology in optical switched networks
Author
Source
The International Arab Journal of Information Technology
Issue
Vol. 10, Issue 4 (31 Jul. 2013)9 p.
Publisher
Publication Date
2013-07-31
Country of Publication
Jordan
No. of Pages
9
Main Subjects
Telecommunications Engineering
Topics
Abstract EN
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 +n2 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.
American Psychological Association (APA)
Dahshan, Mustafa. 2013. Shortest node-disjoint path using dual-network topology in optical switched networks. The International Arab Journal of Information Technology،Vol. 10, no. 4.
https://search.emarefa.net/detail/BIM-311885
Modern Language Association (MLA)
Dahshan, Mustafa. Shortest node-disjoint path using dual-network topology in optical switched networks. The International Arab Journal of Information Technology Vol. 10, no. 4 (Jul. 2013).
https://search.emarefa.net/detail/BIM-311885
American Medical Association (AMA)
Dahshan, Mustafa. Shortest node-disjoint path using dual-network topology in optical switched networks. The International Arab Journal of Information Technology. 2013. Vol. 10, no. 4.
https://search.emarefa.net/detail/BIM-311885
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references.
Record ID
BIM-311885