基于Internet AS图的紧凑路由算法研究
发布时间：2018-08-19 14:53
【摘要】：紧凑路由算法一直被认为是未来Internet上可扩展路由算法的有力候选者,因为它实现了近似最短路径路由机制的同时,路由表也比BGP(border gateway protocol)路由协议更加紧凑.TZ紧凑路由算法初始地标点的选取是随机生成的,没有充分利用网络拓扑信息,不是很适合真实网络.故分别提出了基于节点度和基于PageRank算法的地标节点选取机制,用于改进TZ紧凑路由算法.在2000年和2006年的Internet AS图上对两种改进算法和TZ算法进行仿真,实验结果表明,两种改进算法的平均路由表大小和平均伸长系数相比于TZ算法均有明显的改进.
[Abstract]:Compact routing algorithm has always been considered as a powerful candidate for scalable routing algorithms on future Internet because it implements the approximate shortest path routing mechanism at the same time. The routing table is also more compact than the BGP (border gateway protocol) routing protocol. The initial punctuation selection of the compact routing algorithm is randomly generated, which does not make full use of the network topology information and is not suitable for the real network. Therefore, the node selection mechanism based on node degree and PageRank algorithm is proposed, which is used to improve the TZ compact routing algorithm. Two improved algorithms and TZ algorithm are simulated on the Internet as diagrams in 2000 and 2006. The experimental results show that the average routing table size and average elongation coefficient of the two improved algorithms are obviously improved compared with the TZ algorithm.
【作者单位】： 中国科学技术大学电子科学与技术系;
【基金】：国家自然科学基金(60974079,61004102) 中央高校基本科研业务费专项资金(WK2100230004)资助
【分类号】：TP393.01;TP301.6
本文编号：2191989
[Abstract]:Compact routing algorithm has always been considered as a powerful candidate for scalable routing algorithms on future Internet because it implements the approximate shortest path routing mechanism at the same time. The routing table is also more compact than the BGP (border gateway protocol) routing protocol. The initial punctuation selection of the compact routing algorithm is randomly generated, which does not make full use of the network topology information and is not suitable for the real network. Therefore, the node selection mechanism based on node degree and PageRank algorithm is proposed, which is used to improve the TZ compact routing algorithm. Two improved algorithms and TZ algorithm are simulated on the Internet as diagrams in 2000 and 2006. The experimental results show that the average routing table size and average elongation coefficient of the two improved algorithms are obviously improved compared with the TZ algorithm.
【作者单位】： 中国科学技术大学电子科学与技术系;
【基金】：国家自然科学基金(60974079,61004102) 中央高校基本科研业务费专项资金(WK2100230004)资助
【分类号】：TP393.01;TP301.6
【相似文献】
相关硕士学位论文 前10条
1 张霄;搜索引擎优化与营销的分析与研究[D];北京邮电大学;2009年
2 陈学进;Web结构挖掘研究[D];合肥工业大学;2006年
3 赵静;基于PageRank的MBA教育资源搜索引擎研究[D];大连海事大学;2009年
4 周军;基于图的模式挖掘及其应用研究[D];合肥工业大学;2009年
5 袁浩;主题爬虫搜索Web页面策略的研究[D];中南大学;2009年
6 严曙瑾;基于本体的博客搜索引擎关键技术研究与实现[D];华东师范大学;2009年
7 王玉辉;垂直搜索引擎关键技术研究及应用[D];华北电力大学（河北）;2009年
8 蒋科;基于领域概念定制的主题爬虫系统的设计与实现[D];西安电子科技大学;2007年
9 张丽;万维网搜索算法的研究[D];北京交通大学;2007年
10 常庆;风险主题搜索引擎相关技术的研究与应用[D];西北大学;2008年
，本文编号：2191989
本文链接：https://www.wllwen.com/guanlilunwen/ydhl/2191989.html
