On the Trade-Off between Computational Load and Reliability for Network Function Virtualization
Abstract
Network Function Virtualization (NFV) enables the "softwarization" of network functions, which are implemented on virtual machines hosted on Commercial off-the-shelf (COTS) servers. Both the composition of the virtual network functions (VNFs) into a forwarding graph (FG) at the logical layer and the embedding of the FG on the servers need to take into account the less-than-carrier-grade reliability of COTS components. This work investigates the trade-off between end-to-end reliability and computational load per server via the joint design of VNF chain composition (CC) and FG embedding (FGE) under the assumption of a bipartite FG that consists of controller and regular VNFs. Evaluating the reliability criterion within a probabilistic model, analytical insights are first provided for a simplified disconnected FG. Then, a block coordinate descent method based on mixed-integer linear programming is proposed to tackle the joint optimization of CC and FGE. Via simulation results, it is observed that a joint design of CC and FGE leads to substantial performance gains compared to separate optimization approaches.
Cite
@article{arxiv.1704.06864,
title = {On the Trade-Off between Computational Load and Reliability for Network Function Virtualization},
author = {Jinkyu Kang and Osvaldo Simeone and Joonhyuk Kang},
journal= {arXiv preprint arXiv:1704.06864},
year = {2017}
}
Comments
It is accepted for publications on IEEE Communications Letters