projects / mirror_iproute2.git / blame
| Commit | Line | Data |
|---|---|---|
| b1978178 FW |
1 | .TH TC 8 "August 2011" "iproute2" "Linux" |
| 2 | .SH NAME | |
| 3 | choke \- choose and keep scheduler | |
| 4 | .SH SYNOPSIS | |
| 5 | .B tc qdisc ... choke | |
| 6 | .B limit | |
| 9fb6dc2b | 7 | packets |
| b1978178 | 8 | .B min |
| 9fb6dc2b | 9 | packets |
| b1978178 | 10 | .B max |
| 9fb6dc2b | 11 | packets |
| b1978178 FW |
12 | .B avpkt |
| 13 | bytes | |
| 14 | .B burst | |
| 15 | packets | |
| 16 | .B [ ecn ] [ bandwidth | |
| 17 | rate | |
| 18 | .B ] probability | |
| 19 | chance | |
| 20 | ||
| 21 | .SH DESCRIPTION | |
| 22 | ||
| 23 | CHOKe (CHOose and Keep for responsive flows, CHOose and Kill for unresponsive flows) | |
| 24 | is a classless qdisc designed to both identify and penalize flows that monopolize the | |
| 9fb6dc2b | 25 | queue. CHOKe is a variation of RED, and the configuration is similar to RED. |
| b1978178 FW |
26 | |
| 27 | .SH ALGORITHM | |
| 28 | Once the queue hits a certain average length, a random packet is drawn from the | |
| 29 | queue. If both the to-be-queued and the drawn packet belong to the same flow, | |
| 30 | both packets are dropped. Otherwise, if the queue length is still below the maximum length, | |
| 31 | the new packet has a configurable chance of being marked (which may mean dropped). | |
| 32 | If the queue length exceeds | |
| 1b3c149b AS |
33 | .BR max , |
| 34 | the new packet will always be marked (or dropped). | |
| b1978178 | 35 | If the queue length exceeds |
| 1b3c149b AS |
36 | .BR limit , |
| 37 | the new packet is always dropped. | |
| b1978178 FW |
38 | |
| 39 | The marking probability computation is the same as used by the RED qdisc. | |
| 40 | ||
| 41 | .SH PARAMETERS | |
| 9fb6dc2b FW |
42 | The parameters are the same as for RED, except that RED uses bytes whereas choke |
| 43 | counts packets. See | |
| b1978178 FW |
44 | .BR tc-red (8) |
| 45 | for a description. | |
| 46 | ||
| 47 | .SH SOURCE | |
| 48 | .TP | |
| 49 | o | |
| 50 | R. Pan, B. Prabhakar, and K. Psounis, "CHOKe, A Stateless | |
| 51 | Active Queue Management Scheme for Approximating Fair Bandwidth Allocation", | |
| 52 | IEEE INFOCOM, 2000. | |
| 53 | .TP | |
| 54 | o | |
| 55 | A. Tang, J. Wang, S. Low, "Understanding CHOKe: Throughput and Spatial | |
| 56 | Characteristics", IEEE/ACM Transactions on Networking, 2004 | |
| 57 | ||
| 58 | .SH SEE ALSO | |
| 59 | .BR tc (8), | |
| 60 | .BR tc-red (8) | |
| 61 | ||
| 62 | .SH AUTHOR | |
| 63 | sched_choke was contributed by Stephen Hemminger. |