Principles of fairness quantification in queueing systems

Hanoch Levy*, Benjamin Avi-Itzhak, David Raz

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review


Queues serve as a major scheduling device in computer networks, both at the network level and at the application level. A fundamental and important property of a queue service discipline is its fairness. Recent empirical studies show fairness in queues to be highly important to queueing customers in practical scenarios. The objective of this tutorial is to discuss the issue of queue fairness and its dilemmas, and to review the research conducted on this subject. We discuss the fundamental principles related to queue fairness in the perspective of the relevant applications, with some emphasis on computer communications networks. This is conducted in the context of the recent research in this area and the queueing related fairness measures which have been proposed in recent years. We describe, discuss and compare their properties, and evaluate their relevance to the various practical applications.

Original languageEnglish
Title of host publicationNetwork Performance Engineering
Subtitle of host publicationA Handbook on Convergent Multi-Service Networks and Next Generation Internet
PublisherSpringer Verlag
Number of pages17
ISBN (Print)9783642027413
StatePublished - 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


  • Fairness
  • Queueing


Dive into the research topics of 'Principles of fairness quantification in queueing systems'. Together they form a unique fingerprint.

Cite this