Fair queueing without per-flow queues: A virtual queueing machine

Gary Chang, Chung Chieh Lee

Research output: Contribution to conferencePaperpeer-review

Abstract

In this paper, we present a novel fair-queueing solution, dubbed Virtual Queueing Machine (VQM), that avoids the one-queueing-per-flow architecture found in many existing solutions. Its objective is to provide throughput fairness among competing backlogged flows while protecting the response times for short-lived flows. The VQM employs a two-stage architecture that assigns packets from all traffic flows to a fixed number of packet buffers in a calculated manner that follows fair queueing principle. This two-stage architecture allows previews of a portion of future traffic to be served thus allowing backlogged flows to be paced accordingly with a load-adaptive algorithm for protecting the response times of short-lived flows. A load-adaptive fairness metric is presented and is used to assess the performance of VQM under different simulation scenarios.

Original languageEnglish (US)
Pages124-130
Number of pages7
DOIs
StatePublished - Jan 1 2014
Event2014 International Conference on Computing, Networking and Communications, ICNC 2014 - Honolulu, HI, United States
Duration: Feb 3 2014Feb 6 2014

Other

Other2014 International Conference on Computing, Networking and Communications, ICNC 2014
CountryUnited States
CityHonolulu, HI
Period2/3/142/6/14

ASJC Scopus subject areas

  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Fair queueing without per-flow queues: A virtual queueing machine'. Together they form a unique fingerprint.

Cite this