| 大会名称 |
| 2020年 総合大会 |
| 大会コ－ド |
| 2020G |
| 開催年 |
|
2020
|
| 発行日 |
|
2020-03-03
|
| セッション番号 |
|
BS-1
|
| セッション名 |
|
In-Network Intelligence for Design, Management, and Control of Future Networks and Services
|
| 講演日 |
|
2020/3/18
|
| 講演場所(会議室等) |
|
工学部 講義棟１F 104講義室
|
| 講演番号 |
|
BS-1-3
|
| タイトル |
|
A GAP-Seeking Algorithm for Mapping and Scheduling SFC
|
| 著者名 |
|
○YANSEN XU, Ved P. Kafle,
|
| キーワード |
|
SFC, NFV, resource management, scheduling, VNF
|
| 抄録 |
|
In this paper, we describe the mapping and scheduling SFC problems in a virtual environment We introduced a GAP-Seeking heuristic algorithm to solve the problem. The proposed GAP-Seeking improves the utilization of virtual machines and shortens the service processing time of SFC requests on the virtual network, by inserting VNFs of SFC into gaps of virtual machines’ queue. We conducted a numeric simulation to evaluate and compare the performance of algorithms. The results show that our proposed GAP-Seeking algorithm outperforms the greedy algorithm in a higher acceptance rate of SFC requests and shorter service processing time in both online and offline SFC request arrival fashion.
|
| 本文pdf |
|
PDF download
|
