BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CSL-TR-99-787
       ENTRY:: November 16, 1999
ORGANIZATION:: Stanford University, Computer Systems Laboratory
       TITLE:: CHOKe - A stateless queue management scheme for
approximating fair bandwidth allocation
        TYPE:: Technical Report
      AUTHOR:: Pan, Rong
      AUTHOR:: Prabhakar, Balaji
      AUTHOR:: Psounis, Konstantios
        DATE:: September 1999
       PAGES:: 20
    ABSTRACT:: We investigate the problem of providing a fair bandwidth 
allocation to each of n flows that share an outgoing link at a congested router. 
The buffer at the outgoing link is a simple FIFO, commonly shared by packets 
belonging to the n flows. We devise a simple packet dropping scheme, CHOKe, 
that discriminates against the flows which submit more packets/sec 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.
         END:: STAN//CSL-TR-99-787