21. “complete” ack:"
(all are acked) "
cwnd = ssthresh
4 September 2009
CS5229, Semester 1, 2009/10
26
22. “partial” ack:"
(acknowledge n packets)"
retransmit"
cwnd = cwnd - n + 1
4 September 2009
CS5229, Semester 1, 2009/10
27
23. Note: RFC2581/RFC2582 give the
accurate/gory details. Simplified version
is presented here (eg. cwnd vs FlightSize,
update of cwnd upon partial ACK).
4 September 2009
CS5229, Semester 1, 2009/10
29
24. What does a dup
ACK tell us?
4 September 2009
CS5229, Semester 1, 2009/10
30
34. “partial” ack:"
retransmit"
cwnd = cwnd - n + 1"
pipe -= 2"
if pipe < cwnd"
send packet, pipe++
4 September 2009
CS5229, Semester 1, 2009/10
40
35. Idea of SACK:"
Which packet has left the network?"
Where is the gap?"
Decouple when to send and what to
send.
4 September 2009
CS5229, Semester 1, 2009/10
43
36. TCP SACK recovers faster
than NewReno with
multiple losses in a window.
4 September 2009
CS5229, Semester 1, 2009/10
44
40. TCP BIC/CUBIC"
Linux 2.6.x
4 September 2009
CS5229, Semester 1, 2009/10
63
41. Compound TCP "
MS Windows Vista
4 September 2009
CS5229, Semester 1, 2009/10
64
42. TFRC"
equation-based"
congestion control
4 September 2009
CS5229, Semester 1, 2009/10
65
43. Not everyone uses TCP
4 September 2009
CS5229, Semester 1, 2009/10
66
44. UDP:"
Media streaming"
Gaming"
VoIP
4 September 2009
CS5229, Semester 1, 2009/10
67
45. Why not congestion controlled?"
1. UDP has low delay, no need
full reliability. UDP "
is not congestion controlled.
4 September 2009
CS5229, Semester 1, 2009/10
68
46. Why not congestion controlled?"
2. No incentive. OTOH, there
are incentives NOT to use
congestion control.
4 September 2009
CS5229, Semester 1, 2009/10
69