tc-choke(8)

1TC(8)                                Linux                               TC(8)
2
3
4

NAME

6       choke - choose and keep scheduler
7

SYNOPSIS

9       tc  qdisc  ...  choke limit packets min packets max packets avpkt bytes
10       burst packets [ ecn ] [ bandwidth rate ] probability chance
11
12

DESCRIPTION

14       CHOKe (CHOose and Keep for responsive flows, CHOose and Kill for  unre‐
15       sponsive  flows)  is  a  classless  qdisc designed to both identify and
16       penalize flows that monopolize the queue. CHOKe is a variation of  RED,
17       and the configuration is similar to RED.
18
19

ALGORITHM

21       Once  the queue hits a certain average length, a random packet is drawn
22       from the queue. If both the to-be-queued and the drawn packet belong to
23       the same flow, both packets are dropped. Otherwise, if the queue length
24       is still below the maximum length, the new packet  has  a  configurable
25       chance  of  being marked (which may mean dropped).  If the queue length
26       exceeds max, the new packet will always be marked (or dropped).  If the
27       queue length exceeds limit, the new packet is always dropped.
28
29       The  marking  probability  computation  is  the same as used by the RED
30       qdisc.
31
32

PARAMETERS

34       The parameters are the same as for RED,  except  that  RED  uses  bytes
35       whereas choke counts packets. See tc-red(8) for a description.
36
37

SOURCE

39       o      R. Pan, B. Prabhakar, and K. Psounis, "CHOKe, A Stateless Active
40              Queue Management Scheme for Approximating Fair Bandwidth Alloca‐
41              tion", IEEE INFOCOM, 2000.
42
43       o      A.  Tang,  J. Wang, S. Low, "Understanding CHOKe: Throughput and
44              Spatial Characteristics", IEEE/ACM Transactions  on  Networking,
45              2004
46
47

AUTHOR

53       sched_choke was contributed by Stephen Hemminger.
54
55
56
57iproute2                          August 2011                            TC(8)