Taxonomy of Congestion Control - Example Classification

Example Classification

The following is one possible classification according to the following properties:

  1. The type and amount of feedback received from the network: Loss (L); delay (D); single-bit (S) or multi-bit (M) explicit signals
  2. Incremental deployability on the current Internet: Sender needs modification (S); receiver needs modification (R); routers/gateways need modification (G)
  3. The aspect of performance it aims to improve: high bandwidth-delay product networks (B); lossy links (L); fairness (F); advantage to short flows (S); variable-rate links (V); speed of convergence (C)
  4. The fairness criterion it uses: max-min (M), proportional (P), "minimum potential delay" (D), Other (O)

Some well-known congestion avoidance mechanisms are classified by this scheme as follows:

Variant Feedback Changes Benefits Fairness
(New)Reno L - - D
Vegas D S Less loss P
High Speed L S B O
BIC L S B O
CUBIC L S B O
H-TCP L S B O
FAST D S B P
Compound TCP L/D S B P
Westwood L/D S L O
Jersey L/D S L O
CLAMP M G/R V M
TFRC L S/R No Retransmission D
XCP M S/G/R BLFC M
VCP M(2 bits) S/G/R BLF P
MaxNet M S/G/R BLFSC M
JetMax M S/G/R B M
RED L G Smaller delay ?
ECN S S/G/R Less loss ?

Read more about this topic:  Taxonomy Of Congestion Control