Optical computer architectures: the application of optical concepts to next generation computers
Optical computer architectures: the application of optical concepts to next generation computers
Ring routing and wavelength translation
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Wavelength conversion in optical networks
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Constrained Bipartite Edge Coloring with Applications to Wavelength Routing
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Call Scheduling in Trees, Rings and Meshes
HICSS '97 Proceedings of the 30th Hawaii International Conference on System Sciences: Software Technology and Architecture - Volume 1
Decidable Properties of Graphs of All-Optical Networks
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Routing and wavelength assignment in generalized WDM tree networks of bounded degree
PCI'05 Proceedings of the 10th Panhellenic conference on Advances in Informatics
On a noncooperative model for wavelength assignment in multifiber optical networks
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
Given a (possibly directed) network, the wavelength assignment problem is to minimize the number of wavelengths that must be assigned to communication paths so that paths sharing an edge are assigned different wavelengths. Our generalization to multigraphs with k parallel edges for each link (k fibres per link, with switches at nodes) may be of practical interest. While the wavelength assignment problem is NP-hard, even for a single fibre, and even in the case of simple network topologies such as rings and trees, the new model suggests many nice combinatorial problems, some of which we solve. For example, we show that for many network topologies, such as rings, stars, and specific trees, the number of wavelengths needed in the k-fibre model is less than 1/k fraction of the number required for a single fibre. We also study the existence and behavior of a gap between the minimum number of wavelengths and the natural lower bound of network congestion, the maximum number of communication paths sharing an edge. For optical stars (any size) while there is a 3/2 gap in the single fibre model, we show that with 2 fibres the gap is 0, and present a polynomial time algorithm that finds an optimal assignment. In contrast, we show that there is no fixed constant k such that for every ring and every set of communication paths the gap can be eliminated. A similar statement holds for trees. However, for rings, the gap can be made arbitrarily small, given enough fibres. The gap can even be eliminated, if the length of communication paths is bounded by a constant. We show the existence of anomalies: increasing the number of fibres may increase the gap.