Paper Info
Title
Joint Failure Recovery, Fault Prevention, and Energy-efficient Resource Management for Real-time SFC in Fog-supported SDN.
Abstract
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, and fault-awareness in an SFC context. Firstly, we present an architecture for Failure Recovery and Fault Prevention 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 Fog-Supported Energy-Aware SFC rerouting algorithm (OFES) and propose a near-optimal heuristic called Heuristic OFES (HFES) to solve the corresponding problem in polynomial time. In this way, the energy consumption and the reliability of the selected paths are optimized, while the Quality of Service (QoS) constraints are met and the network congestion is minimized. In a reliability context, the focus of this work is on fault prevention; however, since we use a reallocation technique, the proposed scheme can be used as a failure recovery scheme. We compare the performance of HFES and OFES in terms of energy consumption, average path length, fault probability, network side-effects, link utilization, and Fog Node utilization. Additionally, we analyze the computational complexity of HFES. We use a real-world network topology to evaluate our algorithm. The simulation results show that the heuristic algorithm is applicable to large-scale networks.
Year
DOI
Venue
2018
10.1016/j.comnet.2019.07.006
Computer Networks
Keywords
Field
DocType
Fog computing (FC),Software defined network (SDN),Network function virtualization (NFV),Service function chaining (SFC),Fault tolerance,Resource reallocation
Average path length,Heuristic,Heuristic (computer science),Computer science,Quality of service,Network topology,Network congestion,Software-defined networking,Energy consumption,Distributed computing
Journal
Volume
ISSN
Citations 
162
1389-1286
4
PageRank 
References 
Authors
0.39
17
6
Name
Order
Citations
PageRank
Tajiki, M.M.1314.62
Mohammad Shojafar255342.31
Behzad Akbari35212.30
Stefano Salsano479978.03
Mauro Conti52430203.80
Mukesh Singhal62602259.07