Efficient routing in all-optical networks
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
On the k-coloring of intervals
Discrete Applied Mathematics
On the wavelength assignment problem in multifiber WDM star and ring networks
IEEE/ACM Transactions on Networking (TON)
Routing and path multicoloring
Information Processing Letters
Wavelength assignment and generalized interval graph coloring
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Satisfying a maximum number of pre-routed requests in all-optical rings
Computer Networks: The International Journal of Computer and Telecommunications Networking - Small and home networks
Multicommodity demand flow in a tree
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Upgrading unicast nodes to multicast-capable nodes in all-optical networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Dynamic lightpath establishment considering four-wave mixing in multifiber WDM networks
Photonic Network Communications
Hi-index | 0.00 |
Motivated by the increasing importance of multifiber WDM networks we study a routing and wavelength assignment problem in such networks. In this problem the number of wavelengths per fiber is given and the goal is to minimize the cost of fiber links that need to be reserved in order to satisfy a set of communication requests; we introduce a generalized setting where network pricing is non-uniform, that is the cost of hiring a fiber may differ from link to link. We consider two variations: undirected, which corresponds to full-duplex communication, and directed, which corresponds to one-way communication. Moreover, for rings we also study the problem in the case of pre-determined routing. We present exact or constant-ratio approximation algorithms for all the above variations in chain, ring and spider networks.