lecture_12_tcpfairness

lecture_12_tcpfairness - andComputerNetworks Lecture 12 TCP...

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

View Full Document Right Arrow Icon
CS 536 Data Communica0ons and Computer Networks Lecture 12: TCP Fairness 10/21/2008 CS 536 Computer Networks 1
Background image of page 1

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

View Full DocumentRight Arrow Icon
Announcements Midterm: Should we go for best-of-two midterms ? Project: Should we ignore project and adjust the weightage to PA 2 ? Currently Programming – 30% (10% + 20%) Written Homeworks – 20% Midterm – 20% Term Project – 20% -- will be removed Final – 30% CS 536 Computer Networks 2
Background image of page 2
Midterm Ave‐ 63.5, Med‐67.3, Max‐89 CS 536 Computer Networks 3
Background image of page 3

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

View Full DocumentRight Arrow Icon
Midterm Problem Assume that there is only one router/switch between a source and destination. The bandwidth of the first link, i.e., from source to the router is $R_1$. The second link, i.e., from router to destination is $R_2$. What is the total time it takes to transfer $K$ bytes from the source to the destination. Ignore queuing, propagation and processing delays. Here, we need the bottleneck bandwidth $B=min\ {R_1,R_2\}$. The end-to-end throughput is basically the bottlenectk bandwidth. Thus, the time it takes to transfer $K$ bytes is $K/B$. CS 536 Computer Networks 4
Background image of page 4
CS 536 Computer Networks Recap : TCP conges0on control: addi0ve increase, mul0plica0ve decrease Approach: increase transmission rate (window size), probing for usable bandwidth, until loss occurs additive increase: increase CongWin by 1 MSS every RTT until loss detected multiplicative decrease : cut CongWin in half after loss time congestion window size Saw tooth behavior: probing for bandwidth 5 This AIMD is also called TCP 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
CS 536 Computer Networks Recap Summary: TCP Conges0on Control When CongWin is below Threshold , sender in slow-start phase, window grows exponentially.
Background image of page 6
Image of page 7
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 10/24/2009 for the course CS 536 taught by Professor Sonia,f during the Spring '08 term at Purdue.

Page1 / 23

lecture_12_tcpfairness - andComputerNetworks Lecture 12 TCP...

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

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