Wide-sense nonblocking networks
SIAM Journal on Discrete Mathematics
NP-completeness of edge-colouring some restricted graphs
Discrete Applied Mathematics
The greedy algorithm is optimal for on-line edge coloring
Information Processing Letters
Optimal wavelength routing on directed fiber trees
Theoretical Computer Science
Improved access to optical bandwidth in trees
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Strictly non-blocking WDM cross-connects for heterogeneous networks
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Strictly non-blocking WDM cross-connects
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Edge coloring of bipartite graphs with constraints
Theoretical Computer Science
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Constrained Bipartite Edge Coloring with Applications to Wavelength Routing
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
On-Line Edge-Coloring with a Fixed Number of Colors
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Efficient Wavelength Routing on Directed Fiber Trees
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Efficient access to optical bandwidth
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Multiwavelength Optical Networks with Limited Wavelength Conversion
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Graphs and Hypergraphs
Cost-Effective Designs of WDM Optical Interconnects
IEEE Transactions on Parallel and Distributed Systems
IEEE/ACM Transactions on Networking (TON)
Analyzing nonblocking switching networks using linear programming (duality)
INFOCOM'10 Proceedings of the 29th conference on Information communications
| Hi-index | 0.00 |
We consider the problem of minimizing the number of wavelength interchangers in the design of wide-sense nonblocking cross-connects for wavelength division multiplexed (WDM) optical networks. The problem is modeled as a graph theoretic problem that we call dynamic edge coloring. In dynamic edge coloring the nodes of a graph are fixed but edges appear and disappear, and must be colored at the time of appearance without assigning the same color to adjacent edges.For wide-sense nonblocking WDM cross-connects with k input and k output fibers, it is straightforward to show that 2k-1 wavelength interchangers are always sufficient. We show that there is a constant c 0 such that if there are at least ck2 wavelengths then 2k-1 wavelength interchangers are also necessary. This improves previous exponential bounds. When there are only 2 or 3 wavelengths available, we show that far fewer than 2k-1 wavelength interchangers are needed. However we also prove that for any 驴 0 and k 1/2驴, if the number of wavelengths is at least 1/驴2 then 2(1-驴)k wavelength interchangers are needed.