首页> 外文会议>2010 IEEE Global Telecommunications Conference >Routing and Spectrum Allocation in OFDM-Based Optical Networks with Elastic Bandwidth Allocation
【24h】

Routing and Spectrum Allocation in OFDM-Based Optical Networks with Elastic Bandwidth Allocation

机译:具有弹性带宽分配的基于OFDM的光网络中的路由和频谱分配

获取原文

摘要

Orthogonal Frequency Division Multiplexing (OFDM) has been recently proposed as a modulation technique for optical networks, due to its good spectral efficiency and impairment tolerance. Optical OFDM is much more flexible compared to traditional WDM systems, enabling elastic bandwidth transmissions. We consider the planning problem of an OFDM-based optical network where we are given a traffic matrix that includes the requested transmission rates of the connections to be served. Connections are provisioned for their requested rate by elastically allocating spectrum using a variable number of OFDM subcarriers. We introduce the Routing and Spectrum Allocation (RSA) problem, as opposed to the typical Routing and Wavelength Assignment (RWA) problem of traditional WDM networks, and present various algorithms to solve the RSA. We start by presenting an optimal ILP RSA algorithm that minimizes the spectrum used to serve the traffic matrix, and also present a decomposition method that breaks RSA into two substituent subproblems, namely, (i) routing and (ii) spectrum allocation (R+SA) and solves them sequentially. We also propose a heuristic algorithm that serves connections one-by-one and use it to solve the planning problem by sequentially serving all traffic matrix connections. To feed the sequential algorithm, two ordering policies are proposed; a simulated annealing meta-heuristic is also used to obtain even better orderings. Our results indicate that the proposed sequential heuristic with appropriate ordering yields close to optimal solutions in low running times.
机译:正交频分复用(OFDM)最近由于其良好的频谱效率和减损容忍度而被提出作为光网络的一种调制技术。与传统的WDM系统相比,光OFDM更加灵活,可实现弹性带宽传输。我们考虑了基于OFDM的光网络的规划问题,在该问题中,我们获得了一个流量矩阵,该矩阵包含请求服务的连接的传输速率。通过使用可变数量的OFDM子载波弹性分配频谱,可以为连接提供其请求的速率。与传统WDM网络的典型路由和波长分配(RWA)问题相反,我们介绍了路由和频谱分配(RSA)问题,并提出了多种解决RSA的算法。我们首先介绍一种最佳的ILP RSA算法,该算法可最小化用于服务流量矩阵的频谱,还提出一种将RSA分解为两个替代子问题的分解方法,即(i)路由和(ii)频谱分配(R + SA )并按顺序解决它们。我们还提出了一种启发式算法,该算法逐一为连接提供服务,并通过依次为所有流量矩阵连接提供服务来解决规划问题。为了提供顺序算法,提出了两种排序策略:模拟退火元启发式算法也可用于获得更好的排序。我们的结果表明,所建议的顺序启发式算法在低运行时间下具有适当的排序产量,接近最佳解决方案。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号