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

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

Volumn , Issue , 2010, Pages 47-51

  Dahshan, Mostafa H ^a  

^a KING SAUD UNIVERSITY   (Saudi Arabia)

Author keywords

Disjoint paths; Network survavability; Optical switched networks

Indexed keywords

DIJKSTRA ALGORITHMS; DISJOINT PATHS; DUAL PATH; EXACT ALGORITHMS; MINIMUM TOTAL WEIGHTS; NETWORK SURVAVABILITY; NODE-DISJOINT PATHS; SIMULATION RESULT; SWITCHED NETWORKS; WAVELENGTH CONTINUITY CONSTRAINT;

HEURISTIC ALGORITHMS; OPTIMIZATION;

SWITCHING CIRCUITS;

EID: 78650596403     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCTD.2010.5646063     Document Type: Conference Paper

References (9)

1. Shengli Yuan and J. Jue, "Dynamic lightpath protection in WDM mesh networks under risk-disjoint constraint," Global Telecommunications Conference, 2004. GLOBECOM '04. IEEE, 2004, pp. 1770-1774 Vol.3. (Pubitemid 40611179)
2. Shengli Yuan and J. Jue, "Dynamic lightpath protection in WDM mesh networks under wavelength continuity constraint," Global Telecommunications Conference, 2004. GLOBECOM '04. IEEE, 2004, pp. 2019-2023 Vol.3. (Pubitemid 40611225)
3. Dahai Xu, Yang Chen, Yizhi Xiong, Chunming Qiao, and Xin He, "On the complexity of and algorithms for finding the shortest path with a disjoint counterpart," Networking, IEEE/ACM Transactions on, vol. 14, 2006, pp. 147-158.
4. R. Andersen, F. Chung, A. Sen, and G. Xue, "On Disjoint Path Pairs with Wavelength Continuity Constraint in WDM Networks," IN WDM NETWORKS; IEEE INFOCOM'2004, vol. 2, 2004, pp. 524- 535.
5. J.C.N. Clímaco and M.M. Pascoal, "Finding non-dominated bicriteria shortest pairs of disjoint simple paths," Computers & Operations Research, vol. 36, Nov. 2009, pp. 2892-2898.
6. M. German, A. Castro, X. Masip-Bruin, M. Yannuzzi, R. Martinez, R. Casellas, and R. Munoz, "On the challenges of finding two linkdisjoint lightpaths of minimum total weight across an optical network," Valladolid, Spain: 2009.
7. J.W. Suurballe, "Disjoint paths in a network," Networks, vol. 4, 1974, pp. 125-145.
8. Weifa Liang, "Robust routing in wide-area WDM networks," Parallel and Distributed Processing Symposium., Proceedings 15th International, 2001, p. 8 pp.
9. Edsger W. Dijkstra, "A note on two problems in connexion with graphs," 1959.