摘要
针对网络上当流量大时,路由无法有效的分配通路的情况,解决由流量控制的路由选择算法。在传统的求最短路径的路由选择算法的基础上进行扩充,加入以DFS(隐枚举)算法为核心的流量淘汰算法,使流量选择网络通路时,能有效的考虑网络带宽因素,减少拥塞概率,增加网络吞吐量。作者根据现有路由选择算法的基础上,使用DFS技术对网络流量的分配做了详细的论证。
Route can't select path when there is overfull flux on the net, so it is important to settle the question that route selects path based on flux. The arithmetic of selecting route is improved based on seeking the shortest path, and the arithmetic of flux elutriated based on DFS. In this way, network distributed is considered; duce congestion抯 probability is reduced and network抯 throughput is increased when flux selects gateway on network. Detailed discussion is made on the new arithmetic about route selecting path based on DFS.
出处
《辽宁工程技术大学学报（自然科学版）》
CAS
北大核心
2002年第6期767-769,共3页
Journal of Liaoning Technical University (Natural Science)
