To be fair or efficient or a bit of both

Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review

22 Scopus Citations
View graph of relations

Author(s)

  • Moshe Zukerman
  • Musa Mammadov
  • Liansheng Tan
  • Iradj Ouveysi
  • Lachlan L.H. Andrew

Detail(s)

Original languageEnglish
Pages (from-to)3787-3806
Journal / PublicationComputers and Operations Research
Volume35
Issue number12
Publication statusPublished - Dec 2008
Externally publishedYes

Abstract

Introducing a new concept of (α, β)-fairness, which allows for a bounded fairness compromise, so that a source is allocated a rate neither less than 0 ≤ α ≤ 1, nor more than β ≥ 1, times its fair share, this paper provides a framework to optimize efficiency (utilization, throughput or revenue) subject to fairness constraints in a general telecommunications network for an arbitrary fairness criterion and cost functions. We formulate a non-linear program (NLP) that finds the optimal bandwidth allocation by maximizing efficiency subject to (α, β)-fairness constraints. This leads to what we call an efficiency-fairness function, which shows the benefit in efficiency as a function of the extent to which fairness is compromised. To solve the NLP we use two algorithms. The first is a well-known branch-and-bound-based algorithm called Lipschitz Global Optimization and the second is a recently developed algorithm called Algorithm for Global Optimization Problems (AGOP). We demonstrate the applicability of the framework to a range of examples from sharing a single link to efficiency fairness issues associated with serving customers in remote communities. © 2007 Elsevier Ltd. All rights reserved.

Research Area(s)

  • Bandwidth allocation, Efficiency-fairness tradeoff, Fairness, Non-linear programming, Utility optimization

Citation Format(s)

To be fair or efficient or a bit of both. / Zukerman, Moshe; Mammadov, Musa; Tan, Liansheng et al.
In: Computers and Operations Research, Vol. 35, No. 12, 12.2008, p. 3787-3806.

Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review