Skip to main content
Conference Proceedings

Routing and wavelength assignment in optical networks from maximum edge-disjoint paths

Advances in Intelligent Systems and Computing (2014) 238 95-103
DOI: 10.1007/978-3-319-01796-9_10
6Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The routing and wavelength assignment (RWA) problem is NP-hard and also an important issue in wavelength-division multiplexing (WDM) optical networks. We propose an algorithm which is based on the maximum number of edge-disjoint paths (MEDP) to solve the RWA problem. The performance of the proposed method has been verified by experiments on several realistic network topologies.

Author supplied keywords

Cite

CITATION STYLE

APA

Hsu, C. C., Cho, H. J., & Fang, S. C. (2014). Routing and wavelength assignment in optical networks from maximum edge-disjoint paths. In Advances in Intelligent Systems and Computing (Vol. 238, pp. 95–103). Springer Verlag. https://doi.org/10.1007/978-3-319-01796-9_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free