ClusVNFI: A Hierarchical Clustering-Based Approach for Solving VNFI Dilemma in NFV Orchestration

被引:3
作者
Chen, Jing [1 ]
Chen, Jia [1 ]
Hu, Renkun [1 ]
Zhang, Hongke [1 ]
机构
[1] Beijing Jiaotong Univ, Dept Elect & Informat Engn, Beijing 100044, Peoples R China
关键词
Clustering; orchestration; multi-objective; VNFI; hierarchical; SERVICE; OPTIMIZATION; PLACEMENT;
D O I
10.1109/ACCESS.2019.2956502
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Network functions virtualization (NFV) is becoming a prevailing design for future Internet by migrating network functions from dedicated hardware appliances to software instances running in virtual computing platforms. NFV resource allocation approaches can dynamically instantiate network functions by using virtualized network functions (VNFs) to satisfy various quality-of-service (QoS) requirements with minimum network costs. The operator can launch a new VNF instance (VNFI) for each VNF required for flows, or assign it to the established VNFI. This makes NFV orchestration (NFVO) even more complicated. In addition, the challenges of developing NFVO scheme include how to manage the dependency between VNFs placement (network-level) and routing of flows (flow-level) through ordered VNFs, and how to efficiently utilize the available network resources. In this paper, ClusVNFI, a hierarchical resource allocation approach based on clustering, is proposed to address these challenges. To be specific, VNFs are proposed to be clustered based on their correlation. Then VNFs belonging to the same cluster are inclined to be deployed on one node to reduce the occupied link bandwidth. Moreover, network nodes are clustered based on the similarity on end-to-end flow latency information. Accordingly, flows in the same cluster intend to share the instantiated VNFIs, aiming at improving VNFI utilization while avoiding path stretch. By capturing the dependency between network-level and flow-level through clustering, ClusVNFI can achieve the tradeoff among multiple objectives including maximizing the number of admitted flows, minimizing path stretch, and improving VNFI utilization. Extensive simulation results show that the proposed ClusVNFI can balance multiple objectives comparing with other typical heuristic algorithms. Moreover, ClusVNFI can reduce network resource occupation effectively, while guaranteeing the average delay and network hops.
引用
收藏
页码:173257 / 173272
页数:16
相关论文
共 50 条
  • [1] On hierarchical clustering-based approach for RDDBS design
    Hassan I. Abdalla
    Ali A. Amer
    Sri Devi Ravana
    Journal of Big Data, 10
  • [2] On hierarchical clustering-based approach for RDDBS design
    Abdalla, Hassan I.
    Amer, Ali A.
    Ravana, Sri Devi
    JOURNAL OF BIG DATA, 2023, 10 (01)
  • [3] A hierarchical clustering-based approach for software restructuring at the package level
    Marian, Zsuzsanna
    Czibula, Istvan-Gergely
    Czibula, Gabriela
    2017 19TH INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND NUMERIC ALGORITHMS FOR SCIENTIFIC COMPUTING (SYNASC 2017), 2017, : 239 - 246
  • [4] Clustering-based hierarchical radiosity for dynamic environments
    Lee, WY
    Chuang, JH
    JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, 1999, 15 (06) : 815 - 832
  • [5] A Clustering-Based Optimization Approach for Hospital Miscoding Correction
    He, Chen
    Dalmas, Benjamin
    Bousquet, Cedric
    Trombert-Paviot, Beatrice
    Xie, Xiaolan
    IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING, 2024, 21 (02) : 1501 - 1516
  • [6] ICN clustering-based approach for VANETs
    Fourati, Lamia Chaari
    Ayed, Samiha
    Ben Rejeb, Mohamed Ali
    ANNALS OF TELECOMMUNICATIONS, 2021, 76 (9-10) : 745 - 757
  • [7] Markov Clustering-Based Placement Algorithm for Hierarchical FPGAs
    戴晖
    周强
    边计年
    TsinghuaScienceandTechnology, 2011, 16 (01) : 62 - 68
  • [8] ICN clustering-based approach for VANETs
    Lamia Chaari Fourati
    Samiha Ayed
    Mohamed Ali Ben Rejeb
    Annals of Telecommunications, 2021, 76 : 745 - 757
  • [9] A Clustering-Based Approach to Kinetic Closest Pair
    Zahed Rahmati
    Timothy M. Chan
    Algorithmica, 2018, 80 : 2742 - 2756
  • [10] A Clustering-Based Approach to Kinetic Closest Pair
    Rahmati, Zahed
    Chan, Timothy M.
    ALGORITHMICA, 2018, 80 (10) : 2742 - 2756