l10 TCP Friendliness, DCCP, NATs, and STU

l10 TCP Friendliness, DCCP, NATs, and STU - Lecture 10: TCP...

Info iconThis preview shows pages 1–20. Sign up to view the full content.

View Full Document Right Arrow Icon
Lecture 10: TCP Friendliness, DCCP, NATs, and STUN
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
TCP Friendliness
Background image of page 2
Congestion Control TCP dynamically adapts its rate in response to congestion AIMD causes flows to converge to fair goodput But how do losses (e.g., bit errors) affect goodput? What about UDP?
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Chiu Jain Phase Plots Flow A rate (bps) Flow B rate (bps) Fair A=B Ef±cient A+B=C overload underload t 1 t 2 t 3 t 4 t 5 t 6
Background image of page 4
Responding to Loss Set threshold to cwnd 2 On timeout - Set cwnd to 1 - Causes TCP to enter slow start On triple duplicate ACK (Reno) - Set cwnd to cwnd 2 - Retransmit missing segment - Causes TCP to stay in congestion avoidance
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Analyzing TCP Simply Assume all segments are MSS long Assume a packet loss rate p Assume a constant RTT Assume p is small (no timeouts)
Background image of page 6
Analysis Window size W cuts to W 2 after a loss Grows to W after W 2 RTTs Goodput = 3 4 · W · MTU · 1 RTT
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Window Size p = 1 ( W 2 +( W 2 +1)+ ... + W ) p 1 3 8 W 2 W q 8 3 · p Goodput = 3 4 · q 8 3 · p · MTU · 1 RTT Goodput = 1 . 22 · · p Constant factor changes based on delayed acks, etc.
Background image of page 8
TCP Friendliness Don’t want other protocols to disrupt TCP UDP happily shuts down TCP flows “TCP friendliness:” obeying TCP congestion control as per prior goodput equation - Does not imply acting like TCP - E.g., does not require abrupt window changes
Background image of page 9

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 10
ledbat WG “The LEDBAT WG is chartered to standardize a congestion control mechanism that should saturate the bottleneck, maintain low delay, and yield to standard TCP.” TCP-friendliness is insufficient for modern P2P applications - Flow fairness, not application fairness - TCP fills queues Elastic workloads vs. inelastic workloads
Background image of page 11

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
DCCP
Background image of page 12
DCCP Datagram Congestion Control Protocol (DCCP) provides congestion control for unreliable datagrams (RFC 4340) Connection-oriented protocol - Request-response-ack establishment - Close-reset or CloseReq-Close-reset teardown Counts packets, not bytes
Background image of page 13

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
DCCP Segment
Background image of page 14
Sequence Numbers Every DCCP packet uses a new sequence number - Data - Acknowledgements - Control traffic Acknowledgements are for last packet received - Not cumulative acknowledgements - Does not succinctly describe connection history - Options can give packet vectors
Background image of page 15

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Synchronization DCCP uses sequence number windows to protect from attacks Large bursts of losses cause packets to fall past windows Need to resynchronize
Background image of page 16
Synchronization Exchange
Background image of page 17

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Synchronization on Reset Problem
Background image of page 18
Synchronization on Reset Solution
Background image of page 19

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 20
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 04/02/2012 for the course CS 144 at Stanford.

Page1 / 58

l10 TCP Friendliness, DCCP, NATs, and STU - Lecture 10: TCP...

This preview shows document pages 1 - 20. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online