Efficient routing in optical networks
Journal of the ACM (JACM)
Fault-tolerant routings in double fixed-step networks
Discrete Applied Mathematics
All-to-all optical routing in optimal chordal rings of degree four
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
A Combinatorial Problem Related to Multimodule Memory Organizations
Journal of the ACM (JACM)
Optical Routing of Uniform Instances in Tori
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Uniform multi-hop all-to-all optical routings in rings
Theoretical Computer Science - Latin American theoretical informatics
Efficient access to optical bandwidth
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Dense wavelength division multiplexing networks: principles and applications
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
We consider the problem of routing uniform communication instances in switched optical rings that use wavelength-division multiplexing technology. A communication instance is called uniform if it consists exactly of all pairs of nodes in the graph whose distance is equal to one from a specified set S={d"1,d"2,...,d"k}. When k=1 or 2, we prove necessary and sufficient conditions on the values in S relative to n for the optimal wavelength index to be equal to the optimal load in the ring R"n. When k=2, we show that for any uniform instance specified by {d"1,d"2}, there is an optimal wavelength assignment on the ring R"n, if n(d"1/q-2)d"1+(d"1/q-1)d"2, where q=GCD(d"1,d"2). For general k and n, we show a (32)-approximation for the optimal wavelength index; this is the best possible for arbitrary S. We also show that an optimal assignment can always be obtained provided n is large enough compared to the values in S.