基于整数规划的大规模WDM光网络RWA算法

RWA Algorithm for Large-scale WDM Optical Network Based on Integer Programming

在WDM光网络中,RWA问题一直以来都是研究的热点。目前已有很多种RWA算法,但是大多数RWA算法不能有效地适用于大规模WDM光网络。为了解决大规模WDM光网络的RWA问题,提出了一种基于整数规划的大规模WDM光网络RWA算法,该算法通过构建数学模型,定义了决策变量、目标函数、约束条件,将RWA问题转化为一个整数规划问题,通过求解整数规划问题,获得业务请求的路径和资源分配情况。分别使用提出的算法和传统KSP算法对大规模WDM光网络进行实验,在相同条件下,提出的算法具有较高的业务请求计算成功率和较低的中继占用率,能够有效解决大规模WDM光网络RWA问题。

In WDM optical networks,RWA issues have always been a hot topic of research.There are many kinds of RWA al-gorithms,but most RWA algorithms can't be effectively applied to large-scale WDM optical networks.In order to solve the RWA problem of large-scale WDM optical networks,a large-scale WDM optical network RWA algorithm based on integer programming is proposed.The algorithm defines decision variables,objective functions,and constraints by constructing a mathematical model,and transforms the RWA problem into an integer programming problem,by solving the integer programming problem,obtains the path and resource allocation of the business request.The proposed algorithm and the traditional KSP algorithm are used to experi-ment on large-scale WDM optical networks.Under the same conditions,the proposed algorithm has a higher calculation success rate of service requests and a lower relay occupancy rate,which can effectively solve large-scale WDM optical network RWA prob-lem.