一种网络可靠性的多路径路由算法  

Multi-path Routing Algorithm About Network Reliability

作　　者：胡建军[1] 王学毅[2] 范彬[3] 

机构地区：[1]兰州文理学院电子信息工程学院,兰州730000 [2]东北大学信息科学与工程学院,沈阳110004 [3]沈阳工程学院计算机基础教学部,沈阳110136

出　　处：《小型微型计算机系统》2014年第8期1780-1783,共4页Journal of Chinese Computer Systems

基　　金：国家杰出青年科学基金项目(61225012)资助;国家自然科学基金项目(61070162;71071028;70931001)资助;高等学校博士学科点专项科研基金优先发展领域课题(20120042130003)资助;高等学校博士学科点专项科研基金课题(20100042110025;201100-42110024)资助;工信部物联网发展专项资金项目资助;中央高校基本科研业务费专项资金项目(N110204003;N120104001)资助

摘　　要：可靠性是衡量网络性能优劣的重要参数之一.为了提高网络通信的可靠性,在一个网络的源-终端对之间往往要设计多条路由,以往的路由算法通常选择跳数、延迟、流量等参数作为网络路由的度量准则.然而路径可靠性直接影响着其他度量准则的选择,因此选择路径可靠性的路由决策更加合理.为此,提出一种改进的基于源-终端对路径可靠性的路由算法,在算法中,每个节点和邻居节点通过周期性交换链路信息维护着一张全局网络的毗邻矩阵,并且以路径的相关性最小优先为准则选择多路由.实例验证表明,算法可靠性的误差明显下降,最大误差为0.0371.Reliability is one of the important parameters to measure network performance. Generally, for a given source-terminal pair, multiple routes exist in a data network for reliability of communication network, and is selected by a routing algorithm based on net- work metrics such as hop-count, delay, traffic, and so on. However, path reliability directly affect the choice of these metrics, so the routing decision based on reliability will be the best possible option. Therefore we propose a distributed routing algorithm based on the source-terminal （s-t） path reliability in this paper. In the proposed routing algorithm, each node generates an adjacency matrix of a network graph by periodically exchanging connection information with the adjacent nodes, and selects multiple routes based on mini- rnal path dependency prior to other rule. An example shows that the reliability of the algorithm error decreases obviously, the biggest error of 0. 0371.

关 键 词：网络可靠性 通信网络 网络拓扑 毗邻矩阵 路径相关度 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]