Abstract 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算法

摘要 弹性光网络是下一代光核心网的一项有前途的技术，路由、调制和频谱分配（RMSA）问题是其关键问题之一。立即预订 (IR) 和提前预订 (AR) 请求的 RMSA 问题已得到广泛研究。可延展预留 (MR) 请求是弹性光网络 (EON) 中的另一种重要流量。然而，MR 请求的 RMSA 问题还没有得到很好的考虑。在本文中，我们研究了 EON 中 MR 请求的 RMSA 问题，并提出了一种名为 Min-RRD 的算法。该算法为MR请求分配具有最小和三个指标的频率-时间块，即已使用资源数(R used)、受影响资源数(R Impacted)和到角点的距离(Dcorner)。仿真结果表明，与现有算法相比，该算法具有更低的阻塞概率和更小的延迟。因此，它是一种性能良好的 RMSA 算法。