基于最大化畅通概率优化模型的固定路由算法

发布时间：2018-03-06 21:15

本文选题：光网络　切入点：路由与波长分配(RWA)　出处：《光电子.激光》2014年05期 　论文类型：期刊论文

【摘要】：针对以最小化网络阻塞率为目标的光网络路由及波长分配(RWA)问题,考虑到全网结构不均衡易导致部分链路负载过高,进而造成全网阻塞率过高问题,在基于爱尔兰损失公式的链路阻塞概率模型的基础上,建立了最大化路径畅通概率的优化模型。为了克服优化模型的非线性造成的求解困难,借鉴大系统中分解协调的思想对链路负载进行预估,将原优化问题转化成乘积最长路问题,并结合负载滚动预估更新及类Dijkstra算法进行近似求解。仿真比较实验表明,本文算法能够较好地近似求解所提出的最大化畅通概率模型,有效地均衡了全网负载,降低了全网阻塞率,提高了网络传输性能。
[Abstract]:Aiming at the problem of routing and wavelength assignment in optical networks with the goal of minimizing the blocking probability of the network, considering that the imbalance of the whole network structure may lead to excessive partial link load, which leads to the high blocking rate of the whole network. On the basis of the link blocking probability model based on Irish loss formula, an optimization model is established to maximize the path unblocked probability. In order to overcome the difficulty of solving the nonlinear problem caused by the optimization model, Based on the idea of decomposition and coordination in large scale system, the link load is estimated, the original optimization problem is transformed into the product longest path problem, and the approximate solution is obtained by combining the load rolling prediction updating and the similar Dijkstra algorithm. The proposed algorithm can approximate to solve the proposed maximum smooth probability model, effectively balance the load of the whole network, reduce the blocking rate of the whole network, and improve the transmission performance of the network.
【作者单位】：厦门大学信息科学与技术学院云计算与大数据研究中心;
【基金】：国家自然科学基金青年基金(11201391)资助项目
【分类号】：TN929.1

【参考文献】