Energy-efficient path allocation heuristic for service function chaining
- 1 February 2018
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
Abstract
Service Function Chaining (SFC) is a service deployment concept that promises cost efficiency and increases flexibility for computer networks. On the other hand, Software Defined Networking (SDN) provides a powerful infrastructure to implement SFC. In this paper, we mathematically formulate the SFC problem in SDN-based networks. In this way, the energy consumption of the network is minimized while the traffic congestion is controlled through network reconfiguration. Additionally, a low complex heuristic algorithm is proposed to find a near-optimal solution for the mentioned problem. Simulation results show that the proposed heuristic reconfigures the network in a way that the energy consumption is near-optimal while the SFC requirements are met. Besides, the computational complexity is very low which makes it applicable for real-world networks.Keywords
This publication has 10 references indexed in Scilit:
- Optimal virtual network function placement in multi-cloud service function chaining architectureComputer Communications, 2017
- An Approach for Service Function Chain Routing and Virtual Function Network Instance Migration in Network Function Virtualization ArchitecturesIEEE/ACM Transactions on Networking, 2017
- Neo-NSH: Towards scalable and efficient dynamic service function chaining of elastic network functions2017
- An Approximation Algorithm for Path Computation and Function Placement in SDNs2016
- Robust embedding of VNF/service chains with delay bounds2016
- Co-Scaler: Cooperative scaling of software-defined NFV service function chain2016
- Service Function Chaining in Next Generation Networks: State of the Art and Research ChallengesIEEE Communications Magazine, 2016
- On orchestrating virtual network functions2015
- Virtual Network Embedding: A SurveyIEEE Communications Surveys & Tutorials, 2013
- Joint VM placement and routing for data center traffic engineering2012