%0 Journal Article %1 shinichikuribayashiseikeiuniversity2018virtual %A Shin-ichi Kuribayashi, Seikei University, Japan %D 2018 %E Meghanathan, Natarajan %J International Journal of Computer Networks & Communications (IJCNC) %K NFV, allocation, cost function, minimum network resource routing total virtual %N 1 %P 35-44 %R 10.5121/ijcnc.2018.10103 %T Virtual Routing Function Deployment in NFV Based Networks Under Network Delay Constraints %U http://aircconline.com/ijcnc/V10N1/10118cnc03.pdf %V 10 %X 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 NFV based 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.

@article{shinichikuribayashiseikeiuniversity2018virtual, 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 NFV based 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. }, added-at = {2018-02-19T02:07:07.000+0100}, author = {{Shin-ichi Kuribayashi, Seikei University}, Japan}, biburl = {https://www.bibsonomy.org/bibtex/26b05129e2d0a8f079ae9bd0c82aff9e9/laimbee}, doi = {10.5121/ijcnc.2018.10103}, editor = {Meghanathan, Natarajan}, interhash = {1365c5dfb0d79e2fc043c28d001d01e3}, intrahash = {6b05129e2d0a8f079ae9bd0c82aff9e9}, issn = {0974-9322}, journal = {International Journal of Computer Networks & Communications (IJCNC)}, keywords = {NFV, allocation, cost function, minimum network resource routing total virtual}, language = {English}, month = {January }, number = 1, pages = {35-44}, timestamp = {2018-02-19T02:07:07.000+0100}, title = {Virtual Routing Function Deployment in NFV Based Networks Under Network Delay Constraints}, url = {http://aircconline.com/ijcnc/V10N1/10118cnc03.pdf}, volume = 10, year = 2018 }