光网络环境中最先开始路径优先的自适应路由算法

Novel adaptive routing algorithm with strategy of earliest start path first in optical network

为了优化光网络环境下分布式计算系统的资源调度性能,提出了一种最先开始路径优先的自适应路由算法。该算法基于Dijkstra最短路径优先算法,通过引入一个时间标记变量来估计从源节点到当前目标节点的最先可用时间,绕过调度过程中产生拥堵的链路,选择能够最先开始通信的路由,从而减小通信竞争冲突,缩短了调度长度。仿真结果表明,该算法能够使用较少的网络链路资源来获得最短的调度长度。

To improve the resource scheduling performance of distributed computing system in the optical network,this paper proposed anovel adaptive routing algorithm with the strategy of earliest start path first in the optical network.The proposed adaptive routing algorithm could bypass the link congestion in the process of scheduling produces,chose the route that was able to communicate theveryfirst by introducing a time mark variable to estimate the headmost available time from the source node to the goal node,reduced communication competition conflicts,and shorter the scheduling length.The simulation results show that the proposed algorithm can use less network link resources to get the shortest scheduling length.