UCL  IRIS
Institutional Research Information Service
UCL Logo
Please report any queries concerning the funding data grouped in the sections named "Externally Awarded" or "Internally Disbursed" (shown on the profile page) to your Research Finance Administrator. Your can find your Research Finance Administrator at https://www.ucl.ac.uk/finance/research/rs-contacts.php by entering your department
Please report any queries concerning the student data shown on the profile page to:

Email: portico-services@ucl.ac.uk

Help Desk: http://www.ucl.ac.uk/ras/portico/helpdesk
Publication Detail
Algorithms for Fault-Tolerant Placement of Stateful Virtualized Network Functions
  • Publication Type:
    Conference
  • Authors:
    Yang B, Xu Z, Chai W, Weifa L, Tuncer D, Galis A, Pavlou G
  • Publisher:
    IEEE
  • Publication date:
    31/07/2018
  • Place of publication:
    IEEE International Conference on Communications, 20-24 May 2018, Kansas City, MO, USA; http://icc2018.ieee-icc.org/content/welcome-ieee-icc-2018
  • Published proceedings:
    2018 IEEE International Conference on Communications (ICC)
  • Status:
    Published
  • Name of conference:
    IEEE International Conference on Communications
  • Conference place:
    Kansas City USA
  • Conference start date:
    20/05/2018
  • Conference finish date:
    24/05/2018
  • Print ISSN:
    0043-2199
  • Keywords:
    Algorithms for Fault-Tolerant Placement, Virtual Network Functions
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.
Publication data is maintained in RPS. Visit https://rps.ucl.ac.uk
 More search options
UCL Researchers
Author
Dept of Electronic & Electrical Eng
Author
Dept of Electronic & Electrical Eng
University College London - Gower Street - London - WC1E 6BT Tel:+44 (0)20 7679 2000

© UCL 1999–2011

Search by