On routing and spectrum allocation in spectrum-sliced optical networks

On routing and spectrum allocation in spectrum-sliced optical networks
复制标题

DOI:
10.1109/infcom.2013.6566800
复制
发表时间:
2013-04
期刊:
2013 Proceedings IEEE INFOCOM
影响因子:
--
通讯作者:
Shahrzad Shirazipourazad;Chenyang Zhou;Zahra Derakhshandeh;Arunabha Sen
Shahrzad Shirazipourazad;Chenyang Zhou;Zahra Derakhshandeh;Arunabha Sen
中科院分区:
其他
文献类型:
--
作者:
Shahrzad Shirazipourazad;Chenyang Zhou;Zahra Derakhshandeh;Arunabha Sen

文献摘要

被引文献

相似文献

正交频分复用(OFDM)技术为光网络中的高效资源利用提供了机会。它允许分配多个子载波以满足不同大小的业务需求。利用正交频分复用(OFDM)技术,近年来提出了一种频谱高效、可扩展的光传送网(SLICE). SLICE架构能够实现亚波长、超波长资源分配和多速率数据业务,从而有效地使用频谱。然而,这种好处伴随着资源分配的额外复杂性。在SLICE架构中,为了最小化所利用的频谱,必须解决路由和频谱分配问题(RSA)。在本文中,我们专注于RSA和(i)证明RSA是NP-完全的,即使当光网络拓扑结构是简单的链或环,(ii)提供RSA的近似算法时,网络拓扑结构是一个二叉树或环,(iii)提供一个启发式的网络与任意拓扑结构和测量的启发式的有效性与广泛的模拟。仿真结果表明,我们的启发式显着优于其他几个最近提出的RSA算法。
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.