{"title":"基于概率保护的网络服务延迟感知备份资源分配","authors":"Shinya Horimoto, Fujun He, E. Oki","doi":"10.1109/HPSR52026.2021.9481815","DOIUrl":null,"url":null,"abstract":"This paper proposes a backup resource allocation model for virtual network functions (VNFs) to minimize the total required backup computing capacity with considering the service delay. If random failures occur to primary hosts, the VNFs in failed hosts are recovered by backup hosts, where the allocation is determined in advance. We introduce the probabilistic protection, where the probability that the protection provided by a backup host fails is limited within a given value; it allows backup resource sharing to reduce the total required computing capacity. The previous work formulated the backup resource allocation problem without considering the service delay as a mixed integer linear programming (MILP) problem by adopting the robust optimization. We consider the delay of services, which consists of networking delay between hosts and processing delay in each requested VNF. The probability that the total delay of a service exceeds its threshold is constrained within a given value. To solve the problem with the delay constraint, we introduce an algorithm with two methods to make the MILP problem be aware of the service delay. The results observe that, compared to the baseline, the proposed model can reduce the total required backup capacity of computing resource.","PeriodicalId":158580,"journal":{"name":"2021 IEEE 22nd International Conference on High Performance Switching and Routing (HPSR)","volume":"84 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Delay-Aware Backup Resource Allocation with Probabilistic Protection for Network Services\",\"authors\":\"Shinya Horimoto, Fujun He, E. Oki\",\"doi\":\"10.1109/HPSR52026.2021.9481815\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes a backup resource allocation model for virtual network functions (VNFs) to minimize the total required backup computing capacity with considering the service delay. If random failures occur to primary hosts, the VNFs in failed hosts are recovered by backup hosts, where the allocation is determined in advance. We introduce the probabilistic protection, where the probability that the protection provided by a backup host fails is limited within a given value; it allows backup resource sharing to reduce the total required computing capacity. The previous work formulated the backup resource allocation problem without considering the service delay as a mixed integer linear programming (MILP) problem by adopting the robust optimization. We consider the delay of services, which consists of networking delay between hosts and processing delay in each requested VNF. The probability that the total delay of a service exceeds its threshold is constrained within a given value. To solve the problem with the delay constraint, we introduce an algorithm with two methods to make the MILP problem be aware of the service delay. The results observe that, compared to the baseline, the proposed model can reduce the total required backup capacity of computing resource.\",\"PeriodicalId\":158580,\"journal\":{\"name\":\"2021 IEEE 22nd International Conference on High Performance Switching and Routing (HPSR)\",\"volume\":\"84 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-06-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 IEEE 22nd International Conference on High Performance Switching and Routing (HPSR)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HPSR52026.2021.9481815\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE 22nd International Conference on High Performance Switching and Routing (HPSR)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HPSR52026.2021.9481815","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Delay-Aware Backup Resource Allocation with Probabilistic Protection for Network Services
This paper proposes a backup resource allocation model for virtual network functions (VNFs) to minimize the total required backup computing capacity with considering the service delay. If random failures occur to primary hosts, the VNFs in failed hosts are recovered by backup hosts, where the allocation is determined in advance. We introduce the probabilistic protection, where the probability that the protection provided by a backup host fails is limited within a given value; it allows backup resource sharing to reduce the total required computing capacity. The previous work formulated the backup resource allocation problem without considering the service delay as a mixed integer linear programming (MILP) problem by adopting the robust optimization. We consider the delay of services, which consists of networking delay between hosts and processing delay in each requested VNF. The probability that the total delay of a service exceeds its threshold is constrained within a given value. To solve the problem with the delay constraint, we introduce an algorithm with two methods to make the MILP problem be aware of the service delay. The results observe that, compared to the baseline, the proposed model can reduce the total required backup capacity of computing resource.