1. NCCU Academic Hub
  2. 學術產出
  3. College of Informatics
  4. Proceedings
  5. Item

學術產出-Proceedings

Article View/Open

Publication Export

Google ScholarTM

政大圖書館

Citation Infomation

題名 Fair VNF Provisioning in NFV Clusters via Node Labeling
作者 郭桐惟
Kuo, Tung-Wei
Chang, Tzu-Wen
Tsai, Ming-Jer
貢獻者 資科系
關鍵詞 Max-Min Fairness ; Multi-Resource Allocation ; Network Function Virtualization ; Dominant Resource Fairness
日期 2020
上傳時間 4-Jun-2021 14:36:18 (UTC+8)
摘要 We study fair multi-resource allocation in Network Function Virtualization (NFV) clusters, where the relative amounts of (multiple) resources allocated for a virtual network function (VNF) can be flexibly adjusted. In NFV clusters, the fairness across users can benefit from the flexibility of the multi-resource allocation for VNFs, but we also have to address a research challenge: What relative amounts of resources should be allocated to a VNF? Although many studies address fair multi-resource allocation in the literature, they all assume that the relative amounts of resources allocated for a VNF are pre-determined and fixed, which would lead to the poor fairness across users. In this paper, we make the first attempt to propose an algorithm to allocate resources to users under the circumstance of flexible multi-resource allocation for VNFs. Our algorithm is shown to achieve max-min fairness and satisfy two beneficial properties of fair multi-resource allocation: Pareto efficiency and envy-freeness. Simulations also show our algorithm can allocate resources in a fair and efficient way in NFV clusters.
關聯 IEEE GLOBECOM, IEEE
資料類型 conference
DOI https://doi.org/10.1109/GLOBECOM42002.2020.9347991
dc.contributor 資科系
dc.creator (作者) 郭桐惟
dc.creator (作者) Kuo, Tung-Wei
dc.creator (作者) Chang, Tzu-Wen
dc.creator (作者) Tsai, Ming-Jer
dc.date (日期) 2020
dc.date.accessioned 4-Jun-2021 14:36:18 (UTC+8)-
dc.date.available 4-Jun-2021 14:36:18 (UTC+8)-
dc.date.issued (上傳時間) 4-Jun-2021 14:36:18 (UTC+8)-
dc.identifier.uri (URI) http://nccur.lib.nccu.edu.tw/handle/140.119/135515-
dc.description.abstract (摘要) We study fair multi-resource allocation in Network Function Virtualization (NFV) clusters, where the relative amounts of (multiple) resources allocated for a virtual network function (VNF) can be flexibly adjusted. In NFV clusters, the fairness across users can benefit from the flexibility of the multi-resource allocation for VNFs, but we also have to address a research challenge: What relative amounts of resources should be allocated to a VNF? Although many studies address fair multi-resource allocation in the literature, they all assume that the relative amounts of resources allocated for a VNF are pre-determined and fixed, which would lead to the poor fairness across users. In this paper, we make the first attempt to propose an algorithm to allocate resources to users under the circumstance of flexible multi-resource allocation for VNFs. Our algorithm is shown to achieve max-min fairness and satisfy two beneficial properties of fair multi-resource allocation: Pareto efficiency and envy-freeness. Simulations also show our algorithm can allocate resources in a fair and efficient way in NFV clusters.
dc.format.extent 315162 bytes-
dc.format.mimetype application/pdf-
dc.relation (關聯) IEEE GLOBECOM, IEEE
dc.subject (關鍵詞) Max-Min Fairness ; Multi-Resource Allocation ; Network Function Virtualization ; Dominant Resource Fairness
dc.title (題名) Fair VNF Provisioning in NFV Clusters via Node Labeling
dc.type (資料類型) conference
dc.identifier.doi (DOI) 10.1109/GLOBECOM42002.2020.9347991
dc.doi.uri (DOI) https://doi.org/10.1109/GLOBECOM42002.2020.9347991