Beyond CHOKe

Stateless fair queueing

Rade Stanojevic, 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
Volume4465 LNCS
Publication statusPublished - 2007
Externally publishedYes
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)03029743
ISSN (Electronic)16113349

Other

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

Fingerprint

Queueing
Min-max
Resource Allocation
Resource allocation
Queue
Markov Chain Model
Network Topology
Markov processes
Topology
Converge
Arbitrary
Simulation
Standards

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

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

Beyond CHOKe : Stateless fair queueing. / Stanojevic, Rade; Shorten, Robert.

Network Control and Optimization - First EuroFGI International Conference, NET-COOP 2007, Proceedings. Vol. 4465 LNCS 2007. p. 43-53 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4465 LNCS).

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

Stanojevic, R & Shorten, R 2007, Beyond CHOKe: Stateless fair queueing. in Network Control and Optimization - First EuroFGI International Conference, NET-COOP 2007, Proceedings. vol. 4465 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4465 LNCS, pp. 43-53, 1st Euro-NGI / FGI Conference on Network Control and Optimization, NET-COOP 2007, Avignon, France, 5/6/07.
Stanojevic R, Shorten R. Beyond CHOKe: Stateless fair queueing. In Network Control and Optimization - First EuroFGI International Conference, NET-COOP 2007, Proceedings. Vol. 4465 LNCS. 2007. p. 43-53. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Stanojevic, Rade ; Shorten, Robert. / Beyond CHOKe : Stateless fair queueing. Network Control and Optimization - First EuroFGI International Conference, NET-COOP 2007, Proceedings. Vol. 4465 LNCS 2007. pp. 43-53 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{766fce513eee4b2fb69da8ddc41f1477,
title = "Beyond CHOKe: Stateless fair queueing",
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.",
author = "Rade Stanojevic and Robert Shorten",
year = "2007",
language = "English",
isbn = "3540727086",
volume = "4465 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "43--53",
booktitle = "Network Control and Optimization - First EuroFGI International Conference, NET-COOP 2007, Proceedings",

}

TY - GEN

T1 - Beyond CHOKe

T2 - Stateless fair queueing

AU - Stanojevic, Rade

AU - Shorten, Robert

PY - 2007

Y1 - 2007

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=34748821229&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34748821229&partnerID=8YFLogxK

M3 - Conference contribution

SN - 3540727086

SN - 9783540727088

VL - 4465 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 43

EP - 53

BT - Network Control and Optimization - First EuroFGI International Conference, NET-COOP 2007, Proceedings

ER -