Analysis of a Queueing Fairness Measure
Conference: MMB 2006 - 13th GI/ITG Conference Measuring, Modelling and Evaluation of Computer and Communication Systems
03/27/2006 - 03/29/2006 at Nürnberg, Germany
Proceedings: MMB 2006
Pages: 13Language: englishTyp: PDF
Personal VDE Members are entitled to a 10% discount on this title
Authors:
Sandmann, Werner (Otto–Friedrich–Universität Bamberg, Fakultät Wirtschaftsinformatik und Angewandte Informatik, Feldkirchenstr. 21, 96045 Bamberg, Germany)
Abstract:
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 fairness, and it has received growing attention only the past few years. Recently, an intuitive discrimination frequency based queueing fairness measure, which possesses important axiomatic properties, has been introduced. In this paper, we derive analytical expressions for the expected discrimination frequency in M/M/1, M/D/1 and M/GI/1 queues operating under FCFS, non-preemptive LCFS, and SJF scheduling. Variances are evaluated by simulation and special attention is drawn to Pareto distributed service times.