Optimal Wavebanding in WDM Ring Networks

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 c...

Full description

Saved in:
Bibliographic Details
Published in:IEEE/ACM transactions on networking Vol. 22; no. 1; pp. 179 - 190
Main Authors: Turkcu, Onur, Subramaniam, Suresh
Format: Journal Article
Language:English
Published: New York IEEE 01-02-2014
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1063-6692
1558-2566
DOI:10.1109/TNET.2013.2247625