@inproceedings{5939981fb5c64f68bde628aee5cc079d,
title = "A simple and efficient RWA algorithm based on priority of edge disjoint paths",
abstract = "Routing and wavelength assignment (RWA) is an important issue in WDM optical transport networks. The objective is to find lightpaths for given demands with minimal use of wavelengths. It is typically solved using combination of linear programming and graph coloring, or heuristic path selection algorithms. Such methods are complex or yield sub-optimal paths. In this paper, we propose an efficient algorithm, RWA based on Priorities of Shortest Path (RPSP). The proposed algorithm utilizes the lengths of the shortest paths for the source-destination demand pairs and assigns disjoint lightpaths to the ordered demands. The computer simulation shows that our proposed algorithm indeed requires up to 34\% fewer wavelengths with almost identical running time than the previously proposed effective BGAforEDP algorithm.",
author = "Yim, \{Soon Bin\} and Chung, \{Min Young\} and Hyunseung Choo and Lee, \{Tae Jin\}",
year = "2006",
doi = "10.1007/11751588\_119",
language = "English",
isbn = "3540340726",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "1121--1130",
booktitle = "Computational Science and Its Applications - ICCSA 2006",
note = "ICCSA 2006: International Conference on Computational Science and Its Applications ; Conference date: 08-05-2006 Through 11-05-2006",
}