A resource allocation queueing fairness measure: Properties and bounds

Benjamin Avi-Itzhak, Hanoch Levy*, David Raz

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

26 Scopus citations


Fairness is an inherent and fundamental factor of queue service disciplines in a large variety of queueing applications, ranging from airport waiting lines to computer queueing systems. We study a newly proposed measure, a Resource Allocation Queueing Fairness Measure (RAQFM), first introduced in Raz, Levy, and Avi-Itzhak (Perform. Eval. Rev. 32(1):130-141, 2004). We analyze the properties of RAQFM and tie them to intuition, provide bounds for its values, and discuss briefly how it yields to analysis.

Original languageEnglish
Pages (from-to)65-71
Number of pages7
JournalQueueing Systems
Issue number2
StatePublished - Jun 2007


FundersFunder number
Ministry of Science and Technology, Israel380-801


    • Job fairness
    • Processor sharing
    • Resource allocation
    • Unfairness


    Dive into the research topics of 'A resource allocation queueing fairness measure: Properties and bounds'. Together they form a unique fingerprint.

    Cite this