Yang, B;
Xu, Z;
Chai, W;
Weifa, L;
Tuncer, D;
Galis, A;
Pavlou, G;
(2018)
Algorithms for Fault-Tolerant Placement of Stateful Virtualized Network Functions.
In:
2018 IEEE International Conference on Communications (ICC).
IEEE
Preview |
Text
ICC_1570408517_cameraready.pdf - Accepted Version Download (509kB) | Preview |
Abstract
Traditional network functions (NFs) such as firewalls are implemented in costly dedicated hardware. By decoupling NFs from physical devices, network function virtualization enables virtual network functions (VNF) to run in virtual machines (VMs). However, VNFs are vulnerable to various faults such as software and hardware failures. To enhance VNF fault tolerance, the deployment of backup VNFs in stand-by VM instances is necessary. In case of stateful VNFs, stand-by instances require constant state updates from active instances during its operation. This will guarantee a correct and seamless handover from failed instances to stand-by instances after failures. Nevertheless, such state updates to stand-by instances could consume significant network bandwidth resources and lead to potential admission failures for VNF requests. In this paper, we study the fault-tolerant VNF placement problem with the optimization objective of admitting as many requests as possible. In particular, the VNF placement of active/stand-by instances, the request routing paths to active instances, and state transfer paths to stand-by instances are jointly considered. We devise an efficient heuristic algorithm to solve this problem, and propose a bicriteria approximation algorithm with performance guarantees for a special case of the problem. Simulations with realistic settings show that our algorithms can significantly improve the request admission rate compared to conventional approaches.
| Type: | Proceedings paper |
|---|---|
| Title: | Algorithms for Fault-Tolerant Placement of Stateful Virtualized Network Functions |
| Event: | IEEE International Conference on Communications, 20-24 May 2018, Kansas City, USA |
| Location: | Kansas City USA |
| Dates: | 20 May 2018 - 24 May 2018 |
| ISBN-13: | 978-1-5386-3180-5 |
| Open access status: | An open access version is available from UCL Discovery |
| DOI: | 10.1109/ICC.2018.8422444 |
| Publisher version: | https://doi.org/10.1109/ICC.2018.8422444 |
| Language: | English |
| Additional information: | This version is the author accepted manuscript. For information on re-use, please refer to the publisher’s terms and conditions. |
| Keywords: | Fault tolerance , Fault tolerant systems , Delays , Bandwidth , Routing , Software , Approximation algorithms |
| UCL classification: | UCL UCL > Provost and Vice Provost Offices > UCL BEAMS UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Electronic and Electrical Eng |
| URI: | https://discovery.ucl.ac.uk/id/eprint/10043623 |
Loading...
Loading...Loading...Loading...Archive Staff Only
 |
View Item |
