一种新的IP快速恢复备份拓扑设计方法

Z. Limin, Li Zhe-qing, Wang Hui, L. Peiyu, Chen Xi
{"title":"一种新的IP快速恢复备份拓扑设计方法","authors":"Z. Limin, Li Zhe-qing, Wang Hui, L. Peiyu, Chen Xi","doi":"10.1109/COMPCOMM.2016.7925050","DOIUrl":null,"url":null,"abstract":"A new backup topology design method is proposed in this paper to solve the problem of network congestion during IP fast recovery rerouting. IP fast reroute establishes a series of backup topologies before single network failure, and uses a certain backup topology to reroute. The main previous work develops a method which determines the Key Nodes in process of creating the backup topology to separate traffic on high load links to the other links, utilizing the network topology and traffic matrix. In this paper, a new method to determine Key Nodes is designed, whose main idea is to select the Key Nodes according to the Betweenness Centrality and Closeness of nodes in backup topology, and then maximizes available links of Key Nodes. The experimental results show that maximum link load reduction is approximately 73% compared with the state of conventional algorithm, and maximum reduced hops is about 45% when single link failure. In addition, considering the location of the Key Nodes for a large network is a better strategy when using the Closeness algorithm to select the Key Nodes.","PeriodicalId":210833,"journal":{"name":"2016 2nd IEEE International Conference on Computer and Communications (ICCC)","volume":"302 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"A new backup topology design method for IP fast recovery\",\"authors\":\"Z. Limin, Li Zhe-qing, Wang Hui, L. Peiyu, Chen Xi\",\"doi\":\"10.1109/COMPCOMM.2016.7925050\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new backup topology design method is proposed in this paper to solve the problem of network congestion during IP fast recovery rerouting. IP fast reroute establishes a series of backup topologies before single network failure, and uses a certain backup topology to reroute. The main previous work develops a method which determines the Key Nodes in process of creating the backup topology to separate traffic on high load links to the other links, utilizing the network topology and traffic matrix. In this paper, a new method to determine Key Nodes is designed, whose main idea is to select the Key Nodes according to the Betweenness Centrality and Closeness of nodes in backup topology, and then maximizes available links of Key Nodes. The experimental results show that maximum link load reduction is approximately 73% compared with the state of conventional algorithm, and maximum reduced hops is about 45% when single link failure. In addition, considering the location of the Key Nodes for a large network is a better strategy when using the Closeness algorithm to select the Key Nodes.\",\"PeriodicalId\":210833,\"journal\":{\"name\":\"2016 2nd IEEE International Conference on Computer and Communications (ICCC)\",\"volume\":\"302 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 2nd IEEE International Conference on Computer and Communications (ICCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/COMPCOMM.2016.7925050\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 2nd IEEE International Conference on Computer and Communications (ICCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COMPCOMM.2016.7925050","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

针对IP快速恢复重路由过程中出现的网络拥塞问题,提出了一种新的备份拓扑设计方法。IP快速重路由是在单个网络故障前建立一系列备份拓扑,并使用一定的备份拓扑进行重路由。先前的主要工作开发了一种方法,在创建备份拓扑的过程中确定关键节点,利用网络拓扑和流量矩阵将高负载链路上的流量分离到其他链路上。本文设计了一种新的关键节点确定方法,其主要思想是根据备份拓扑中节点的中间性、中心性和接近性来选择关键节点,从而使关键节点的可用链路最大化。实验结果表明,与传统算法相比,该算法最大链路负载减少约73%,单链路故障时最大跳数减少约45%。此外,在使用close算法选择关键节点时,考虑大型网络中关键节点的位置是一种更好的策略。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A new backup topology design method for IP fast recovery
A new backup topology design method is proposed in this paper to solve the problem of network congestion during IP fast recovery rerouting. IP fast reroute establishes a series of backup topologies before single network failure, and uses a certain backup topology to reroute. The main previous work develops a method which determines the Key Nodes in process of creating the backup topology to separate traffic on high load links to the other links, utilizing the network topology and traffic matrix. In this paper, a new method to determine Key Nodes is designed, whose main idea is to select the Key Nodes according to the Betweenness Centrality and Closeness of nodes in backup topology, and then maximizes available links of Key Nodes. The experimental results show that maximum link load reduction is approximately 73% compared with the state of conventional algorithm, and maximum reduced hops is about 45% when single link failure. In addition, considering the location of the Key Nodes for a large network is a better strategy when using the Closeness algorithm to select the Key Nodes.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Secure routing in IoT with multi-objective simulated annealing Modeling of TCM packing robot and its kinematics simulation and optimization Iterative decision-directed channel estimation for MIMO-OFDM system A systemic performance evaluation method for Residue Number System A dynamic hierarchical quotient topology model based optimal path finding algorithm in complex networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1