{"title":"多层网络中的备用容量分配","authors":"Yu Liu, D. Tipper, K. Vajanapoom","doi":"10.1109/DRCN.2005.1563876","DOIUrl":null,"url":null,"abstract":"In this paper, we consider the problem of provisioning spare capacity in multi-layer backbone networks in order to meet survivability requirements. A matrix based model is presented showing how failure propagation can be mapped across network layers. Two different multilayer spare capacity allocation optimization problems are formulated utilizing the failure propagation matrix to determine the location and amount of spare capacity in each network layer. In order to scale the models a fast and efficient approximation algorithm based on our early successive survivable routing (SSR) technique is developed. Numerical results for a variety of networks show that near optimal solutions are found by the proposed heuristic algorithm.","PeriodicalId":415896,"journal":{"name":"DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005.","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Spare capacity allocation in multi-layer networks\",\"authors\":\"Yu Liu, D. Tipper, K. Vajanapoom\",\"doi\":\"10.1109/DRCN.2005.1563876\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we consider the problem of provisioning spare capacity in multi-layer backbone networks in order to meet survivability requirements. A matrix based model is presented showing how failure propagation can be mapped across network layers. Two different multilayer spare capacity allocation optimization problems are formulated utilizing the failure propagation matrix to determine the location and amount of spare capacity in each network layer. In order to scale the models a fast and efficient approximation algorithm based on our early successive survivable routing (SSR) technique is developed. Numerical results for a variety of networks show that near optimal solutions are found by the proposed heuristic algorithm.\",\"PeriodicalId\":415896,\"journal\":{\"name\":\"DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005.\",\"volume\":\"45 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-12-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"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.1563876\",\"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.1563876","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In this paper, we consider the problem of provisioning spare capacity in multi-layer backbone networks in order to meet survivability requirements. A matrix based model is presented showing how failure propagation can be mapped across network layers. Two different multilayer spare capacity allocation optimization problems are formulated utilizing the failure propagation matrix to determine the location and amount of spare capacity in each network layer. In order to scale the models a fast and efficient approximation algorithm based on our early successive survivable routing (SSR) technique is developed. Numerical results for a variety of networks show that near optimal solutions are found by the proposed heuristic algorithm.