This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: ECE 547: Homework 6 Due: Dec. 2 1. Solve problems 6-2 and 6-6 in Schwartz. 2. Show that Dijkstras algorithm presented in class converges in a finite number of steps and finds a shortest path solution. 3. In this problem, we will study how the AIMD property of the TCP congestion avoidance phase can result into fairness. Consider two TCP flows sharing a common bottleneck link. At time 0, their congestion window sizes are 8 and 1, respectively. Assume that both flows are in the congestion avoidance phase already, and both flows use fast-recovery. Hence, when there is a packet loss, both flows will cut their congestion window by half, and then resume the congestion avoidance phase. Assume that both flows have the same round trip time. Further, assume that the capacity of the bottleneck link is such that, whenever the total window size of the two flows is 12, both flows will experience a packet loss....
View Full Document
This note was uploaded on 01/27/2010 for the course ECE 547 taught by Professor Xiaojunlin during the Fall '09 term at Purdue University-West Lafayette.
- Fall '09