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.
Moreover, recently in another work @cite_17 , the authors address the resource allocation and total energy minimization over the Fog Nodes by proposing a novel QoS-aware distributed and scalable scheduler. Although based on the authors’ claim that it can be applied in real-time services, it fails to address the chain of services when it faces fault and failure in such a dynamic network. Interestingly, our architecture, FRFP, can cover all the benefits of this method by covering all the limitations addressed. The most recent method similar to our current work is our previous work @cite_12 on SFC management in SDNs NFVs. We present energy-aware resource reallocation SFC algorithms for SDNs. We allocate VNF to a set of flows and find several optimal and near-optimal solutions to optimize such network. Compared to our contribution, the paper @cite_12 has several limitations: (i) the presented routing algorithms do not exploit the capability of routing all flows simultaneously, i.e., it is impossible to reroute a flow considering the possible routes of other flows; and, (ii), we did not adopt the fog nodes to support fault probability minimization and failure recovery prevention.
@cite_12 @cite_17
2962948535 2335146458
Service function chaining (SFC) allows the forwarding of traffic flows along a chain of virtual network functions (VNFs). Software defined networking (SDN) solutions can be used to support SFC to reduce both the management complexity and the operational costs. One of the most critical issues for the service and network providers is the reduction of energy consumption, which should be achieved without impacting the Quality of Service. In this paper, we propose a novel resource allocation architecture which enables energy-aware SFC for SDN-based networks, considering also constraints on delay, link utilization, server utilization. To this end, we formulate the problems of VNF placement, allocation of VNFs to flows, and flow routing as integer linear programming (ILP) optimization problems. Since the formulated problems cannot be solved (using ILP solvers) in acceptable timescales for realistic problem dimensions, we design a set of heuristic to find near-optimal solutions in timescales suitable for practical applications. We numerically evaluate the performance of the proposed algorithms over a real-world topology under various network traffic patterns. Our results confirm that the proposed heuristic algorithms provide near-optimal solutions (at most 14 optimality-gap) while their execution time makes them usable for real-life networks. Data centers are a cost-effective infrastructure for hosting Cloud and Grid applications, but they do incur tremendous energy cost and CO2 emissions. Today's data center network architectures such as Fat-tree and BCube are over-provisioned to guarantee large network capacity and meet peak performance requirement. Networks suffer from inefficient power usage when data center traffic is not high. A solution to this problem is the adoption of network management platform such as OpenNaaS, which can be augmented with energy-aware capabilities. We developed a component for energy monitoring and routing in OpenNaaS. Energy-aware OpenNaaS can support different types of OpenFlow controller; it inherits and enhances network management capabilities, e.g. dynamically obtaining power and topology.In this paper we also discuss the evaluation and selection of energy-aware routing strategies based on an initial prototype of energy-aware OpenNaaS. The target strategies are fine-grained as they combine flow routing algorithms that make routing decisions for the flows and flow scheduling algorithms that schedule the flows on the same link. Differently from previous routing work which focuses on power-minimization problem in data center networks, we aim to optimize energy consumption. Our simulation shows that the combination of priority-based shortest routing and exclusive flow scheduling achieves about 5 -35 higher energy efficiency without performance degradation. Network function virtualization (NFV) has been introduced by network service providers to overcome various challenges that hinder them from satisfying the growing demand for networking services with higher return-on-investment. The association of NFV with the leading technologies of information technology virtualization and software defined networking is paving the way for flexible and dynamic orchestration of the VNFs, but still, various challenges need to be addressed. The VNFs instantiation and placement problems on data center’s (DC) servers are key enablers to achieve the desired flexible and dynamic NFV applications. In this paper, we have addressed the VNF placement problem by providing a novel mixed integer linear programming (MILP) optimization model and a novel heuristic solution, Betweenness centrality Algorithm for Component Orchestration of NFV platform (BACON), for small- and large-scale DC networks. The proposed solution addresses the VNF placement while taking into consideration the carrier-grade nature of the NFV applications and at the same time, minimizing the intra- and end-to-end delays of the service function chain (SFC). Also, the proposed approach enhances the reliability and the quality of service (QoS) of the SFC by maximizing the count of the functional group members. To evaluate the performance of the proposed solution, this paper conducts a comparative analysis with an NFV-agnostic algorithm and a greedy-k-NFV approach, which is proposed in the literature work. Also, this paper defines the complexity and the order of magnitude of the MILP model and BACON. BACON outperforms the greedy algorithms especially the greedy-k-NFV solution and has a lower complexity, which is calculated as @math . The simulation results show that finding an optimized VNF placement can achieve minimal SFCs delays and enhance the QoS accordingly. Vehicular Adhoc Networks (VANETs) have been attracted a lot of research recent years. Although VANETs are deployed in reality offering several services, the current architecture has been facing many difficulties in deployment and management because of poor connectivity, less scalability, less flexibility and less intelligence. We propose a new VANET architecture called FSDN which combines two emergent computing and network paradigm Software Defined Networking (SDN) and Fog Computing as a prospective solution. SDN-based architecture provides flexibility, scalability, programmability and global knowledge while Fog Computing offers delay-sensitive and location-awareness services which could be satisfy the demands of future VANETs scenarios. We figure out all the SDN-based VANET components as well as their functionality in the system. We also consider the system basic operations in which Fog Computing are leveraged to support surveillance services by taking into account resource manager and Fog orchestration models. The proposed architecture could resolve the main challenges in VANETs by augmenting Vehicle-to-Vehicle (V2V), Vehicle-to-Infrastructure (V2I), Vehicle-to-Base Station communications and SDN centralized control while optimizing resources utility and reducing latency by integrating Fog Computing. Two use-cases for non-safety service (data streaming) and safety service (Lane-change assistance) are also presented to illustrate the benefits of our proposed architecture.