A function clustering algorithm for resource utilization in service function chaining

研究成果: Conference contribution

抄録

Abstract-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' (SFCUV), to solve the SF allocation and SF selection problems simultaneously. Experimental results show that SF-CUV can utilize vCPUs to minimize the response time.

元の言語English
ホスト出版物のタイトルProceedings - 2019 IEEE International Conference on Cloud Computing, CLOUD 2019 - Part of the 2019 IEEE World Congress on Services
編集者Elisa Bertino, Carl K. Chang, Peter Chen, Ernesto Damiani, Michael Goul, Katsunori Oyama
出版者IEEE Computer Society
ページ193-195
ページ数3
ISBN(電子版)9781728127057
DOI
出版物ステータスPublished - 2019 7 1
イベント12th IEEE International Conference on Cloud Computing, CLOUD 2019 - Milan, Italy
継続期間: 2019 7 82019 7 13

出版物シリーズ

名前IEEE International Conference on Cloud Computing, CLOUD
2019-July
ISSN(印刷物)2159-6182
ISSN(電子版)2159-6190

Conference

Conference12th IEEE International Conference on Cloud Computing, CLOUD 2019
Italy
Milan
期間19/7/819/7/13

Fingerprint

Clustering algorithms
Response time (computer systems)
Scheduling algorithms
Program processors
Processing
Virtual machine

ASJC Scopus subject areas

  • Artificial Intelligence
  • Information Systems
  • Software

これを引用

Kanemitsu, H., Kanai, K., Katto, J., & Nakazato, H. (2019). A function clustering algorithm for resource utilization in service function chaining. : E. Bertino, C. K. Chang, P. Chen, E. Damiani, M. Goul, & K. Oyama (版), Proceedings - 2019 IEEE International Conference on Cloud Computing, CLOUD 2019 - Part of the 2019 IEEE World Congress on Services (pp. 193-195). [8814541] (IEEE International Conference on Cloud Computing, CLOUD; 巻数 2019-July). IEEE Computer Society. https://doi.org/10.1109/CLOUD.2019.00041

A function clustering algorithm for resource utilization in service function chaining. / Kanemitsu, Hidehiro; Kanai, Kenji; Katto, Jiro; Nakazato, Hidenori.

Proceedings - 2019 IEEE International Conference on Cloud Computing, CLOUD 2019 - Part of the 2019 IEEE World Congress on Services. 版 / Elisa Bertino; Carl K. Chang; Peter Chen; Ernesto Damiani; Michael Goul; Katsunori Oyama. IEEE Computer Society, 2019. p. 193-195 8814541 (IEEE International Conference on Cloud Computing, CLOUD; 巻 2019-July).

研究成果: Conference contribution

Kanemitsu, H, Kanai, K, Katto, J & Nakazato, H 2019, A function clustering algorithm for resource utilization in service function chaining. : E Bertino, CK Chang, P Chen, E Damiani, M Goul & K Oyama (版), Proceedings - 2019 IEEE International Conference on Cloud Computing, CLOUD 2019 - Part of the 2019 IEEE World Congress on Services., 8814541, IEEE International Conference on Cloud Computing, CLOUD, 巻. 2019-July, IEEE Computer Society, pp. 193-195, 12th IEEE International Conference on Cloud Computing, CLOUD 2019, Milan, Italy, 19/7/8. https://doi.org/10.1109/CLOUD.2019.00041
Kanemitsu H, Kanai K, Katto J, Nakazato H. A function clustering algorithm for resource utilization in service function chaining. : Bertino E, Chang CK, Chen P, Damiani E, Goul M, Oyama K, 編集者, Proceedings - 2019 IEEE International Conference on Cloud Computing, CLOUD 2019 - Part of the 2019 IEEE World Congress on Services. IEEE Computer Society. 2019. p. 193-195. 8814541. (IEEE International Conference on Cloud Computing, CLOUD). https://doi.org/10.1109/CLOUD.2019.00041
Kanemitsu, Hidehiro ; Kanai, Kenji ; Katto, Jiro ; Nakazato, Hidenori. / A function clustering algorithm for resource utilization in service function chaining. Proceedings - 2019 IEEE International Conference on Cloud Computing, CLOUD 2019 - Part of the 2019 IEEE World Congress on Services. 編集者 / Elisa Bertino ; Carl K. Chang ; Peter Chen ; Ernesto Damiani ; Michael Goul ; Katsunori Oyama. IEEE Computer Society, 2019. pp. 193-195 (IEEE International Conference on Cloud Computing, CLOUD).
@inproceedings{ef2a0099985649858fed5b30d0fcd351,
title = "A function clustering algorithm for resource utilization in service function chaining",
abstract = "Abstract-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' (SFCUV), to solve the SF allocation and SF selection problems simultaneously. Experimental results show that SF-CUV can utilize vCPUs to minimize the response time.",
keywords = "Clustering, NFV, Resource Utilization, Service Function Chaining, SFC, Shceduling",
author = "Hidehiro Kanemitsu and Kenji Kanai and Jiro Katto and Hidenori Nakazato",
year = "2019",
month = "7",
day = "1",
doi = "10.1109/CLOUD.2019.00041",
language = "English",
series = "IEEE International Conference on Cloud Computing, CLOUD",
publisher = "IEEE Computer Society",
pages = "193--195",
editor = "Elisa Bertino and Chang, {Carl K.} and Peter Chen and Ernesto Damiani and Michael Goul and Katsunori Oyama",
booktitle = "Proceedings - 2019 IEEE International Conference on Cloud Computing, CLOUD 2019 - Part of the 2019 IEEE World Congress on Services",

}

TY - GEN

T1 - A function clustering algorithm for resource utilization in service function chaining

AU - Kanemitsu, Hidehiro

AU - Kanai, Kenji

AU - Katto, Jiro

AU - Nakazato, Hidenori

PY - 2019/7/1

Y1 - 2019/7/1

N2 - Abstract-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' (SFCUV), to solve the SF allocation and SF selection problems simultaneously. Experimental results show that SF-CUV can utilize vCPUs to minimize the response time.

AB - Abstract-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' (SFCUV), to solve the SF allocation and SF selection problems simultaneously. Experimental results show that SF-CUV can utilize vCPUs to minimize the response time.

KW - Clustering

KW - NFV

KW - Resource Utilization

KW - Service Function Chaining

KW - SFC

KW - Shceduling

UR - http://www.scopus.com/inward/record.url?scp=85072336420&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85072336420&partnerID=8YFLogxK

U2 - 10.1109/CLOUD.2019.00041

DO - 10.1109/CLOUD.2019.00041

M3 - Conference contribution

AN - SCOPUS:85072336420

T3 - IEEE International Conference on Cloud Computing, CLOUD

SP - 193

EP - 195

BT - Proceedings - 2019 IEEE International Conference on Cloud Computing, CLOUD 2019 - Part of the 2019 IEEE World Congress on Services

A2 - Bertino, Elisa

A2 - Chang, Carl K.

A2 - Chen, Peter

A2 - Damiani, Ernesto

A2 - Goul, Michael

A2 - Oyama, Katsunori

PB - IEEE Computer Society

ER -