| アイテムタイプ |
学術雑誌論文 / Journal Article.(1) |
| 公開日 |
2025-06-23 |
| 書誌情報 |
en : IEEE Transactions on Network Science and Engineering
巻 11,
号 6,
p. 6105-6117,
発行日 2024-09-12
|
| タイトル |
|
|
タイトル |
Profit-Maximizing Service Function Chain Embedding in NFV-Based 5G Core Networks |
|
言語 |
en |
| 言語 |
|
|
言語 |
eng |
| キーワード |
|
|
言語 |
en |
|
主題Scheme |
Other |
|
主題 |
Network Function Virtualization |
| キーワード |
|
|
言語 |
en |
|
主題Scheme |
Other |
|
主題 |
Software Defined Networking |
| キーワード |
|
|
言語 |
en |
|
主題Scheme |
Other |
|
主題 |
5G |
| キーワード |
|
|
言語 |
en |
|
主題Scheme |
Other |
|
主題 |
Virtual Network Function |
| キーワード |
|
|
言語 |
en |
|
主題Scheme |
Other |
|
主題 |
Service Function Chain |
| キーワード |
|
|
言語 |
en |
|
主題Scheme |
Other |
|
主題 |
Integer Non-Linear Programming |
| 資源タイプ |
|
|
資源タイプ識別子 |
http://purl.org/coar/resource_type/c_6501 |
|
資源タイプ |
journal article |
| アクセス権 |
|
|
アクセス権 |
open access |
|
アクセス権URI |
http://purl.org/coar/access_right/c_abf2 |
| 著者 |
Chen, Zhenke
李, 鶴
太田, 香
董, 冕雄
|
| 抄録 |
|
|
内容記述タイプ |
Abstract |
|
内容記述 |
Network Function Virtualization (NFV) is a promising technology to make 5G networks more flexible and cost-efficient. With NFV, a 5G network service is implemented as several Virtual Network Functions (VNFs) that run on general machines, called a Service Function Chain (SFC). A recent survey has revealed that when multiple VNFs are colocated in the same machine, contention for shared physical resources will occur and hence degrade the throughput of a VNF and finally increase its processing delays by 50%, as compared to it runs in isolation. However, prior works fail to capture this important characteristic because they simply treat machines as a resource pool without any resource contention happening, making their approach inapplicable to the SFC embedding problem when resource contention is taken into consideration. To bridge that gap, in this paper, we study a contention-aware QoS-guaranteed SFC embedding problem and formulate it as an Integer Non-Linear Programming (INLP) under a couple of constraints. Given the formulated problem is challenging to solve due to high complexity, we propose a low-complexity approach, which can achieve a near-optimal result in a reasonable time. Numerical results reveal that the proposed approach has advantages in profit, delay, and execution time compared with other state-of-the-art approaches. |
|
言語 |
en |
| 出版者 |
|
|
出版者 |
IEEE |
|
言語 |
en |
| DOI |
|
|
関連タイプ |
isVersionOf |
|
|
識別子タイプ |
DOI |
|
|
関連識別子 |
10.1109/TNSE.2024.3454759 |
| ISSN |
|
|
収録物識別子タイプ |
EISSN |
|
収録物識別子 |
2327-4697 |
| ISSN |
|
|
収録物識別子タイプ |
PISSN |
|
収録物識別子 |
2334-329X |
| 権利 |
|
|
権利情報 |
© Copyright 2025 IEEE |
|
言語 |
en |
| 出版タイプ |
|
|
出版タイプ |
AM |
|
出版タイプResource |
http://purl.org/coar/version/c_ab4af688f83e57aa |
2.+Profit-Maximizing+Service+Function+Chain+Embedding+in+NFV-Based+5G+Core+Networks.pdf (5 MB)
