Wavelength assignment for satisfying maximal number of requests in all-optical networks

1Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we study how to, given a set of pre-routed requests in an all-optical network and a set of wavelengths available on each link, assign a subset of requests with maximal size such that no wavelength constraint on links is violated. While all previous studies on the wavelength assignment problem with the same objective assume the same set of wavelengths available on all links, our work does not make such an assumption. We first prove that this problem is N P-hard even in bus networks, and then propose some approximation algorithms for the problem with guaranteed performance ratios in networks with some special and general topologies. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Hu, X., & Shuai, T. (2005). Wavelength assignment for satisfying maximal number of requests in all-optical networks. In Lecture Notes in Computer Science (Vol. 3521, pp. 320–329). Springer Verlag. https://doi.org/10.1007/11496199_35

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