Virtual Routing Function Allocation Method for Minimizing Total Network Power Consumption
In a conventional network, most network devices, such as routers, are dedicated devices that do not have much variation in capacity. In recent years, a new concept of network functions virtualisation (NFV) has come into use. The intention is to implement a variety of network functions with software on general-purpose servers and this allows the network operator to select their capacities and locations without any constraints. This paper focuses on the allocation of NFV-based routing functions which are one of critical network functions, and presents the virtual routing function allocation algorithm that minimizes the total power consumption. In addition, this study presents the useful allocation policy of virtual routing functions, based on an evaluation with a ladder-shaped network model. This policy takes the ratio of the power consumption of a routing function to that of a circuit and traffic distribution between areas into consideration. Furthermore, the present paper shows that there are cases where the use of NFV-based routing functions makes it possible to reduce the total power consumption dramatically, in comparison to a conventional network, in which it is not economically viable to distribute small-capacity routing functions.
[1] M. Chiosi et al., “Network Functions Virtualization - An Introduction, Benefits, Enablers, Challenges and Call for Action,” ETSI NFV, Oct. 2012.
[2] “Network Functions Virtualisation (NFV); Architectual Framework,” ETSI GS NFV 002 v1.2.1, Dec. 2014. file:///C:/Users/Kuribayashi/Downloads/gs_NFV002v010201p.pdf
[3] R. Mijumbi, J. Serrat, J. Gorricho, N. Bouten, F. D. Trurck and R. Boutaba, “Network Function Virtualization: State-of-the-art and Research Challenges,” IEEE Communications Surveys & Tutorials, Vol. 18, Issue 1, pp.236-262, 2016.
[4] A. Fischer, J. F. Botero, M. T. Beck, H. Meer, and X. Hesselbach,” Virtual Network Embedding: A Survey”, IEEE Communications Surveys & Tutorials, Vol. 15, No.4, 2013.
[5] X. Wei, S. Hu, H. Li, F. Yang and Y. Jin, “A Survay on Virtual Network Embedding in Cloud Computing Centers”, The Open Automation and Control Systems Journal, Vol. 6, pp.414-425, 2014.
[6] S. Mehraghdam, M. Keller, and H. Karl, “Specifying and placing chains of virtual network functions,” in Cloud Networking (CloudNet), 2014 IEEE 3rd International Conference on, Oct 2014, pp. 7–13.
[7] H. Moens and F. D. Turck, “VNF-P: A model for efficient placement of virtualized network functions,” in Network and Service Management (CNSM), 2014 10th International Conference on, Nov 2014, pp. 418–423.
[8] A. Basta, W. Kellerer, M. Hoffmann, H. J. Morper, and K. Hoffmann, "Applying NFV and SDN to LTE Mobile Core Gateways; The Functions Placement Problem," 4th Workshop on All Things Cellular: Operations, Applications and Challenges 2014, pp.33-38, Aug. 2014.
[9] M. Bouet, J. Leguay and V. Conan, “Cost-based placement of vDPI functions in NFV infrastructures,” International Journal of Network Management, pp.490-506, 2015.
[10] S. Tsumura and S. Kuribayashi, “Simultaneous allocation of multiple resources for computer communications networks”, APCC2006, 2F-4 (2006.8)
[11] S. Kuribayashi, “Optimal Joint Multiple Resource Allocation Method for Cloud Computing Environments”, International Journal of Research and Reviews in Computer Science (IJRRCS), Vol.2, No.1, pp.1-8, Feb. 2011.
[12] S. Kuribayashi, “Resource Allocation Method for Cloud Computing Environments with Different Service Quality to Users at Multiple Access”, International Journal of Computer Networks & Communications (IJCNC) Vol.7, No.6, pp.33-51, Nov.2015.
[13] R. Mijumbi, J. Serrat, J. Gorricho, N. Boutenz, F. Turckz and S. Davy, “Design and Evaluation of Algorithms for Mapping and Scheduling of Virtual Network Functions,” 1st IEEE Conference on Network Softwarization (NetSoft), pp.1-9, 2015.
[14] S. Clayman, E. Mainiy, A. Galis, A. Manzaliniz and N. Mazzocca, “The Dynamic Placement of Virtual Network Functions, ”IEEE Network Operations and Management Symposium (NOMS),pp.1-9, 2014.
[15] K. Hida and S. Kuribayashi, “Optimal deployment of NFV- based virtual routing function with least total power consumption,” J. Fac. Sci. Tech., Seikei Univ. (Japan), Vol.52 No.2 (2015) (published in Japanese).
[1] M. Chiosi et al., “Network Functions Virtualization - An Introduction, Benefits, Enablers, Challenges and Call for Action,” ETSI NFV, Oct. 2012.
[2] “Network Functions Virtualisation (NFV); Architectual Framework,” ETSI GS NFV 002 v1.2.1, Dec. 2014. file:///C:/Users/Kuribayashi/Downloads/gs_NFV002v010201p.pdf
[3] R. Mijumbi, J. Serrat, J. Gorricho, N. Bouten, F. D. Trurck and R. Boutaba, “Network Function Virtualization: State-of-the-art and Research Challenges,” IEEE Communications Surveys & Tutorials, Vol. 18, Issue 1, pp.236-262, 2016.
[4] A. Fischer, J. F. Botero, M. T. Beck, H. Meer, and X. Hesselbach,” Virtual Network Embedding: A Survey”, IEEE Communications Surveys & Tutorials, Vol. 15, No.4, 2013.
[5] X. Wei, S. Hu, H. Li, F. Yang and Y. Jin, “A Survay on Virtual Network Embedding in Cloud Computing Centers”, The Open Automation and Control Systems Journal, Vol. 6, pp.414-425, 2014.
[6] S. Mehraghdam, M. Keller, and H. Karl, “Specifying and placing chains of virtual network functions,” in Cloud Networking (CloudNet), 2014 IEEE 3rd International Conference on, Oct 2014, pp. 7–13.
[7] H. Moens and F. D. Turck, “VNF-P: A model for efficient placement of virtualized network functions,” in Network and Service Management (CNSM), 2014 10th International Conference on, Nov 2014, pp. 418–423.
[8] A. Basta, W. Kellerer, M. Hoffmann, H. J. Morper, and K. Hoffmann, "Applying NFV and SDN to LTE Mobile Core Gateways; The Functions Placement Problem," 4th Workshop on All Things Cellular: Operations, Applications and Challenges 2014, pp.33-38, Aug. 2014.
[9] M. Bouet, J. Leguay and V. Conan, “Cost-based placement of vDPI functions in NFV infrastructures,” International Journal of Network Management, pp.490-506, 2015.
[10] S. Tsumura and S. Kuribayashi, “Simultaneous allocation of multiple resources for computer communications networks”, APCC2006, 2F-4 (2006.8)
[11] S. Kuribayashi, “Optimal Joint Multiple Resource Allocation Method for Cloud Computing Environments”, International Journal of Research and Reviews in Computer Science (IJRRCS), Vol.2, No.1, pp.1-8, Feb. 2011.
[12] S. Kuribayashi, “Resource Allocation Method for Cloud Computing Environments with Different Service Quality to Users at Multiple Access”, International Journal of Computer Networks & Communications (IJCNC) Vol.7, No.6, pp.33-51, Nov.2015.
[13] R. Mijumbi, J. Serrat, J. Gorricho, N. Boutenz, F. Turckz and S. Davy, “Design and Evaluation of Algorithms for Mapping and Scheduling of Virtual Network Functions,” 1st IEEE Conference on Network Softwarization (NetSoft), pp.1-9, 2015.
[14] S. Clayman, E. Mainiy, A. Galis, A. Manzaliniz and N. Mazzocca, “The Dynamic Placement of Virtual Network Functions, ”IEEE Network Operations and Management Symposium (NOMS),pp.1-9, 2014.
[15] K. Hida and S. Kuribayashi, “Optimal deployment of NFV- based virtual routing function with least total power consumption,” J. Fac. Sci. Tech., Seikei Univ. (Japan), Vol.52 No.2 (2015) (published in Japanese).
@article{"International Journal of Electrical, Electronic and Communication Sciences:73491", author = "Kenichiro Hida and Shin-Ichi Kuribayashi", title = "Virtual Routing Function Allocation Method for Minimizing Total Network Power Consumption", abstract = "In a conventional network, most network devices, such as routers, are dedicated devices that do not have much variation in capacity. In recent years, a new concept of network functions virtualisation (NFV) has come into use. The intention is to implement a variety of network functions with software on general-purpose servers and this allows the network operator to select their capacities and locations without any constraints. This paper focuses on the allocation of NFV-based routing functions which are one of critical network functions, and presents the virtual routing function allocation algorithm that minimizes the total power consumption. In addition, this study presents the useful allocation policy of virtual routing functions, based on an evaluation with a ladder-shaped network model. This policy takes the ratio of the power consumption of a routing function to that of a circuit and traffic distribution between areas into consideration. Furthermore, the present paper shows that there are cases where the use of NFV-based routing functions makes it possible to reduce the total power consumption dramatically, in comparison to a conventional network, in which it is not economically viable to distribute small-capacity routing functions.
", keywords = "Virtual routing function, NFV, resource allocation, minimum power consumption.", volume = "10", number = "8", pages = "1018-6", }
