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

Authors:
Xiaodong Hu;Tianping Shuai
Affiliations:
Institute of Applied Mathematics, Chinese Academy of Sciences, Beijing, China;Institute of Applied Mathematics, Chinese Academy of Sciences, Beijing, China
Venue:
AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
Year:
2005

Citing 15
Cited 0

The maximum k-colorable subgraph problem for chordal graphs

Information Processing Letters
On the k-coloring of intervals

Discrete Applied Mathematics
Routing and wavelength assignment in all-optical networks

IEEE/ACM Transactions on Networking (TON)
Ring routing and wavelength translation

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
The Maximum Edge-Disjoint Paths Problem in Bidirected Trees

SIAM Journal on Discrete Mathematics
A Coloring Algorithm for Interval Graphs

MFCS '89 Proceedings on Mathematical Foundations of Computer Science 1989
Approximation Algorithms and Complexity Results for Path Problems in Trees of Rings

MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Call Control in Rings

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Maximizing the Number of Connections in Optical Tree Networks

ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
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
Wavelength Assignment for Dynamic Traffic in Multi-fiber WDM Networks

IC3N '98 Proceedings of the International Conference on Computer Communications and Networks
Blocking in all-optical networks

IEEE/ACM Transactions on Networking (TON)
An Optimal Solution for the Channel-Assignment Problem

IEEE Transactions on Computers
A practical approach for routing and wavelength assignment in large wavelength-routed optical networks

IEEE Journal on Selected Areas in Communications
Dynamic wavelength assignment for multicast in all-optical WDM networks to maximize the network capacity

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

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 NP-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.