We study a wavelength assignment maximization problem in multifiber WDM networks. Given a network G, a set of requests, the number of fibers per link and the number of wavelengths, we want to maximize the number of requests that can be satisfied simultaneously. We propose polynomial time algorithms, that are either optimal or have a guaranteed worst case performance in basic topologies, such as chain, ring and star networks. © IFIP International Federation for Information Processing 2005.
CITATION STYLE
Potika, K. (2005). Maximizing the number of connections in multifiber WDM chain, ring and star networks. In Lecture Notes in Computer Science (Vol. 3462, pp. 1465–1470). Springer Verlag. https://doi.org/10.1007/11422778_139
Mendeley helps you to discover research relevant for your work.