A queueing analysis of max-min fairness, proportional fairness and balanced fairness
نویسندگان
چکیده
منابع مشابه
A queueing analysis of max-min fairness, proportional fairness and balanced fairness
We compare the performance of three usual allocations, namely max-min fairness, proportional fairness and balanced fairness, in a communication network whose resources are shared by a random number of data flows. The model consists of a network of processorsharing queues. The vector of service rates, which is constrained by some compact, convex capacity set representing the network resources, i...
متن کاملUnifying View on Min-Max Fairness, Max-Min Fairness, and Utility Optimization in Cellular Networks
We are concerned with the control of quality of service (QoS) in wireless cellular networks utilizing linear receivers. We investigate the issues of fairness and total performance, which are measured by a utility function in the form of a weighted sum of link QoS. We disprove the common conjecture on incompatibility of min-max fairness and utility optimality by characterizing network classes in...
متن کاملMax-Min Fairness in Input-Queued Switches
This paper describes an algorithm that computes the maxmin fair allocation of rates for flows through an input-queued switch. The algorithm is provably max-min fair and can be implemented in a distributed fashion to dynamically determine flow rates.
متن کاملAnalysis of a queueing fairness measure
Scheduling policies significantly influence the performance of queueing systems, and performance measures like response and waiting times, throughput, or related properties have been comprehensively investigated in queueing and scheduling theory. The important issue of quantifying user perceived fairness has received less attention. Measuring fairness suffers from the subjective nature of fairn...
متن کاملProportional Fairness and its Relationship with Multi-class Queueing Networks
A network of single server queues with routing is considered. These networks have a product form stationary distribution. A new limit result proves a sequence of such networks converges weakly to a stochastic flow level model. This stochastic model is insensitive. A large deviation principle for the stationary distribution of these queueing networks is found. Its rate function has a dual formul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Queueing Systems
سال: 2006
ISSN: 0257-0130,1572-9443
DOI: 10.1007/s11134-006-7587-7