NAME<\/a> choke \u2212 choose and keep scheduler<\/p>\n tc qdisc … choke limit<\/b> packets min<\/b> packets max<\/b> packets avpkt<\/b> bytes burst<\/b> packets [ ecn ] [ bandwidth<\/b> rate ] probability<\/b> chance<\/p>\n CHOKe (CHOose and Keep for responsive flows, CHOose and Kill for unresponsive flows) is a classless qdisc designed to both identify and penalize flows that monopolize the queue. CHOKe is a variation of RED, and the configuration is similar to RED.<\/p>\n Once the queue hits a certain average length, a random packet is drawn from the queue. If both the to-be-queued and the drawn packet belong to the same flow, both packets are dropped. Otherwise, if the queue length is still below the maximum length, the new packet has a configurable chance of being marked (which may mean dropped). If the queue length exceeds max<\/b>, the new packet will always be marked (or dropped). If the queue length exceeds limit<\/b>, the new packet is always dropped.<\/p>\n The marking probability computation is the same as used by the RED qdisc.<\/p>\n The parameters are the same as for RED, except that RED uses bytes whereas choke counts packets. See tc-red<\/b>(8) for a description.<\/p>\n o<\/p>\n<\/td>\n R. Pan, B. Prabhakar, and K. Psounis, “CHOKe, A Stateless Active Queue Management Scheme for Approximating Fair Bandwidth Allocation”, IEEE INFOCOM, 2000.<\/p>\n<\/td>\n<\/tr>\n o<\/p>\n<\/td>\n A. Tang, J. Wang, S. Low, “Understanding CHOKe: Throughput and Spatial Characteristics”, IEEE\/ACM Transactions on Networking, 2004<\/p>\n<\/td>\n<\/tr>\n<\/table>\n
SYNOPSIS<\/a>
DESCRIPTION<\/a>
ALGORITHM<\/a>
PARAMETERS<\/a>
SOURCE<\/a>
SEE ALSO<\/a>
AUTHOR<\/a> <\/p>\n
\nNAME <\/a> <\/h2>\n
SYNOPSIS <\/a> <\/h2>\n
DESCRIPTION <\/a> <\/h2>\n
ALGORITHM <\/a> <\/h2>\n
PARAMETERS <\/a> <\/h2>\n
SOURCE <\/a> <\/h2>\n
\n
\n <\/td>\n \n <\/td>\n \n \n <\/td>\n \n <\/td>\n \n SEE ALSO <\/a> <\/h2>\n