Networking Lecture 07 - TCP Congestion Control

Outline: 0:10 Last Lecture: TCP 3:03 Congestion Control 5:49 What would happen without congestion control? 7:22 Shared congestion causes more inefficiency 9:49 Two general types of congestion control 12:13 Observing congestion 16:27 TCP "Reno" 21:26 TCP Reno congestion control operates in phases 24:31 Congestion control states 25:06 TCP Reno throughput 27:01 Steve’s Haircut Algorithm 29:04 Incentive to follow TCP rules? 33:37 TCP Reno congestion control iteration 36:36 Reno eventually leads to equal share of bandwidth 41:53 Intermission 42:03 Driving past Reno 44:38 Problems with TCP Reno 49:08 Packet loss means full queues and wasted time! 54:54 Vegas and BBR Congestion Control 59:54 BBR in action 1:00:26 A few final tweaks for TCP 1:00:38 Nagle’s algorithm merges small packets 1:03:28 Interactive applications 1:06:14 TCP Keepalive 1:08:32 TCP Recap These lectures were delivered by Professor Steve Tarzia in Fall 2020 for the CS-340 Introduction to Computer Networking course at Northwestern University. Course materials and slides can be downloaded from https://stevetarzia.com/teaching