基于概率保护的网络服务延迟感知备份资源分配

Shinya Horimoto, Fujun He, E. Oki
{"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}
引用次数: 0

摘要

在考虑业务延迟的情况下,提出了一种虚拟网络功能(VNFs)的备份资源分配模型。当主用主机出现随机故障时,故障主机上的VNFs由备份主机恢复,并提前确定分配。我们引入概率保护,其中备份主机提供的保护失败的概率被限制在给定的值内;它允许备份资源共享,以减少所需的总计算容量。前人采用鲁棒优化方法将不考虑服务延迟的备份资源分配问题表述为一个混合整数线性规划问题。我们考虑服务延迟,它包括主机之间的网络延迟和每个请求VNF的处理延迟。服务的总延迟超过其阈值的概率被限制在给定的值内。为了解决具有延迟约束的问题,我们引入了一种具有两种方法的算法,使MILP问题能够感知到服务延迟。结果表明,与基线相比,所提出的模型可以降低计算资源所需的总备份容量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信