Uma Abordagem Heurística para o Posicionamento e Encadeamento de Funções Virtuais de Rede em Ambientes Online
Abstract
Network Functions Virtualization has emerged to reduce operating costs and provide flexibility to serve the new network services. One of the main challenges in such environments is the placement and chain of the virtual network functions on virtual machines positioned over servers in the network. As an online environment is addressed, the approaches employed must generate a quick decision-making about the mapping, or not, of a network request. In this context, a solution based on Greedy Randomized Adaptive Search Procedure and Variable Neighborhood Search metaheuristics is proposed, and then compared with an exact method. The computational experiments show that the exact method, despite generating higher profits, has a high runtime. On the other hand, the heuristic approach showed a 810% improvement on runtime, reduce the end-to-end delay in 70%, but at the cost of a 25% decrement in the servers sharing, and 11% in profit.
References
Bari, M. F., Chowdhury, S. R., and Boutaba, R. (2019). Esso: An energy smart service function chain orchestrator. IEEE Transactions on Network and Service Management, 16(4):1345–1359.
Cohen, R., Lewin-Eytan, L., Naor, J. S., and Raz, D. (2015). Near optimal placement of virtual network functions. In 2015 IEEE Conference on Computer Communications (INFOCOM), pages 1346–1354.
Feo, T. A. and Resende, M. G. (1995). Greedy randomized adaptive search procedure. Journal of Global Optimization, 6:109–133.
Fischer, A., Bhamare, D., and Kassler, A. (2019). On the construction of optimal In 2019 28th embedding problems for delay-sensitive service function chains. International Conference on Computer Communication and Networks (ICCCN), pages 1–10.
Gao, M., Addis, B., Bouet, M., and Secci, S. (2018). Optimal orchestration of virtual network functions. Computer Networks, 142:108 – 127.
Jia, Y., Wu, C., Li, Z., Le, F., and Liu, A. (2018). Online scaling of nfv service IEEE/ACM Transactions on Networking, chains across geo-distributed datacenters. 26(2):699–710.
Khoshkholghi, M. A., Taheri, J., Bhamare, D., and Kassler, A. (2019). Optimized service In 2019 IEEE Conference on Network chain placement using genetic algorithm. Softwarization (NetSoft), pages 472–479.
Laghrissi, A. and Taleb, T. (2018). A Survey on the Placement of Virtual Resources and Virtual Network Functions. IEEE Communications Surveys Tutorials, pages 1–1.
Li, J., Liang, W., Huang, M., and Jia, X. (2020). Reliability-aware network service IEEE Transactions on Parallel and provisioning in mobile edge-cloud networks. Distributed Systems, pages 1–1.
Luizelli, M. C., da Costa Cordeiro, W. L., Buriol, L. S., and Gaspary, L. P. (2017). A fix-and-optimize approach for efficient and large scale virtual network function placement and chaining. Comput. Commun., 102(C):67–77.
Mijumbi, R., Serrat, J., Gorricho, J. L., Bouten, N., Turck, F. D., and Boutaba, R. (2016). IEEE Network Function Virtualization: State-of-the-Art and Research Challenges. Communications Surveys Tutorials, 18(1):236–262.
Mladenovi´c, N. and Hansen, P. (1997). Variable neighborhood search. Computer and Operations Research, 24(11):1097–1100.
NFV White Paper (2012). Network functions virtualisation: An introduction, benefits, enablers, challenges & call for action. SDN and OpenFlow World Congress.
Sun, Q., Lu, P., Lu, W., and Zhu, Z. (2016). Forecast-assisted nfv service chain In 2016 IEEE Global deployment based on affiliation-aware vnf placement. Communications Conference (GLOBECOM), pages 1–6.
Yi, B., Wang, X., Li, K., k. Das, S., and Huang, M. (2018). A comprehensive survey of network function virtualization. Computer Networks, 133:212 – 262.
