An algorithm for finding optimal node-disjoint paths in optical switched networks

Research output: Book chapter/Published conference paperConference paperpeer-review

2 Citations (Scopus)

Abstract

This paper presents a new exact algorithm for finding two node-disjoint paths of minimum total weight in optical switched networks with wavelength-continuity constraint. Unlike previous heuristic algorithms developed for this purpose, our algorithm is not based on the Suurballe algorithm. Instead, it is based on Dijkstra algorithm modified to work on a dual path. We show that our algorithm can find optimal node-disjoint paths in much smaller time than using an exact ILP algorithm. The performance of the proposed algorithm is demonstrated by simulation results.

Original languageEnglish
Title of host publicationICCTD 2010 - 2010 2nd International Conference on Computer Technology and Development, Proceedings
Pages47-51
Number of pages5
DOIs
Publication statusPublished - 31 Dec 2010
Event2010 2nd International Conference on Computer Technology and Development, ICCTD 2010 - Cairo, Egypt
Duration: 02 Nov 201004 Nov 2010

Publication series

NameICCTD 2010 - 2010 2nd International Conference on Computer Technology and Development, Proceedings

Conference

Conference2010 2nd International Conference on Computer Technology and Development, ICCTD 2010
Country/TerritoryEgypt
CityCairo
Period02/11/1004/11/10

Fingerprint

Dive into the research topics of 'An algorithm for finding optimal node-disjoint paths in optical switched networks'. Together they form a unique fingerprint.

Cite this