FH-ACO: Fuzzy heuristic-based ant colony optimization for joint virtual network function placement and routing

被引:62
作者
Shokouhifar, Mohammad [1 ]
机构
[1] Shahid Beheshti Univ, Dept Elect & Comp Engn, Tehran, Iran
关键词
Network function virtualization; Ant colony optimization; Multi-objective optimization; Heuristic information; Fuzzy inference system; SYMBOLIC SIMPLIFICATION; ALGORITHM; NFV; DEPLOYMENT; SYSTEM;
D O I
10.1016/j.asoc.2021.107401
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Network function virtualization (NFV) is a new networking paradigm, which replaces the specific-purpose hardware appliances with software virtualization to perform network functions on general-purpose servers. Due to resource limitation at network servers/links, virtual network function (VNF) placement/routing is one of the main challenges in the NFV architecture. The VNF placement/routing problem has been reported to be NP-hard, and consequently, most of studies have focused on designing heuristics or metaheuristics. In this paper, fuzzy heuristic-based ant colony optimization (named FH-ACO) is introduced as a fuzzy knowledge-based version of ACO to efficiently solve the VNF placement/routing problem. Our motivation is to simultaneously gain with fast speed of heuristics and high solution quality of metaheuristics. In the FH-ACO, two multi-criteria fuzzy inference systems are used as heuristic information to guide artificial ants in appropriate server/link selection during the solution construction phase. To solve the problem, a multi-objective function comprising power consumption, latency, reliability, and load balancing, is used. The proposed FH-ACO algorithm is an application-specific protocol, which can be adaptively tuned based on the application requirements. Simulation results on US and Pan-European network topologies demonstrate the superiority of the proposed FH-ACO algorithm against the existing techniques. (C) 2021 Elsevier B.V. All rights reserved.
引用
收藏
页数:17
相关论文
共 54 条
  • [1] Abkenar GS, 2011, CAN CON EL COMP EN, P826, DOI 10.1109/CCECE.2011.6030571
  • [2] [Anonymous], 2017, P NAACL HLT
  • [3] [Anonymous], 2013, ETSI PUBLISHES 1 SPE
  • [4] SARA: A memetic algorithm for high-dimensional biomedical data
    Baliarsingh, Santos Kumar
    Muhammad, Khan
    Bakshi, Sambit
    [J]. APPLIED SOFT COMPUTING, 2021, 101
  • [5] Chaotic emperor penguin optimised extreme learning machine for microarray cancer classification
    Baliarsingh, Santos Kumar
    Vipsita, Swati
    [J]. IET SYSTEMS BIOLOGY, 2020, 14 (02) : 85 - 95
  • [6] Scalable and coordinated allocation of service function chains
    Beck, Michael Till
    Botero, Juan Felipe
    [J]. COMPUTER COMMUNICATIONS, 2017, 102 : 78 - 88
  • [7] Betker A., 2003, Reference transport network scenarios
  • [8] Optimal virtual network function placement in multi-cloud service function chaining architecture
    Bhamare, Deval
    Samaka, Mohammed
    Erbad, Aiman
    Jain, Raj
    Gupta, Lav
    Chan, H. Anthony
    [J]. COMPUTER COMMUNICATIONS, 2017, 102 : 1 - 16
  • [9] VNF-FG design and VNF placement for 5G mobile networks
    Cao, Jiuyue
    Zhang, Yan
    An, Wei
    Chen, Xin
    Sun, Jiyan
    Han, Yanni
    [J]. SCIENCE CHINA-INFORMATION SCIENCES, 2017, 60 (04)
  • [10] VNF placement for service chaining in a distributed cloud environment with multiple stakeholders
    Cappanera, Paola
    Paganelli, Federica
    Paradiso, Francesca
    [J]. COMPUTER COMMUNICATIONS, 2019, 133 : 24 - 40