{"title":"基于p环的多域网络保护方案","authors":"Arnold Farkas, J. Szigeti, T. Cinkler","doi":"10.1109/DRCN.2005.1563870","DOIUrl":null,"url":null,"abstract":"In multi-domain networks, the domains are typically run by different operators, which do not want to share all the internal information with competitors. Furthermore, broadcasting all the internal informations would unnecessarily overload the network with state messages. We decompose the multi-domain resilience problem into two sub-problems, namely the higher level inter-domain protection, and the lower level intra-domain protection. Building p-cycles at the higher level is accomplished by certain tasks at the lower level including straddling link connection, capacity allocation, and path selection. We show that p-cycles offer high availability and acceptable resource usage without the knowledge of paths that makes p-cycles very good candidate for protecting inter-domain traffic.","PeriodicalId":415896,"journal":{"name":"DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005.","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"27","resultStr":"{\"title\":\"P-cycle based protection schemes for multi-domain networks\",\"authors\":\"Arnold Farkas, J. Szigeti, T. Cinkler\",\"doi\":\"10.1109/DRCN.2005.1563870\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In multi-domain networks, the domains are typically run by different operators, which do not want to share all the internal information with competitors. Furthermore, broadcasting all the internal informations would unnecessarily overload the network with state messages. We decompose the multi-domain resilience problem into two sub-problems, namely the higher level inter-domain protection, and the lower level intra-domain protection. Building p-cycles at the higher level is accomplished by certain tasks at the lower level including straddling link connection, capacity allocation, and path selection. We show that p-cycles offer high availability and acceptable resource usage without the knowledge of paths that makes p-cycles very good candidate for protecting inter-domain traffic.\",\"PeriodicalId\":415896,\"journal\":{\"name\":\"DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005.\",\"volume\":\"17 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-12-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"27\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DRCN.2005.1563870\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DRCN.2005.1563870","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
P-cycle based protection schemes for multi-domain networks
In multi-domain networks, the domains are typically run by different operators, which do not want to share all the internal information with competitors. Furthermore, broadcasting all the internal informations would unnecessarily overload the network with state messages. We decompose the multi-domain resilience problem into two sub-problems, namely the higher level inter-domain protection, and the lower level intra-domain protection. Building p-cycles at the higher level is accomplished by certain tasks at the lower level including straddling link connection, capacity allocation, and path selection. We show that p-cycles offer high availability and acceptable resource usage without the knowledge of paths that makes p-cycles very good candidate for protecting inter-domain traffic.