Optimizing multi-path routing by avoiding Key Nodes

Yang Junlong, Yuan Hewei
{"title":"Optimizing multi-path routing by avoiding Key Nodes","authors":"Yang Junlong, Yuan Hewei","doi":"10.1109/ICBNMT.2009.5347851","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a new routing algorithm which combines source routing and intermediate routing in order to meet the requirement of node disjointed path and scalability. We also discover the existing of Key Nodes which we call KN, KN are the transmission congestion host spots, also in multi-path routing, they will lead to a low performance in disjointed path. We give a simple, effective method to detect KN and avoid them. The result of simulation shows that this method can obtain a good performance on disjointed path, and can significantly improve network reliability.","PeriodicalId":267128,"journal":{"name":"2009 2nd IEEE International Conference on Broadband Network & Multimedia Technology","volume":"66 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 2nd IEEE International Conference on Broadband Network & Multimedia Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICBNMT.2009.5347851","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

In this paper, we propose a new routing algorithm which combines source routing and intermediate routing in order to meet the requirement of node disjointed path and scalability. We also discover the existing of Key Nodes which we call KN, KN are the transmission congestion host spots, also in multi-path routing, they will lead to a low performance in disjointed path. We give a simple, effective method to detect KN and avoid them. The result of simulation shows that this method can obtain a good performance on disjointed path, and can significantly improve network reliability.
避开关键节点优化多路径路由
为了满足节点不相交路径和可扩展性的要求,本文提出了一种源路由和中间路由相结合的路由算法。我们还发现了关键节点的存在,我们称之为KN, KN是传输拥塞的主机点,同样在多路径路由中,它们也会导致不相交路径的性能降低。给出了一种简单有效的检测和避免KN的方法。仿真结果表明,该方法能在不相交路径上获得良好的性能,显著提高网络的可靠性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信