TY - GEN
T1 - On the benefit of tunability in reducing electronic port counts in WDM/TDM networks
AU - Berry, Randall A
AU - Modiano, Eytan
PY - 2004/11/22
Y1 - 2004/11/22
N2 - In this paper, we study the benefits of using tunable transceivers for reducing the required number of electronic ports in WDM/TDM networks. We show that such transceivers can be used to efficiently "groom" sub-wavelength traffic in the optical domain and so can significantly reduce the number of electronic ports compared to the fixed tuned case. We provide a new formulation for this "tunable grooming" problem. We show that in general this problem is NP-complete, but we are able to efficiently solve it for many cases of interest. When the number of wavelengths in the network is not limited, we show that each node only needs the minimum number of transceivers (i.e., no more transceivers than the amount of traffic that it generates). This holds regardless of the network topology or traffic pattern. When the number of wavelengths is limited, we show an analogous result for both uniform and hub traffic in a ring. We also develop a heuristic algorithm for general traffic that uses nearly the minimum number of transceivers. In most cases, tunable transceivers are shown to reduce the number of ports per node by as much as 60%.
AB - In this paper, we study the benefits of using tunable transceivers for reducing the required number of electronic ports in WDM/TDM networks. We show that such transceivers can be used to efficiently "groom" sub-wavelength traffic in the optical domain and so can significantly reduce the number of electronic ports compared to the fixed tuned case. We provide a new formulation for this "tunable grooming" problem. We show that in general this problem is NP-complete, but we are able to efficiently solve it for many cases of interest. When the number of wavelengths in the network is not limited, we show that each node only needs the minimum number of transceivers (i.e., no more transceivers than the amount of traffic that it generates). This holds regardless of the network topology or traffic pattern. When the number of wavelengths is limited, we show an analogous result for both uniform and hub traffic in a ring. We also develop a heuristic algorithm for general traffic that uses nearly the minimum number of transceivers. In most cases, tunable transceivers are shown to reduce the number of ports per node by as much as 60%.
UR - http://www.scopus.com/inward/record.url?scp=8344241160&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=8344241160&partnerID=8YFLogxK
U2 - 10.1109/INFCOM.2004.1357019
DO - 10.1109/INFCOM.2004.1357019
M3 - Conference contribution
AN - SCOPUS:8344241160
SN - 0780383559
T3 - Proceedings - IEEE INFOCOM
SP - 1340
EP - 1351
BT - IEEE INFOCOM 2004 - Conference on Computer Communications - Twenty-Third Annual Joint Conference of the IEEE Computer and Communications Societies
T2 - IEEE INFOCOM 2004 - Conference on Computer Communications - Twenty-Third Annual Joint Conference of the IEEE Computer and Communications Societies
Y2 - 7 March 2004 through 11 March 2004
ER -