Novel adaptive routing algorithm with strategy of earlieststart path first in optical network
光网络环境中最先开始路径优先的自适应路由算法

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.