{"title":"Flow splitting approach for path provisioning and path protection problems","authors":"R. Izmailov, D. Niculescu","doi":"10.1109/HPSR.2002.1024215","DOIUrl":null,"url":null,"abstract":"We consider off-line versions of path provisioning and path protection problems for general circuit switched networks. Both problems deal with a given network topology and a list of integral demand flows. The objective is to route the flows and to allocate the bandwidth in a way that minimizes the total amount of bandwidth used for working and protection paths. We consider path-based protection where, in the case of a single link failure, all the flows utilizing the failed link can be rerouted to a precomputed set of paths. We demonstrate that flow splitting can bring significant advantages for both provisioning and protection problems. Since the problem is NP-complete, we propose and analyze two simple heuristics. We show that one of these heuristics performs almost as well as the optimal solution.","PeriodicalId":180090,"journal":{"name":"Workshop on High Performance Switching and Routing, Merging Optical and IP Technologie","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Workshop on High Performance Switching and Routing, Merging Optical and IP Technologie","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HPSR.2002.1024215","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7
Abstract
We consider off-line versions of path provisioning and path protection problems for general circuit switched networks. Both problems deal with a given network topology and a list of integral demand flows. The objective is to route the flows and to allocate the bandwidth in a way that minimizes the total amount of bandwidth used for working and protection paths. We consider path-based protection where, in the case of a single link failure, all the flows utilizing the failed link can be rerouted to a precomputed set of paths. We demonstrate that flow splitting can bring significant advantages for both provisioning and protection problems. Since the problem is NP-complete, we propose and analyze two simple heuristics. We show that one of these heuristics performs almost as well as the optimal solution.