A lexicographic optimization framework to the flow control problem

Authors:
Jordi Ros;Wei K. Tsai
Affiliations:
Reservoir Labs, Newport Beach, CA;University of California at Irvine, Irvine, CA
Venue:
IEEE Transactions on Information Theory
Year:
2010

Citing 6
Cited 0

Lexicographically optimal balanced networks

IEEE/ACM Transactions on Networking (TON)
Fair Bandwidth Allocation for Multicasting in Networks with Discrete Feasible Set

IEEE Transactions on Computers
A lexicographically fair allocation of discrete bandwidth for multirate multicast traffics

Computers and Operations Research
A unified framework for max-min and min-max fairness with applications

IEEE/ACM Transactions on Networking (TON)
Fairness in cellular mobile networks

IEEE Transactions on Information Theory
Allocating fair rates for available bit rate service in ATM networks

IEEE Communications Magazine

Quantified Score

Hi-index	754.85

Visualization

Abstract

In this paper, a theory of lexicographic optimization for convex and compact feasible sets is presented. Existence, globality, unimodality, and uniqueness of the solution to the problem are proved. Also, necessary and sufficient conditions are derived that establish the relationship between the lexicographic problem and the maxmin problem. This framework is shown to be useful in the problem of designing flow control protocols. Towards this objective, a theory of bottleneck ordering is introduced, which unveils the convergence properties of the flow control problem.