首页 | 本学科首页   官方微博 | 高级检索  
     

基于OSPF协议的多路径路由研究
引用本文:程奕,徐家品. 基于OSPF协议的多路径路由研究[J]. 太赫兹科学与电子信息学报, 2007, 5(4): 301-303
作者姓名:程奕  徐家品
作者单位:四川大学,电子信息学院,四川,成都,610064
摘    要:
为了有效利用网络资源,增强传输数据包的安全性,在优先开放最短路径(Open Shortest Path First,OSPF)协议的基础上,提出了一种改进的多路径路由算法。将寻找到的多条不相交路径添加到路径集Px中,将相交路径添加到备用路径集Cx中。当Px集中路径用完时,根据加权weight值随机地丢掉一些路径,并用Cx集中的路径来补充。根据本算法,不仅有效预防网络拥塞,而且增强了网络中的数据安全性。

关 键 词:多路径路由  不相交  邻居  最短路径树  路径集  加权值
文章编号:1672-2892(2007)04-0301-03
修稿时间:2007-01-162007-03-22

Multipath Routing Research Based on OSPF
CHENG Yi,XU Jia-pin. Multipath Routing Research Based on OSPF[J]. Journal of Terahertz Science and Electronic Information Technology, 2007, 5(4): 301-303
Authors:CHENG Yi  XU Jia-pin
Affiliation:College of Electronics and Information Engineering, Sichuan University, Chengdu Sichuan 610064, China
Abstract:
To utilize network resources more efficiently and enhance the security of the transported packets, an improved multipath routing algorithm based on OSPF is proposed. The algorithm will firstly put the multiple disjoint paths which have been found, into the path set Px and put the paths which are not disjoint from path set Px into the candidate path set Cx. When paths in Px are used up, some paths will be randomly discarded according to the weighted value, and the paths in Cx will be added to Px if they are disjoint with the remaining paths in Px. So the algorithm can prevent network congestion efficiently and enhance the data security greatly.
Keywords:OSPF
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《太赫兹科学与电子信息学报》浏览原始摘要信息
点击此处可从《太赫兹科学与电子信息学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号