Routing and wavelength assignment in all-optical networks
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Optical networks: a practical perspective
Optical networks: a practical perspective
Multiwavelength optical networks with limited wavelength conversion
IEEE/ACM Transactions on Networking (TON)
Dynamic wavelength routing using congestion and neighborhood information
IEEE/ACM Transactions on Networking (TON)
Worst-case analysis of dynamic wavelength allocation in optical networks
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
A path decomposition approach for computing blocking probabilities in wavelength-routing networks
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Computing approximate blocking probabilities for a class of all-optical networks
IEEE Journal on Selected Areas in Communications
Models of blocking probability in all-optical networks with and without wavelength changers
IEEE Journal on Selected Areas in Communications
Benefits of wavelength translation in all-optical clear-channel networks
IEEE Journal on Selected Areas in Communications
A new analytical model for multifiber WDM networks
IEEE Journal on Selected Areas in Communications
Efficient routing and wavelength assignment for reconfigurable WDM networks
IEEE Journal on Selected Areas in Communications
Computing blocking probabilities in multiclass wavelength-routing networks with multicast calls
IEEE Journal on Selected Areas in Communications
Research note: On the complexity and algorithm of grooming regular traffic in WDM optical networks
Journal of Parallel and Distributed Computing
Hierarchical logical topology in WDM ring networks with limited ADMs
NETWORKING'08 Proceedings of the 7th international IFIP-TC6 networking conference on AdHoc and sensor networks, wireless networks, next generation internet
Hi-index | 0.00 |
We consider the problem of wavelength assignment in reconfigurable WDM networks with wavelength converters. We show that for N-node P-port bidirectional rings, a minimum number of ⌈PN/4⌉ wavelengths are required to support all possible connected virtual topologies in a rearrangeably nonblocking fashion, and provide an algorithm that meets this bound using no more than ⌈PN/2⌉ wavelength converters. This improves over the tight lower bound of ⌈PN/3⌉ wavelengths required for such rings given in [1] if no wavelength conversion is available. We extend this to the general P-port case where each node i may have a different number of ports, Pi and show that no more than ⌈Σi Pi/4⌉ + 1 wavelengths are required. We then provide a second algorithm that uses more wavelengths yet requires significantly fewer converters. We also develop a method that allows the wavelength converters to be arbitrarily located at any node in the ring. This gives significant flexibility in the design of the networks. For example, all ⌈PN/2⌉ converters can be collocated at a single hub node, or distributed evenly among the N nodes with min {⌈P/2⌉ + 1, P} converters at each node.