Probabilistic fair queuing

Tal Anker, Roi Cohen, Danny Dolev, Yoram Singer

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

5 Scopus citations

Abstract

Packet scheduling constitutes the core problem in efficient fair allocation of bandwidth to competing flows. To date, numerous algorithms for packet scheduling have been suggested and tested. However, only a few of them are currently deployed. One of the key reasons for rarity of applied packet scheduling methods lies in the complexity of their implementation. This paper describes a family of randomized algorithms for packet scheduling. These algorithms are simple to implement and require small amounts of computation time. Specifically, we present an O(1) probabilistic weighted fair queuing algorithm that emits packets from flows with an improved delay jitter. Experimental results of the proposed randomized algorithms suggest that the randomized approach is a viable alternative to the currently deployed deterministic fair queuing algorithms.

Original languageEnglish (US)
Title of host publication2001 IEEE Workshop on High Performance Switching and Routing
Pages397-401
Number of pages5
StatePublished - Dec 1 2001
Externally publishedYes
Event2001 IEEE Workshop on High Performance Switching and Routing - Dallas, TX, United States
Duration: May 29 2001May 31 2001

Publication series

Name2001 IEEE Workshop on High Performance Switching and Routing

Other

Other2001 IEEE Workshop on High Performance Switching and Routing
CountryUnited States
CityDallas, TX
Period5/29/015/31/01

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Fingerprint Dive into the research topics of 'Probabilistic fair queuing'. Together they form a unique fingerprint.

  • Cite this

    Anker, T., Cohen, R., Dolev, D., & Singer, Y. (2001). Probabilistic fair queuing. In 2001 IEEE Workshop on High Performance Switching and Routing (pp. 397-401). (2001 IEEE Workshop on High Performance Switching and Routing).