检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:孙灏 SUN Hao(Chuzhou Branch,Anhui Radio and Television University,Chuzhou 239000,China)
机构地区:[1]安徽广播电视大学滁州分校
出 处:《成都工业学院学报》2019年第2期46-50,共5页Journal of Chengdu Technological University
摘 要:在采用二叉树模型构建的有向双环网络路由模型的基础上,研究有向双环网络的移动路由拓扑对称构造算法,通过二叉树模型处理有向双环网络路由问题,确定有向双环网络的紧优对称无限簇,处理有向双环网络的最佳路由拓扑对称问题;采用双环拓扑优化算法模拟计算有向双环网络移动路由拓扑,确定最佳双环网络拓扑;并研究移动路由分布式容错算法,当有向双环网络内个别节点出现故障时,提升路由算法的坚定性,使其发挥最优化拓扑性能。通过同相关路由构造算法的对比,证实了该路由构造算法具有网络延迟上升速度低、吞吐量高的优势。综上所述,表明该算法具有较高的拓扑性质和通信性能。Efficient internet topology is of great significance for improving the efficiency and quality of information interaction in the information age. On the basis of using the binary tree model to construct the routing model of directional double-loop networks,the topology symmetric construction algorithm for mobile routing of directional double-loop networks was studied. In this paper,the routing problem of directional double-loop network was dealt with the binary tree model,the compact excellent symmetric infinite cluster of directional double-loop network was determines,and the topology symmetry problem of optimal routing of directional double-loop network was solved. The algorithm of double loop topology optimization was used to calculate the mobile routing topology of the directed double loop network. In this paper,the distributed fault tolerant algorithm of mobile routing was studied to improve the firmness of routing algorithm in case of fault of individual nodes in the dual loop network. The comparison with the correlation routing algorithm proves that the proposed routing algorithm has the advantages of low latency and high throughput. In summary,it is shown that the algorithm has high topological properties and communication performance.
关 键 词:有向双环网络 移动路由 拓扑 对称 构造算法 容错算法
分 类 号:TP302[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15