CHOKe - a stateless active queue management scheme for approximating fair bandwidth allocation

Author

Pan, Rong ; Prabhakar, Balaji ; Psounis, Konstantinos

Author_Institution

Dept. of Electr. Eng., Stanford Univ., CA, USA

Volume

2

fYear

2000

fDate

2000

Firstpage

942

Abstract

We investigate the problem of providing a fair bandwidth allocation to each of n flows that share the outgoing link of a congested router. The buffer at the outgoing link is a simple FIFO, shared by packets belonging to the n flows. We devise a simple packet dropping scheme, called CHOKe, that discriminates against the flows which submit more packets per second than is allowed by their fair share. By doing this, the scheme aims to approximate the fair queueing policy. Since it is stateless and easy to implement, CHOKe controls unresponsive or misbehaving flows with a minimum overhead

Keywords

bandwidth allocation; buffer storage; queueing theory; scheduling; telecommunication congestion control; telecommunication network management; telecommunication network routing; CHOKe; FIFO buffer; approximation; congested router; fair bandwidth allocation; fair queueing policy; flow control; packet dropping scheme; stateless active queue management; Bandwidth; Channel allocation; Costs; Engineering management; Inductors; Partitioning algorithms; Quality of service; Scheduling algorithm; State estimation; Web and internet services;

fLanguage

English

Publisher

ieee

Conference_Titel

INFOCOM 2000. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE

Conference_Location

Tel Aviv

ISSN

0743-166X

Print_ISBN

0-7803-5880-5

Type

conf

DOI

10.1109/INFCOM.2000.832269

Filename

832269