A resource allocation queueing fairness measure: properties and bounds

DOI10.1007/s11134-007-9025-xzbMath1125.68014OpenAlexW1965657460MaRDI QIDQ2643009

David Raz, Hanoch Levy, Benjamin Avi-Itzhak

Publication date: 6 September 2007

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11134-007-9025-x

zbMATH Keywords

Resource allocationProcessor sharingJob fairnessUnfairness

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Stochastic scheduling theory in operations research (90B36) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (9)

Quantitative fairness for assessing perceived service quality in queues ⋮ Transplant queueing ⋮ Inequity averse optimization in operational research ⋮ A resource allocation queueing fairness measure: properties and bounds ⋮ Fair resource allocation for different scenarios of demands ⋮ QUANTIFYING FAIRNESS IN QUEUING SYSTEMS ⋮ On fair price discrimination in multi-unit markets ⋮ On social envy-freeness in multi-unit markets ⋮ Equilibrium customers' choice between FCFS and random servers

Cites Work

• Locality of reference and the use of sojourn time variance for measuring queue unfairness
• A resource allocation queueing fairness measure: properties and bounds
• QUANTIFYING FAIRNESS IN QUEUING SYSTEMS
• On measuring fairness in queues

This page was built for publication: A resource allocation queueing fairness measure: properties and bounds