A Survey of Combinatorial Gray Codes
SIAM Review
Efficient generation of the binary reflected gray code and its applications
Communications of the ACM
Optical networks: a practical perspective
Optical networks: a practical perspective
Combinatorial Algorithms: For Computers and Hard Calculators
Combinatorial Algorithms: For Computers and Hard Calculators
Waveband switching for dynamic traffic demands in multigranular optical networks
IEEE/ACM Transactions on Networking (TON)
Optical Network Design and Planning
Optical Network Design and Planning
Uniform versus non-uniform band switching in WDM networks
Computer Networks: The International Journal of Computer and Telecommunications Networking - Optical networks
Non-uniform waveband switching in multi-granular optical networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Optimal waveband switching in optical ring networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Efficient evolutionary approaches for the data ordering problem with inversion
EuroGP'06 Proceedings of the 2006 international conference on Applications of Evolutionary Computing
A study of waveband switching with multilayer multigranular optical cross-connects
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Savings in switching costs of an optical cross-connect can be achieved by grouping together a set of consecutive wavelengths and switching them as a single waveband. This technique is known as waveband switching. While previous work has focused on either uniform band sizes or nonuniform band sizes considering a single node, in this paper we focus on the number of wavebands and their sizes for ring topologies. First, we show that such solutions are inadequate when considering the entire network. We then present a novel framework for optimizing the number of wavebands in a ring network for deterministic traffic. The objective of the Band Minimization Problem is to minimize the number of nonuniform wavebands in the network while using the minimum possible number of wavelengths. We show that the problem is NP-hard and present heuristics for it. We then consider a specific type of traffic, namely all-to-all traffic, and present a construction method for achieving the minimum number of wavebands in the ring. Our results show that the number of ports can be reduced by a large amount using waveband switching compared to wavelength switching, for both all-to-all traffic and random traffic. We also numerically evaluate the performance of our waveband design algorithms under dynamic stochastic traffic.