Presentation is loading. Please wait.

Presentation is loading. Please wait.

Congestion Control Thanks to Kai Shen ’ s Networking Course at the University of Rochester.

Similar presentations


Presentation on theme: "Congestion Control Thanks to Kai Shen ’ s Networking Course at the University of Rochester."— Presentation transcript:

1 Congestion Control Thanks to Kai Shen ’ s Networking Course at the University of Rochester.

2 Two Senders, One Router, Two Receivers C (or capacity) is maximum transmission rate that router can sustain. Packets Backup In Network Host C Host D

3 Assume both HostA and HostB send packets at the same rate. As send rate aproaches half the router ’ s capacity, the receive rate is throttled by the router. The total receive rate can never exceed “ C ”, so the receive rate for HostC or HostD can never exceed “ C/2 ” The residence time (Service Time plus Wait Time) can be used to compute the delay caused by the router: Residence Time = Service Time / (1 – Utilization) As send rate approaches C/2, the router ’ s utilization approaches 100%. This creates the exponential rise in the curve above.

4 Data for Exponential Curve

5 Host D Host C Buffer Overflow In Network

6 ATN ABR Network-Assisted Congestion Control

7 TCP Congestion Control Example 1 23 4567 89 101112 13 1415 16

8 TCP Congestion Control Example

9 TCP Efficiency: Large Congestion Window

10 TCP Efficiency: Small Congestion Window


Download ppt "Congestion Control Thanks to Kai Shen ’ s Networking Course at the University of Rochester."

Similar presentations


Ads by Google