A Function Clustering Algorithm for Resource Utilization in Service Function Chaining

被引:0
作者
Kanemitsu, Hidehiro [1 ,2 ]
Kanai, Kenji [2 ]
Katto, Jiro [3 ]
Nakazato, Hidenori [3 ]
机构
[1] Tokyo Univ Technol, Sch Comp Sci, 1404-1 Katakura, Hachioji, Tokyo 1920982, Japan
[2] Waseda Res Inst Sci & Engn, Shinjuku Ku, 3-4-1 Ohkubo, Tokyo 1690072, Japan
[3] Waseda Univ, Sch Fundamental Sci & Engn, Dept Comp Sci & Commun Engn, Shinjuku Ku, 3-4-1 Ohkubo, Tokyo 1690072, Japan
来源
2019 IEEE 12TH INTERNATIONAL CONFERENCE ON CLOUD COMPUTING (IEEE CLOUD 2019) | 2019年
基金
欧盟地平线“2020”;
关键词
Cloud; Service Function Chaining; SFC; NFV; Scheduling; Clustering; Resource Utilization;
D O I
10.1109/CLOUD.2019.00041
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Virtualized service and network functions are deployed on virtual machines (VMs) to realize essential processing to realize service function chaining (SFC). Issues on SFC is SF allocation to a VM and to minimize the response time and number of function instances. In this paper, we propose an SF clustering-based scheduling algorithm, called "SF-clustering for utilizing virtual CPUs" (SF-CUV), to solve the SF allocation and SF selection problems simultaneously. Experimental results show that SF-CUV can utilize vCPUs to minimize the response time.
引用
收藏
页码:193 / 195
页数:3
相关论文
共 10 条
  • [1] Scalable and coordinated allocation of service function chains
    Beck, Michael Till
    Botero, Juan Felipe
    [J]. COMPUTER COMMUNICATIONS, 2017, 102 : 78 - 88
  • [2] A survey on service function chaining
    Bhamare, Deval
    Jain, Raj
    Samaka, Mohammed
    Erbad, Aiman
    [J]. JOURNAL OF NETWORK AND COMPUTER APPLICATIONS, 2016, 75 : 138 - 155
  • [3] Bhamare Deval, 2017, 2017 IEEE INT C COMM, P1, DOI DOI 10.1109/ICC.2017.7996729
  • [4] CloudSim: a toolkit for modeling and simulation of cloud computing environments and evaluation of resource provisioning algorithms
    Calheiros, Rodrigo N.
    Ranjan, Rajiv
    Beloglazov, Anton
    De Rose, Cesar A. F.
    Buyya, Rajkumar
    [J]. SOFTWARE-PRACTICE & EXPERIENCE, 2011, 41 (01) : 23 - 50
  • [5] Cheng WD, 2012, STRUCT BOND, V144, P1, DOI [10.1109/ICADE.2012.6330087, 10.1007/430_2011_64]
  • [6] Clustering-Based Task Scheduling in a Large Number of Heterogeneous Processors
    Kanemitsu, Hidehiro
    Hanada, Masaki
    Nakazato, Hidenori
    [J]. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2016, 27 (11) : 3144 - 3157
  • [7] A fix-and-optimize approach for efficient and large scale virtual network function placement and chaining
    Luizelli, Marcelo Caggiani
    da Costa Cordeiro, Weverton Luis
    Buriol, Luciana S.
    Gaspary, Luciano Paschoal
    [J]. COMPUTER COMMUNICATIONS, 2017, 102 : 67 - 77
  • [8] Service Function Chaining: Creating a Service Plane via Network Service Headers
    Quinn, Paul
    Guichard, Jim
    [J]. COMPUTER, 2014, 47 (11) : 38 - 44
  • [9] Performance-effective and low-complexity task scheduling for heterogeneous computing
    Topcuoglu, H
    Hariri, S
    Wu, MY
    [J]. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2002, 13 (03) : 260 - 274
  • [10] Joint Optimization of Service Function Chaining and Resource Allocation in Network Function Virtualization
    Wang, Luhan
    Lu, Zhaoming
    Wen, Xiangming
    Knopp, Raymond
    Gupta, Rohit
    [J]. IEEE ACCESS, 2016, 4 : 8084 - 8094