通信学报 ›› 2006, Vol. 27 ›› Issue (10): 25-30.doi: 1000-436X(2006)10-0025-06

• • 上一篇    下一篇

基于分段线性函数的广义效用max-min公平分配算法研究

徐童,廖建新   

  1. 北京邮电大学 网络与交换国家技术重点实验室,北京 100876
  • 出版日期:2006-10-25 发布日期:2017-06-15
  • 基金资助:
    国家杰出青年科学基金资助项目;新世纪优秀人才支持计划基金资助项目;高等学校博士学科点专项科研基金资助项目

Research on the generalized utility max-min fair algorithm based on piecewise linear function

Tong XU,Jian-xin LIAO   

  1. State Key Laboratory of Networking and Switching Technology,Beijing University of Posts and Telecommunications,Beijing 100876,China
  • Online:2006-10-25 Published:2017-06-15
  • Supported by:
    The National Science Fund for Distinguished Young Scholars;The Program for New Century Ex-cellent Talents in University;The Specialized Research Fund for the Doctoral Program of Higher Education

摘要:

提出了一种基于分段线性函数的广义效用max-min(UMM)公平分配算法,可支持资源分配的上下限以及各种严格单调增和连续的效用函数。该算法避免了迭代计算,复杂度低于UMM公平的注水法。简化后的算法的复杂度与现有的基于分段线性函数的狭义UMM公平分配算法相同。该算法可应用于计算机和通信领域中的各种资源分配问题中。

关键词: 效用, 最大最小公平性, 资源分配算法, 分段线性函数

Abstract:

A generalized utility max-min (UMM) fair algorithm of resource allocation based on piecewise linear function was provided,which supported the upper/lower bounds of resource allocation as well as strictly increasing and continu-ous utility functions.Because of the avoidance of iterative procedure,this algorithm was less complex than water-filling,another UMM fair algorithm.And its simplified version had the same complexity as the narrow-sense UMM fair algo-rithm based on piecewise linear function.This algorithm can be applied in various problems of resource allocation in the field of computer and communication.

Key words: utility, max-min fairness, resource allocation algorithm, piecewise linear function

No Suggested Reading articles found!