An evaluation of fair packet schedulers using a novel measure of instantaneous fairness

  • Authors:

  • Hongyuan Shi;Harish Sethu;Salil S. Kanhere

  • Affiliations:

  • Department of Electrical and Computer Engineering, Drexel University, 3141 Chestnut Street, Philadelphia, PA 19104, USA;Department of Electrical and Computer Engineering, Drexel University, 3141 Chestnut Street, Philadelphia, PA 19104, USA;Department of Electrical and Computer Engineering, Drexel University, 3141 Chestnut Street, Philadelphia, PA 19104, USA

  • Venue:
  • Computer Communications
  • Year:
  • 2005

Quantified Score

Hi-index 0.25

Visualization

Abstract

A number of emerging Internet applications such as video-conferencing and live multimedia broadcasts from Internet TV stations rely on scheduling algorithms in switches and routers to guarantee performance and an acceptable level of quality of service. Fairness in packet schedulers is an intuitively desirable property with practical value; fair schedulers such as weighted fair queueing are a critical component of quality-of-service mechanisms that seek to guarantee end-to-end delay bounds, and thus provide end-to-end service differentiation. Popular measures of the fairness achieved by packet schedulers are based on bounds, such as the relative fairness bound which captures the maximum possible difference between the normalized services received by any two flows. In this paper, we argue that such measures do not capture the actual fairness achieved at most instants of time, and therefore, do not represent a true measure of the ability of a scheduler to successfully deliver end-to-end quality for real-time applications. In this paper, we borrow from the field of economics and propose a new measure of fairness based on the Gini index. This measure captures the instantaneous fairness of a scheduler and, unlike other measures based on bounds, also captures the fairness of the scheduler in its handling of flows during idle periods. We use this measure on real gateway traffic traces and present a simulation-based evaluation of several well-known timestamp-based and frame-based schedulers. We also present a qualitative analysis of the phenomena underlying the observed results.