An Approximation Algorithm for Path Computation and Function Placement in SDNs

Even, Guy; Rost, Matthias; Schmid, Stefan

doi:10.1007/978-3-319-48314-6_24

Cited by 42 publications

(34 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Rost and Schmid study multiple SFCs (forwarding graph) embedding and propose a polynomial‐time approximation algorithm based on random routing techniques with linear programming (LP) relaxation. Even et al provide a randomized approximation algorithm leveraging multicommodity flows for path computation and function placement. Sallam et al focus on the SFC counterpart of standard graph theory problems, such as the minimal weighted SFC path and the SFC maximal flow.…”

Section: Literature Reviewmentioning

confidence: 99%

Robust network function virtualization

Lin

Zhou²

2020

Networks

View full text Add to dashboard Cite

Network function virtualization (NFV) enables on‐demand network function (NF) deployment providing agile and dynamic network services. Through an evaluation metric that quantifies the minimal reliability among all NFs for all demands, service providers and operators may better facilitate flexible NF service recovery and migration, thus offering higher service reliability. In this paper, we present evaluation metrics on NFV reliability and solution approaches to solve robust NFV under random NF‐enabled node failure(s). We demonstrate how to construct an auxiliary NF‐enabled network and its mapping onto the physical substrate network. With the constructed NF‐enabled network, we develop pseudo‐polynomial algorithms to solve the robust NF and SFC s − t path problems: subproblems of robust NFV. We also present approximation algorithms for robust NFV with the SFC‐Fork as the NF forwarding graph. Furthermore, we propose exact solution approaches via mixed‐integer linear programming under the general setting. Computational results show that our proposed solution approaches are capable of managing robust NFV in a large‐size network.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Robust network function virtualization

Lin

Zhou²

2020

Networks

View full text Add to dashboard Cite

show abstract

“…We categorized the existing solution into two parts, in which, at first, we address the SFC algorithms, [6][7][8][9][10][11][12][13][14][15][16][17][18][19][20][21][22][23] and then in the second part, we describe the solutions and handle the failures and faults in SDNs/NFVs. We categorized the existing solution into two parts, in which, at first, we address the SFC algorithms, [6][7][8][9][10][11][12][13][14][15][16][17][18][19][20][21][22][23] and then in the second part, we describe the solutions and handle the failures and faults in SDNs/NFVs.…”

Section: Related Workmentioning

confidence: 99%

“…In the following, we briefly discuss the main literature on NFVs/SDNs and service function changing related to our work. We categorized the existing solution into two parts, in which, at first, we address the SFC algorithms, [6][7][8][9][10][11][12][13][14][15][16][17][18][19][20][21][22][23] and then in the second part, we describe the solutions and handle the failures and faults in SDNs/NFVs. [24][25][26][27][28][29][30][31][32][33][34][35]…”

Section: Related Workmentioning

confidence: 99%

“…Consequently, numerous works focus on providing SFC in SDNs. An SFC taxonomy that considers architecture and performance dimensions as the basis for the subsequent state-of-the-art analysis was introduced in the work of Medhat et al 6 Bhamare et al 7 15 an approximation algorithm for path computation and function placement in SDNs was proposed. Similar to the work of Bari et al, 14 they proposed a randomized approximation algorithm for path computation and function placement.…”

Section: Sfc Solutions In Sdns/nfvsmentioning

confidence: 99%

“…Zhang et al9 proposed a heuristic algorithm to find a solution for service chaining. In the work of Even et al,15 an approximation algorithm for path computation and function placement in SDNs was proposed. Furthermore, AbdelSalam et al 10 introduced a VNF chaining, which is implemented through segment routing in a Linux-based infrastructure.…”

mentioning

confidence: 99%

See 2 more Smart Citations

Software defined service function chaining with failure consideration for fog computing

Tajiki

Shojafar

Akbari

et al. 2018

Concurrency and Computation

View full text Add to dashboard Cite

Middleboxes have become a vital part of modern networks by providing services such as load balancing, optimization of network traffic, and content filtering. A sequence of middleboxes comprising a logical service is called a Service Function Chain (SFC). In this context, the main issues are to maintain an acceptable level of network path survivability and a fair allocation of the resource between different demands in the event of faults or failures. In this paper, we focus on the problems of traffic engineering, failure recovery, fault prevention, and SFC with reliability and energy consumption constraints in Software Defined Networks (SDN). These types of deployments use Fog computing as an emerging paradigm to manage the distributed small-size traffic flows passing through the SDN-enabled switches (possibly Fog Nodes). The main aim of this integration is to support service delivery in real-time failure recovery in an SFC context. First, we present an architecture for Failure Recovery called FRFP; this is a multi-tier structure in which the real-time traffic flows pass through SDN-enabled switches to jointly decrease the network side-effects of flow rerouting and energy consumption of the Fog Nodes. We then mathematically formulate an optimization problem called the Optimal Fast Failure Recovery algorithm (OFFR) and propose a near-optimal heuristic called Heuristic HFFR to solve the corresponding problem in polynomial time. In this way, the reliability of the selected paths are optimized, while the network congestion is minimized. KEYWORDS failure recovery, fog computing (FC), network function virtualization (NFV), resource reallocation, service function chaining (SFC), software defined network (SDN) 1 INTRODUCTION Network Function Virtualization (NFV) paradigm decouples network functions (NFs) from dedicated hardware equipment and provides more flexibility to the owner of an IT infrastructure. NFV consists in a set of different services running on generic hardware (eg, IDS, proxy, deep packet inspection, and firewall) that are chained using the so called Service Function Chaining (SFC) concept. This concept can be applied to industrial environments; in particular, NFV is used in industrial network design in order to reduce exposure to risks, reduce CAPEX/OPEX costs, and minimize future performance issues by basing the infrastructure upon commodity servers and switches. 1 NFV and SFCs offer a great flexibility in the chaining and placement of NFs. The European Telecommunications Standards Institute (ETSI) is driving the standardization of NFV. Software Defined Networking (SDN) complements NFV and is concerned with the decoupling of control plane functionality from packet forwarding devices, allowing a controller to flexibly configure the networking operations in the infrastructure. NFV and SDN require attention to avoid cascading threats as well ascontroller protections, especially for the software applications across the SDN switches that interoperate with the server virtualization and virtual machines (VMs). 2...

show abstract

Virtual function placement for service chaining with partial orders and anti‐affinity rules

et al. 2017

View full text Add to dashboard Cite

Software‐Defined Networking and Network Function Virtualization are two paradigms that offer flexible software‐based network management. Service providers are instantiating Virtualized Network Functions, for example, firewalls, DPIs, gateways—to highly facilitate the deployment and reconfiguration of network services with reduced time‐to‐value. They use Service Function Chaining technologies to dynamically reconfigure network paths traversing physical and virtual network functions. Providing a cost‐efficient virtual function deployment over the network for a set of service chains is a key technical challenge for service providers, and this problem has recently caught much attention from both Industry and Academia. In this article, we propose a formulation of this problem as an Integer Linear Program that allows one to find the best feasible paths and virtual function placement for a set of services with respect to a total financial cost, while taking into account the (total or partial) order constraints for Service Function Chains of each service and other constraints such as end‐to‐end latency, anti‐affinity rules between network functions on the same physical node and resource limitations in terms of network and processing capacities. Furthermore, we propose a heuristic algorithm based on a linear relaxation of the problem that performs close to optimum for large scale instances. © 2017 Wiley Periodicals, Inc. NETWORKS, Vol. 71(2), 97–106 2018

show abstract

An Approximation Algorithm for Path Computation and Function Placement in SDNs

Cited by 42 publications

References 16 publications

Robust network function virtualization

Robust network function virtualization

Software defined service function chaining with failure consideration for fog computing

Virtual function placement for service chaining with partial orders and anti‐affinity rules

Contact Info

Product

Resources

About