A New Distributed Algorithm to Achieve Utility MaxMin Fairness

XIE Ying-Ze; ZHANG Yang

doi:10.3969/j.issn.1007130X.2010.

Computer Engineering & Science >

2010 , Vol. 32 >Issue 4: 10 - 13

DOI: https://doi.org/10.3969/j.issn.1007130X.2010.

论文

A New Distributed Algorithm to Achieve Utility MaxMin Fairness

XIE Ying-Ze ,
ZHANG Yang

Expand

(1.Modern Education Technology Center,Huazhong Agricultural University,Wuhan 430070;2.Department of Computer Science,School of Science,Huazhong Agricultural University,Wuhan 430070;3.School of Resources and Environment,Huazhong Agricultural University,Wuhan 430070,China)

Received date: 2008-12-13

Revised date: 2009-04-10

Online published: 2010-03-28

Fold

Abstract

A central issue in computer network is how to allocate bandwidth to the flows fairly, in a decentralized manner. In this paper, we propose a new approach to achieve utility maxmin fairness, which is based on a vector optimization and some extension to the famous KuhnTucker conditions for nonlinear optimization. This leads to a distributed source link algorithm which we show its performance by an example.

Key words： bandwidth allocation;utility maxmin fairness;source link algorithm

Cite this article

XIE Ying-Ze , ZHANG Yang . A New Distributed Algorithm to Achieve Utility MaxMin Fairness[J]. Computer Engineering & Science, 2010 , 32(4) : 10 -13 . DOI: 10.3969/j.issn.1007130X.2010.

Options

Outlines

模态框（Modal）标题

Abstract

Cite this article