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: CS 118 Spring 2008 : Homework 4 Problem 1 Problem 1 Given a buffer O = 100 Kbytes, sent from server to client. If S = 536 bytes and RTT = 100 msec, and the transport protocol uses static windows with size W : a For a transmission rate of 28 kbps, determine the minimum possible latency. Determine the minimum window size that achieves this latency. b Repeat (a) for 100 kbps. c Repeat (a) for 1 Mbps. d Repeat (a) for 10 Mbps. a Latency = 28.77 sec Window = 2 b Latency = 8.2 sec Window = 4 c Latency = 1 sec Window = 25 d Latency = 0.28 sec Window = 235 Problem 2 Trying to estimate RTTs Given = 0.1, and let: SampleRTT 1 be the most recent sample RTT, and SampleRTT 2 be the next most recent sample RTT, and so on. a In a TCP connection, suppose four acknowledgments have been returned with corresponding sample RTTs: SampleRTT 1 SampleRTT 2 SampleRTT 3 SampleRTT 4 . Express EstimatedRTT in terms of the four sample RTTs....
View Full Document
- Spring '08