z-logo
Premium
Wavelength assignment in multifiber star networks
Author(s) -
Bian Zhengbing,
Gu QianPing
Publication year - 2010
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.20345
Subject(s) - maximization , star network , star (game theory) , path (computing) , computer science , minification , time complexity , approximation algorithm , wavelength division multiplexing , optimization problem , mathematics , algorithm , mathematical optimization , topology (electrical circuits) , combinatorics , wavelength , network topology , physics , optics , computer network , ring network , mathematical analysis
We consider the wavelength assignment problem in WDM optical networks with multiple parallel fibers: Given a set P of paths, assign a color to each path such that the number of paths with the same color containing any link is at most the number of fibers in the link. Assuming the number of fibers in each link is fixed, we study two optimization problems. One is to minimize the number of colors for coloring P . The other is to color as many paths of P as possible with a given number of colors. We show that both the minimization and the maximization problems are NP‐hard in star networks with a uniform odd number of fibers. We give polynomial time optimal algorithms for the minimization and maximization problems in star networks with an even number of fibers and in the generalized star networks with a uniform even number of fibers. We also give a 1.58‐approximation algorithm for the maximization problem in the generalized star networks with an arbitrary number of fibers. The algorithms for the maximization problem in the generalized stars are based on our newly developed algorithm, which optimally solves the call control problem in the generalized star networks. The call control algorithm is of independent interest. © 2009 Wiley Periodicals, Inc. NETWORKS, 2010

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here