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}
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.