在可信可控网络中建立可靠的集中域内路由

Tan Jing, Junzhou Luo, Wei Li, Shan Feng
{"title":"在可信可控网络中建立可靠的集中域内路由","authors":"Tan Jing, Junzhou Luo, Wei Li, Shan Feng","doi":"10.1109/INM.2011.5990547","DOIUrl":null,"url":null,"abstract":"Centralized control can improve the consistence of the network and reduce the load of routers. Trustworthy and Controllable Network takes centralized control as one of the basic control mechanisms and requires to build reliable centralized intra-domain routing. In this paper, we solved the problem of building reliable centralized intra-domain routing by finding the routing configuration which maximizes the disjoint paths of each ingress to all egresses. The problem is transformed to finding K paths for each ingress to the egresses. It is proved to be NP- hard to find the optimal solution when K≥2 if ingresses do not cross each other and when K≥3 if the ingresses cross each other. To solve the problem efficiently, a heuristic algorithm based on network flow theory called HANE is proposed and evaluated on different types of topologies. The experimental results show that HANE can achieve good performance.","PeriodicalId":433520,"journal":{"name":"12th IFIP/IEEE International Symposium on Integrated Network Management (IM 2011) and Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Building reliable centralized intra-domain routing in Trustworthy and Controllable Network\",\"authors\":\"Tan Jing, Junzhou Luo, Wei Li, Shan Feng\",\"doi\":\"10.1109/INM.2011.5990547\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Centralized control can improve the consistence of the network and reduce the load of routers. Trustworthy and Controllable Network takes centralized control as one of the basic control mechanisms and requires to build reliable centralized intra-domain routing. In this paper, we solved the problem of building reliable centralized intra-domain routing by finding the routing configuration which maximizes the disjoint paths of each ingress to all egresses. The problem is transformed to finding K paths for each ingress to the egresses. It is proved to be NP- hard to find the optimal solution when K≥2 if ingresses do not cross each other and when K≥3 if the ingresses cross each other. To solve the problem efficiently, a heuristic algorithm based on network flow theory called HANE is proposed and evaluated on different types of topologies. The experimental results show that HANE can achieve good performance.\",\"PeriodicalId\":433520,\"journal\":{\"name\":\"12th IFIP/IEEE International Symposium on Integrated Network Management (IM 2011) and Workshops\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-05-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"12th IFIP/IEEE International Symposium on Integrated Network Management (IM 2011) and Workshops\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INM.2011.5990547\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"12th IFIP/IEEE International Symposium on Integrated Network Management (IM 2011) and Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INM.2011.5990547","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

集中控制可以提高网络的一致性,减少路由器的负载。可信可控网络以集中控制为基本控制机制之一,需要建立可靠的集中域内路由。本文通过寻找使每个入口到所有出口的不相交路径最大化的路由配置,解决了建立可靠的集中式域内路由的问题。这个问题被转化为为每个入口到出口找到K条路径。证明了当K≥2且入口互不相交时,当K≥3且入口互不相交时,最优解是NP-难寻的。为了有效地解决这一问题,提出了一种基于网络流理论的启发式算法——HANE,并对不同类型的拓扑进行了评估。实验结果表明,HANE可以取得良好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Building reliable centralized intra-domain routing in Trustworthy and Controllable Network
Centralized control can improve the consistence of the network and reduce the load of routers. Trustworthy and Controllable Network takes centralized control as one of the basic control mechanisms and requires to build reliable centralized intra-domain routing. In this paper, we solved the problem of building reliable centralized intra-domain routing by finding the routing configuration which maximizes the disjoint paths of each ingress to all egresses. The problem is transformed to finding K paths for each ingress to the egresses. It is proved to be NP- hard to find the optimal solution when K≥2 if ingresses do not cross each other and when K≥3 if the ingresses cross each other. To solve the problem efficiently, a heuristic algorithm based on network flow theory called HANE is proposed and evaluated on different types of topologies. The experimental results show that HANE can achieve good performance.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信