{"title":"A Combinatorial Reliability Analysis of Generic Service Function Chains in Data Center Networks","authors":"Anna Engelmann, A. Jukan","doi":"10.1145/3477046","DOIUrl":null,"url":null,"abstract":"\n In data center networks, the reliability of Service Function Chain (SFC)—an end-to-end service presented by a chain of virtual network functions (VNFs)—is a complex and specific function of placement, configuration, and application requirements, both in hardware and software. Existing approaches to reliability analysis do not jointly consider multiple features of system components, including, (i) heterogeneity, (ii) disjointness, (iii) sharing, (iv) redundancy, and (v) failure interdependency. To this end, we develop a novel analysis of service reliability of the so-called\n generic SFC,\n consisting of\n n\n =\n k\n +\n r\n sub-SFCs, whereby\n k\n ≥ 1 and\n r\n ≥ 0 are the numbers of arbitrary placed primary and backup (redundant) sub-SFCs, respectively. Our analysis is based on combinatorics and a reduced binomial theorem—resulting in a simple approach, which, however, can be utilized to analyze rather complex SFC configurations. The analysis is practically applicable to various VNF placement strategies in arbitrary data center configurations, and topologies and can be effectively used for evaluation and optimization of reliable SFC placements.\n","PeriodicalId":56350,"journal":{"name":"ACM Transactions on Modeling and Performance Evaluation of Computing Systems","volume":"35 4 1","pages":"9:1-9:24"},"PeriodicalIF":0.7000,"publicationDate":"2021-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Transactions on Modeling and Performance Evaluation of Computing Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3477046","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 1
Abstract
In data center networks, the reliability of Service Function Chain (SFC)—an end-to-end service presented by a chain of virtual network functions (VNFs)—is a complex and specific function of placement, configuration, and application requirements, both in hardware and software. Existing approaches to reliability analysis do not jointly consider multiple features of system components, including, (i) heterogeneity, (ii) disjointness, (iii) sharing, (iv) redundancy, and (v) failure interdependency. To this end, we develop a novel analysis of service reliability of the so-called
generic SFC,
consisting of
n
=
k
+
r
sub-SFCs, whereby
k
≥ 1 and
r
≥ 0 are the numbers of arbitrary placed primary and backup (redundant) sub-SFCs, respectively. Our analysis is based on combinatorics and a reduced binomial theorem—resulting in a simple approach, which, however, can be utilized to analyze rather complex SFC configurations. The analysis is practically applicable to various VNF placement strategies in arbitrary data center configurations, and topologies and can be effectively used for evaluation and optimization of reliable SFC placements.
在数据中心网络中,业务功能链(SFC)的可靠性是一个复杂而具体的功能,涉及硬件和软件的放置、配置和应用需求。业务功能链是由一系列虚拟网络功能链(VNFs)提供的端到端服务。现有的可靠性分析方法没有联合考虑系统组件的多种特征,包括:(i)异质性,(ii)不连接性,(iii)共享性,(iv)冗余性和(v)故障相互依赖性。为此,我们对所谓的通用SFC的服务可靠性进行了新的分析,该分析由n = k + r个子SFC组成,其中k≥1和r≥0分别是任意放置的主和备份(冗余)子SFC的数量。我们的分析基于组合学和简化二项式定理——这产生了一种简单的方法,然而,它可以用来分析相当复杂的SFC配置。该分析实际适用于任意数据中心配置和拓扑中的各种VNF放置策略,可以有效地用于评估和优化可靠的SFC放置。