Fair queuing with round robin: A new packet scheduling algorithm for routers

Arunabha Sen, Ibraz Mohammed, Ravikanth Samprathi, Subir Bandyopadhyay

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Scopus citations

Abstract

Over the years several queuing policies have been proposed to ensure fairness between competing requests at a service point. The fair queuing (FQ) algorithm due to Demers, Keshav and Shenkar (1990) is a queuing technique that attains near perfect fairness, where perfect fairness is considered to be the one attained by a fluid flow model. In a data network, the head of the line processor sharing (PS) is considered to be the most fair algorithm. It has been shown that the difference in throughput at any time, in any queue, for any arrival pattern between the FQ and the PS discipline will never exceed MAX, where MAX is the maximum packet size. This difference in throughput is taken as a metric for fairness measure of a queuing algorithm. The drawback of the FQ algorithm is its high packet processing overhead (O (log N)), where N is the number of active flows. To alleviate this problem of high computational complexity, Shreedhar and Varghese (1996) proposed a fair queuing algorithm based on the idea of deficit round robin (DRR). Although DRR reduces the packet processing overhead to O(1), its fairness measure is considerably worse (3MAX) than that of FQ (MAX). In this paper, we present a new round robin based fair queuing algorithm (FQRR) whose packet processing overhead is O(1) and fairness measure is 2MAX.

Original languageEnglish (US)
Title of host publicationProceedings - ISCC 2002
Subtitle of host publication7th International Symposium on Computers and Communications
Pages1001-1006
Number of pages6
DOIs
StatePublished - Dec 1 2002
Event7th International Symposium on Computers and Communications, ISCC 2002 - Taormina-Giardini Naxos, Italy
Duration: Jul 1 2002Jul 4 2002

Publication series

NameProceedings - IEEE Symposium on Computers and Communications
ISSN (Print)1530-1346

Other

Other7th International Symposium on Computers and Communications, ISCC 2002
CountryItaly
CityTaormina-Giardini Naxos
Period7/1/027/4/02

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Mathematics(all)
  • Computer Science Applications
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Fair queuing with round robin: A new packet scheduling algorithm for routers'. Together they form a unique fingerprint.

  • Cite this

    Sen, A., Mohammed, I., Samprathi, R., & Bandyopadhyay, S. (2002). Fair queuing with round robin: A new packet scheduling algorithm for routers. In Proceedings - ISCC 2002: 7th International Symposium on Computers and Communications (pp. 1001-1006). [1021794] (Proceedings - IEEE Symposium on Computers and Communications). https://doi.org/10.1109/ISCC.2002.1021794