Beyond CHOKe: Stateless fair queueing

Rade Stanojević, Robert Shorten

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

2 Citations (Scopus)

Abstract

Making drop decisions to enforce the max-min fair resource allocation in a network of standard TCP flows without any explicit state information is a challenging problem. Here we propose a solution to this problem by developing a suite of stateless queue management schemes that we refer to as Multi-Level Comparison with index 1 (MLC(l)). We show analytically, using a Markov chain model, that for an arbitrary network topology of standard TCP flows and queues employing MLC(l), the resource allocation converges to max-min fair as l increases. The analytical findings are verified experimentally using packet level ns2 simulations.

Original languageEnglish
Title of host publicationNetwork Control and Optimization - First EuroFGI International Conference, NET-COOP 2007, Proceedings
Pages43-53
Number of pages11
Publication statusPublished - 20 Dec 2007
Event1st Euro-NGI / FGI Conference on Network Control and Optimization, NET-COOP 2007 - Avignon, France
Duration: 5 Jun 20077 Jun 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4465 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other1st Euro-NGI / FGI Conference on Network Control and Optimization, NET-COOP 2007
CountryFrance
CityAvignon
Period5/6/077/6/07

    Fingerprint

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Stanojević, R., & Shorten, R. (2007). Beyond CHOKe: Stateless fair queueing. In Network Control and Optimization - First EuroFGI International Conference, NET-COOP 2007, Proceedings (pp. 43-53). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4465 LNCS).