Zhao Yi, Zhang Qi, Xin Xiangjun, Li Yiqiang, Gao Ran, Tao Ying, Tian Qinghua, Tian Feng, Chen Dong, Cao Guixing
Appl Opt. 2020 Feb 10;59(5):1420-1429. doi: 10.1364/AO.385140.
Considering the flexibility characteristic of advanced reservation (AR) requests, the problem of static routing, modulation, spectrum, and time assignment (RMSTA) of AR requests in elastic optical networks is studied in this paper, in order to deploy the spectrum resource economically and enable more requests to be served. The multi-objective integer linear program (ILP) model, which can minimize the maximum utilized frequency and time slot indices as well as find a trade-off between them, is used to formulate the RMSTA problem. Then the proportion optimal RMSTA (PO-RMSTA) heuristic algorithm with three sorting strategies is proposed to get the sub-optimal solutions. The PO-RMSTA algorithm and sorting strategies, ascending order of elastic time (AET), descending order of data volume (DDV), and ascending order of alternative schemes (AAS), are simulated in our work and proved to obtain the approximate optimal solutions. The sorting policy AET achieved the best performance when minimizing the maximum utilized frequency slot index, whereas the sorting policy DDV worked best when minimizing the maximum utilized time slot index. As for the compromise between two indices, both AET and AAS provided satisfying results.
考虑到提前预留（AR）请求的灵活性特点，本文研究了弹性光网络中AR请求的静态路由、调制、频谱和时间分配（RMSTA）问题，以便经济地部署频谱资源并服务更多请求。使用多目标整数线性规划（ILP）模型来制定RMSTA问题，该模型可以最小化最大使用频率和时隙索引，并在它们之间找到权衡。然后提出了具有三种排序策略的比例最优RMSTA（PO-RMSTA）启发式算法来获得次优解。在我们的工作中对PO-RMSTA算法和排序策略，即弹性时间升序（AET）、数据量降序（DDV）和替代方案升序（AAS）进行了仿真，并证明可以获得近似最优解。在最小化最大使用频率时隙索引时，排序策略AET表现最佳，而在最小化最大使用时隙索引时，排序策略DDV效果最佳。至于两个索引之间的折衷，AET和AAS都提供了令人满意的结果。
