%0 Journal Article
%T Novel adaptive routing algorithm with strategy of earlieststart path first in optical network<br>光网络环境中最先开始路径优先的自适应路由算法
%A LIU Bo-tao
%A <br>刘波涛
%J 计算机应用研究
%D 2012
%I 
%X 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.
%K optical networks
%K adaptive routing
%K distributed computing system
%K list scheduling algorithm<br>光网络
%K 自适应路由
%K 分布式计算系统
%K 列表调度算法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=31780116840884782203380BD4AE0A44&yid=99E9153A83D4CB11&vid=771469D9D58C34FF&iid=DF92D298D3FF1E6E&sid=3459DD0730F46515&eid=10A1B90DEF770706&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=6