政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/135515
English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  全文筆數/總筆數 : 114504/145531 (79%)
造訪人次 : 53454761      線上人數 : 1190
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧：
  • 您可在西文檢索詞彙前後加上"雙引號"，以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋，建議至進階搜尋限定作者欄位，可獲得較完整資料
    •  進階搜尋
    政大機構典藏 > 資訊學院 > 資訊科學系 > 會議論文 >  Item 140.119/135515


    請使用永久網址來引用或連結此文件: https://nccur.lib.nccu.edu.tw/handle/140.119/135515


    題名: 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
    上傳時間: 2021-06-04 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
    DOI: 10.1109/GLOBECOM42002.2020.9347991
    顯示於類別:[資訊科學系] 會議論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    274.pdf307KbAdobe PDF2249檢視/開啟


    在政大典藏中所有的資料項目都受到原著作權保護.


    社群 sharing

    著作權政策宣告 Copyright Announcement
    1.本網站之數位內容為國立政治大學所收錄之機構典藏，無償提供學術研究與公眾教育等公益性使用，惟仍請適度，合理使用本網站之內容，以尊重著作權人之權益。商業上之利用，則請先取得著作權人之授權。
    The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

    2.本網站之製作，已盡力防止侵害著作權人之權益，如仍發現本網站之數位內容有侵害著作權人權益情事者，請權利人通知本網站維護人員(nccur@nccu.edu.tw)，維護人員將立即採取移除該數位著作等補救措施。
    NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回饋