標題: 5G 核心網路之網路功能虛擬機最佳配置演算法
Optimal Resource Allocation in NFV-based Core Networks of 5G Communication Systems
作者: 李浩維
高榮鴻
Lee, Hao-Wei
Gau, Rung-Hung
電信工程研究所
關鍵字: 軟體定義網路;網路功能虛擬化;多維度背包問題;配對問題;SDN;NFV;optimal placement;multidimensional knapsack problem;assignment problem
公開日期: 2017
摘要: 在本論文中,我們提出了一種新穎的方法,在 5G 移動通信系統的 NFV 核心網絡 中,基於對用戶的最小延遲對虛擬機進行優化分配。該算法有兩個部分,VM 分配和用 戶匹配。為了優化 VM 分配,我們制定和解決了多維背包問題(MKP)。特別地,我們 提出使用改進的 CPH 算法(mCPH)來解決多項式時間中的問題。為了優化用戶匹配, 我們制定了一個配對問題,並使用匈牙利算法在多項式時間內求解它。模擬結果表明, 該算法優於其他算法。
In this thesis, we propose a novel method to optimally allocate virtual machines to user equipments and machines with minimum latency in NFV-based core networks of 5G mobile communication systems. The algorithm has two parts, VM allocation and user matching. For optimal VM allocation, we formulate and solve a multidimensional knapsack problem (MKP). In particular, we propose using the modified CPH algorithm (mCPH) to solve the problem in polynomial time. For optimal user matching, we formulate an assignment problem and use the Hungarian algorithm to solve it in polynomial time. Simulation results show that the proposed algorithm is superior to other evaluated algorithms.
URI: http://etd.lib.nctu.edu.tw/cdrfb3/record/nctu/#GT070460243
http://hdl.handle.net/11536/141675
Appears in Collections:Thesis