首页> 外文期刊>Optical fiber technology >RMSA algorithm for malleable-reservation requests in elastic optical networks
【24h】

RMSA algorithm for malleable-reservation requests in elastic optical networks

机译:弹性光网络中的可延展预留请求的RMSA算法

获取原文
获取原文并翻译 | 示例
       

摘要

Elastic optical networking is a promising technology for the next generation of optical core networks and the routing, modulation and spectrum assignment (RMSA) problem is one of its key issues. The RMSA problems for immediately reservation (IR) and advance reservation (AR) requests have been widely researched. Malleable reservation (MR) requests are another kind of important traffics in elastic optical networks (EONs). However, the RMSA problem for MR requests has not been well considered. In this paper, we investigate the RMSA problem for MR requests in EONs and propose an algorithm named Min-RRD. The algorithm assigns frequency-time blocks with the minimum sum of three indexes, namely number of used resources (R-used), number of impacted resources (R-impacted) and distance to corner (D-corner), to MR requests. Simulation results show that the proposed algorithm has a lower blocking probability and a smaller delay than the existing algorithm. Hence, it is a well-performed RMSA algorithm.
机译:弹性光学网络是下一代光学核心网络的有希望的技术,路由,调制和频谱分配(RMSA)问题是其关键问题之一。已被广泛研究了立即预留(IR)和提前预订(AR)请求的RMSA问题。可助长的预订(MR)请求是弹性光网络(EONS)中的另一种重要的流量。但是,MR请求的RMSA问题尚未得到很好的考虑。在本文中,我们调查了EONS MR请求的RMSA问题,并提出了一个名为Min-RRD的算法。该算法将具有三个索引的最小和的频率 - 时滞,即使用的资源(使用)的数量,受影响的资源数(R-CheciveLed)和到角落(D-Conder)的距离,对MR请求。仿真结果表明,该算法具有较低的阻塞概率和比现有算法的延迟较小。因此,它是一个良好的RMSA算法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号