TY - GEN
T1 - On routing and spectrum allocation in spectrum-sliced optical networks
AU - Shirazipourazad, Shahrzad
AU - Zhou, Chenyang
AU - Derakhshandeh, Zahra
AU - Sen, Arunabha
PY - 2013
Y1 - 2013
N2 - The orthogonal frequency division multiplexing (OFDM) technology provides an opportunity for efficient resource utilization in optical networks. It allows allocation of multiple sub-carriers to meet traffic demands of varying size. Utilizing OFDM technology, a spectrum efficient and scalable optical transport network called SLICE was proposed recently. The SLICE architecture enables sub-wavelength, super-wavelength resource allocation and multiple rate data traffic that results in efficient use of spectrum. However, the benefit is accompanied by additional complexities in resource allocation. In SLICE architecture, in order to minimize the utilized spectrum, one has to solve the routing and spectrum allocation problem (RSA). In this paper, we focus our attention to RSA and (i) prove that RSA is NP-complete even when the optical network topology is as simple as a chain or a ring, (ii) provide approximation algorithms for RSA when the network topology is a binary tree or a ring, (iii) provide a heuristic for the network with arbitrary topology and measure the effectiveness of the heuristic with extensive simulation. Simulation results demonstrate that our heuristic significantly outperforms several other heuristics proposed recently for RSA.
AB - The orthogonal frequency division multiplexing (OFDM) technology provides an opportunity for efficient resource utilization in optical networks. It allows allocation of multiple sub-carriers to meet traffic demands of varying size. Utilizing OFDM technology, a spectrum efficient and scalable optical transport network called SLICE was proposed recently. The SLICE architecture enables sub-wavelength, super-wavelength resource allocation and multiple rate data traffic that results in efficient use of spectrum. However, the benefit is accompanied by additional complexities in resource allocation. In SLICE architecture, in order to minimize the utilized spectrum, one has to solve the routing and spectrum allocation problem (RSA). In this paper, we focus our attention to RSA and (i) prove that RSA is NP-complete even when the optical network topology is as simple as a chain or a ring, (ii) provide approximation algorithms for RSA when the network topology is a binary tree or a ring, (iii) provide a heuristic for the network with arbitrary topology and measure the effectiveness of the heuristic with extensive simulation. Simulation results demonstrate that our heuristic significantly outperforms several other heuristics proposed recently for RSA.
UR - http://www.scopus.com/inward/record.url?scp=84883076213&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84883076213&partnerID=8YFLogxK
U2 - 10.1109/INFCOM.2013.6566800
DO - 10.1109/INFCOM.2013.6566800
M3 - Conference contribution
AN - SCOPUS:84883076213
SN - 9781467359467
T3 - Proceedings - IEEE INFOCOM
SP - 385
EP - 389
BT - 2013 Proceedings IEEE INFOCOM 2013
T2 - 32nd IEEE Conference on Computer Communications, IEEE INFOCOM 2013
Y2 - 14 April 2013 through 19 April 2013
ER -