Optical computer architectures: the application of optical concepts to next generation computers
Optical computer architectures: the application of optical concepts to next generation computers
Wavelength requirements of 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
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
Wavelength Assignment Problem on All-Optical Networks with k Fibres per Link
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Efficient access to optical bandwidth
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
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
| Hi-index | 0.00 |
We examine several decidability questions suggested by questions about all-optical networks, related to the gap between maximal load and number of colors (wavelengths) needed for a legal routing on a fixed graph. We prove the multiple fiber conjecture: for every fixed graph G there is a number LG such that in the communication network with LG parallel fibers for each edge of G, there is no gap (for any load). We prove that for a fixed graph G the existence of a gap is computable, and give an algorithm to compute it. We develop a decomposition theory for paths, defining the notion of prime sets of paths that are finite building blocks for all loads on a fixed graph. Properties of such decompositions yield our theorems.