Availability-aware mapping of service function chains

Fan, Jingyuan; Guan, Chaowen; Zhao, Yangming; Qiao, Chunming

doi:10.1109/infocom.2017.8057153

Cited by 126 publications

(45 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Once drawn u (m) (z) by (16), the MUGF u S (z) of a multitenant SFC system is computed by the following series operator u S (z) = σ u (1)…”

Section: The Multidimensional Ugfmentioning

confidence: 99%

“…In order to meet the "five nines" availability requirement for the vIMS, we set A 0 = 1 − 10 −5 and solve numerically the optimization problem (21) by an exhaustive search approach, having imposed a uniform limitation of 4 redundant nodes for each server. A routine (available upon request for non commercial use), written in Mathematica R , implements the proposed MUGF approach: it evaluates the steady-state availability of the vIMS system (9) in every redundancy configuration by computing the MUGF (19) via parallel and series operators (16) and 18, respectively. Then, the…”

Section: A Numerical Examplementioning

confidence: 99%

See 1 more Smart Citation

Availability Evaluation of Multi-Tenant Service Function Chaining Infrastructures by Multidimensional Universal Generating Function

Mauro

Longo

Postiglione

2021

IEEE Trans. Serv. Comput.

View full text Add to dashboard Cite

The Network Function Virtualization (NFV) paradigm has been devised as an enabler of next generation network infrastructures by speeding up the provisioning and the composition of novel network services. The latter are implemented via a chain of virtualized network functions, a process known as Service Function Chaining. In this paper, we evaluate the availability of multi-tenant SFC infrastructures, where every network function is modeled as a multi-state system and is shared among different and independent tenants. To this aim, we propose a Universal Generating Function (UGF) approach, suitably extended to handle performance vectors, that we call Multidimensional UGF. This novel methodology is validated in a realistic multi-tenant telecommunication network scenario, where the service chain is composed by the network elements of an IP Multimedia Subsystem implemented via NFV. A steady-state availability evaluation of such an exemplary system is presented and a redundancy optimization problem is solved, so providing the SFC infrastructure which minimizes deployment cost while respecting a given availability requirement.

show abstract

“…Once drawn u (m) (z) by (16), the MUGF u S (z) of a multitenant SFC system is computed by the following series operator u S (z) = σ u (1)…”

Section: The Multidimensional Ugfmentioning

confidence: 99%

Section: A Numerical Examplementioning

confidence: 99%

Availability Evaluation of Multi-Tenant Service Function Chaining Infrastructures by Multidimensional Universal Generating Function

Mauro

Longo

Postiglione

2021

IEEE Trans. Serv. Comput.

View full text Add to dashboard Cite

show abstract

“…Much recent attention has been focusing on the placement of virtualized network functions (VNF) [23,6,31], traffic steering given placed network functions [26], joint traffic steering and VNF placement [17], availability of service chains [7,36,35], and dynamic network function chaining [32]. For example, Qazi et al developed SIMPLE [26] that enforces high-level routing policies for middlebox-specific traffic, they however did not consider virtualization or dynamic network function placements.…”

Section: Related Workmentioning

confidence: 99%

“…Remarks: The budget B, the number |SC k i | of instances of type-k service chain in data center DC i , and the delay requirement D j of r j determine the violation of constraints (5), (6), and (7) . For example, if N = max i,k,j {|SC k i |, D j , B} = B, budget B has an impact on the violation ratio, which means a larger budget will incur a higher violation of resource constraints because more requests may be admitted.…”

Section: Algorithm Analysismentioning

confidence: 99%

Throughput optimization for admitting NFV-enabled requests in cloud networks

Liang

Galis

et al. 2018

Computer Networks

View full text Add to dashboard Cite

Network softwarization is emerging as a techno-economic transformation trend that impacts the way that network service providers deliver their network services significantly. As a key ingredient of such a trend, network function virtualization (NFV) is shown to enable elastic and inexpensive network services for next-generation networks, through deploying flexible virtualized network functions (VNFs) running in virtual computing platforms. Different VNFs can be chained together to form different service chains for different network services, to meet various user data routing demands. From the service provider point of view, such services are usually implemented by VNF instances in a cloudlet network consisting of a set of data centers and switches. In this paper we consider provisioning network services in a cloud network for implementing VNF instances of service chains, where the VNF instances in each data center are partitioned into K types with each hosting one type of service chain. We investigate the throughput maximization problem with the aim to admit as many user requests as possible while minimizing the implementation cost of the requests, assuming that limited numbers of instances of each service chain have been instantiated in data centers. We first show the problem is NP-Complete, and propose an optimal algorithm for a special case of the problem when all requests have identical packet rates; otherwise, we devise two approximation algorithms with approximation ratios, depending on whether the packet traffic of each request is splittable. If arrivals of future requests are not known in advance, we study the online throughput maximization problem by proposing an online algorithm with a competitive ratio. We finally conduct experiments to evaluate the performance of the proposed algorithms by simulations. Simulation results show that the performance of the proposed algorithms are promising.

show abstract

“…Most of the existing works on redundancy allocation in NFV based networks focus on providing two-nines or three-nines service availability [14], [15]. only a few consider carrier-grade service availability [16], [17].…”

Section: Introductionmentioning

confidence: 99%

Towards Carrier-Grade Service Provisioning in NFV

Woldeyohannes

Tola

Jiang

2019

2019 15th International Conference on the Design of Reliable Communication Networks (DRCN)

View full text Add to dashboard Cite

Network Function Virtualization (NFV) is an emerging technology that reduces cost and brings flexibility in the provisioning of services. NFV-based networks are expected to be able to provide carrier-grade services, which require high availability. One of the challenges for achieving high availability is that the commodity servers used in NFV are more error prone than the purpose-built hardware. The "de-facto" technique for fault tolerance is redundancy. However, unless planned carefully, structural dependencies among network nodes could result in correlated node unavailabilities that undermine the effect of redundancy. In this paper, we address the challenge of developing a redundancy resource allocation scheme that takes into account correlated unavailabilities caused by network structural dependencies. The proposed scheme consist of two parts. In the first part, we propose an algorithm to identify nodes that can be highly affected by a node failure because of their network structural dependency with this node. The algorithm analyzes such dependencies using a recently proposed centrality measure called dependency index. In the second part, a redundancy resource allocation scheme that places backup network functions on nodes considering their dependency nature and assigns the instances to flows optimally is proposed. The results show that not considering the network structural dependency in backup placement may significantly affect the service availability to flows. The results also give insights into the trade-off between cost and performance.

show abstract

Availability-aware mapping of service function chains

Cited by 126 publications

References 13 publications

Availability Evaluation of Multi-Tenant Service Function Chaining Infrastructures by Multidimensional Universal Generating Function

Availability Evaluation of Multi-Tenant Service Function Chaining Infrastructures by Multidimensional Universal Generating Function

Throughput optimization for admitting NFV-enabled requests in cloud networks

Towards Carrier-Grade Service Provisioning in NFV

Contact Info

Product

Resources

About