首页> 外文会议>IEEE International Conference on Systems, Man, and Cybernetics >Circuit Interference Reduction - Minimum Allocation Slots: New Algorithm for Solution IA-RMLSA Problem in Elastic Optical Network
【24h】

Circuit Interference Reduction - Minimum Allocation Slots: New Algorithm for Solution IA-RMLSA Problem in Elastic Optical Network

机译:电路干扰减小 - 最小分配插槽:弹性光网络中解决方案IA-RMLSA问题的新算法

获取原文

摘要

The elastic optical networks have shown promise for future of optical communications supporting high transmission rates data. To meet high transmission rates, you need to solution RMLSA (Routing, Modulation Level, Spectrum Assignment) problem which is to select a route, choose a modulation level and a range of free spectrum. A new algorithm called Circuit Interference Reduction - Minimum Allocation Slots (CIR-MAS) is presented in this work. This algorithm seeks to select a modulation format that is more resistant circuit interferences (established circuits on the networks). Also it selects a route with the minimum allocation slots among the alternative routes, in order to reduce the blockage caused by degradation of circuits. The performance of the CIR-MAS algorithm was evalueted on the NSFNet and EON topologies by comparing with the following algorithms: K-Shortest Path Computation (KS-PC), Modified Dijkstra Path Computation (MD-PC) and K-Shortest Path with Reduction of QoTO (KSP-RQoTO), wich have already been presented in the literature. The CIR-MAS algorithm presented a minimum gain of 40.5% in terms of circuit blocking probability, and in terms of bandwidth blocking probability, it obtained a minimum gain of 37.5% when compared all competing algorithms.
机译:弹性光网络已经示出了支持高传输速率数据的光学通信的未来。为了满足高传输速率,您需要解决要选择路由的RMLSA(路由,调制级别,频谱分配)问题,选择调制级别和​​一系列自由频谱。在这项工作中提出了一种称为电路干扰减小的新算法 - 最小分配插槽(CIR-MAS)。该算法旨在选择更具耐电路干扰的调制格式(网络上的已建立电路)。此外,它选择了替代路线中的最小分配插槽的路径,以便减少电路劣化引起的堵塞。通过与以下算法进行比较,在NSFNET和EON拓扑上进行评估CIR-MAS算法的性能:K-Shortest路径计算(KS-PC),修改的Dijkstra路径计算(MD-PC)和k最短路径减少QoTo(KSP-RQOTO),WICH已经在文献中呈现。 CIR-MAS算法在电路阻塞概率方面呈现了40.5%的最小增益,并且在带宽阻塞概率方面,在比较所有竞争算法时,它获得了37.5%的最小增益。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号