RELATED WORK

Question 1

The design objective of this protocol is to make the recovery time from loss events
be constant regardless of the window size.

Answer 1

Scalable TCP (STCP)

Question 2

largely depends on the current window size.

Answer 2

the recovery time of TCP-NewReno

Question 3

Uses a generalized AIMD where the linear increase factor and multiplicative decrease factor are adjusted by a convex fucntion of the current congestion window size. Most of high-speed TCP variants support this form
of TCP compatibility, which is based on the window size.

Answer 3

HighSpeed TCP (HSTCP)

Question 4

uses the elapsed time () since the last congestion event for calculating the current congestion window size.

Answer 4

HTCP

Question 5

measures the difference () between expected

throughput and actual throughput based on round-trip delays.

Answer 5

TCP-Vegas

Question 6

Determines the current congestion window size
based on both round-trip delays and packet losses over a path. Also updates the sending rate at every other RTT with rate-pacing.

Answer 6

FAST

Question 7

estimates an end-to-end available band-
width by accounting the rate of returning ACKs. This mechanism is effective especially over wireless links where frequent channel losses are misinterpreted as congestion losses and thus TCP reduces the
congestion window unnecessarily.

Answer 7

TCP-Westwood

Question 8

uses a queueing delay to determine an in-
crease factor and multiplicative decrease factor instan-
taneously during the window increment phase.

Answer 8

TCP-Illinois

Question 9

Scales the window increment rule to ensure

fairness among the flows with different RTTs.

Answer 9

TCP-Hybla

Question 10

determines the congestion window size very

similar to TCP-NewReno, but it uses the delay information of TCP-Vegas to differentiate non-congestion losses.

Answer 10

TCP-Veno