VIRTUAL ROUTING FUNCTION DEPLOYMENT IN NFV-BASED NETWORKS UNDER NETWORK DELAY CONSTRAINTS

Shin-ichi Kuribayashi

Department of Computer and Information Science, Seikei University, Japan 

ABSTRACT

NFV-based network implements a variety of network functions with software on general-purpose servers and this allows the network operator to select any capacity and location of network functions without any physical constraints. The authors proposed an algorithm of virtual routing function allocation in the NFVbased network for minimizing the total power consumption or the total network cost, and developed effective allocation guidelines for virtual routing functions. This paper evaluates the effect of the maximum tolerable network delay on the guidelines for the allocation of virtual routing functions, which minimizes the total network cost. The following points are clear from quantitative evaluations: (1) The shorter the maximum tolerable network delay, the greater the number of areas where the routing function must be allocated, resulting in an increase in the total network cost. (2) The greater the routing function cost relative to the circuit bandwidth cost, the greater the increase in the total network cost caused by the maximum tolerable network delay. This paper also provides the possible guideline how to decide the value of maximum tolerable network delay when the condition of allowable increase in network cost is given. 

KEYWORDS

NFV, resource allocation, virtual routing function, minimum total network cost