Section 3.7 Flashcards

1
Q

How is the sending rate typically regulated in a TCP implementation?

A

By keeping a window of size cwnd over the sequence number space, and making sure that no more than cwnd bytes of data are outstanding (i.e, unACKnowledged). The size of cwnd is regulated by AIMD.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

In the absence of loss, TCP slow start increases the sending rate …

A

faster than AIMD. In fact, slowstart increases the sending rate exponentially fast per RTT.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Consider the transport-layer flows interacting at a congested link. In the face of such congestion, what happens at this link to a transport-layer flow that does not cut back on its sending rate?

A

Nothing different from the other flows crossing the congested link.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Assuming that the congestion window size,cwnd, has not yet reached Wmax, TCP CUBIC will ..

A
  1. increase its sending rate faster than AIMD when cwnd is far away from Wmax, but increase slower than AIMD when cwnd is closer to Wmax
  2. always have a window size, cwnd, and hence a sending rate, higher than that of AIMD (assuming a given window size, Wmax, at which loss would occur).
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

What happens to the sending rate when The currently measured throughput is greater than cwnd/RTTmin

A

This should never happen.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

What happens to the sending rate when The currently measured throughput is much less than cwnd/RTTmin

A

decrease the sending rate

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What happens to the sending rate when The currently measured throughput is equal to or a bit less than cwnd/RTTmin

A

increase the sending rate

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Which of the following statements about TCP’s Additive-increase-multiplicative-decrease (AIMD) algorithm are true?

A

AIMD is a end-end approach to congestion control.

AIMD cuts the congestion window size, cwnd, in half whenever loss is detected by a triple duplicate ACK.

AIMD cuts the congestion window size, cwnd, i to 1 whenever a timeout occurs.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Which of the following best completes this sentence: “In the absence of loss, TCP slow start increases the sending rate … “

A

” … faster than AIMD. In fact, slowstart increases the sending rate exponentially fast per RTT.”

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Consider the transport-layer flows interacting at a congested link. In the face of such congestion, what happens at this link to a transport-layer flow that does not cut back on its sending rate?

A

Nothing different from the other flows crossing the congested link.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Assuming that the congestion window size,cwnd, has not yet reached Wmax, TCP CUBIC will … (check all that apply)

A

… always have a window size, cwnd, and hence a sending rate, higher than that of AIMD (assuming a given window size, Wmax, at which loss would occur).

… increase its sending rate faster than AIMD when cwnd is far away from Wmax, but increase slower than AIMD when cwnd is closer to Wmax

How well did you know this?
1
Not at all
2
3
4
5
Perfectly