Q BgQuestion:

Pupil
Karma Points: 53
Respect (86%):
posted by  swth on 7/23/2008 3:25:03 PM  |  status: Live  

CS

Course Textbook Chapter Problem
Networking Computer Networking: A Top Down Approach ,4th edition. Jim Kurose, Keith Ross Addison-Wesley, July 2007. N/A N/A
Question Details:
 

1. RTT estimation

You may want to use a spreadsheet or a computer program to calculate the answers to this question.

Recall that the RTT estimation algorithm is:

RTTEstimate = RTTEstimate · (1 − a) + RTTSample · a

Suppose that a TCP connection has experienced a constant RTT of 500ms, so that RTTEstimate is now 500ms. Now suppose the RTT drops to 200ms for the next N measurements, and then returns to 500ms.

(a) Consider the following strategy for setting the timeout:

Timeout = 2 · RTTEstimate

What is the smallest value of N so that a premature timeout will occur when the RTT returns to 500ms? Let a = 0.1 in this case.

(b) Now suppose the timeout is set using a deviation estimate:

DeviationEstimate = DeviationEstimate · (1 − b) + |RTTSample − RTTEstimate| · b

Timeout = RTTEstimate + 4 · DeviationEstimate

with b = 0.25. What will the timeout value be after N measurements of 200ms, using the value of N from the previous question? (Assume that DeviationEstimate is 0 before the RTT drops to 200ms.)

s

AAnswers:

Answer Question

No one has answered this question yet.

Be the first to answer. Earn up to 9 karma points.

Answer Question
Ask New Question

Join Cramster's Community

Cramster.com brings together students, educators and subject enthusiasts in an online study community. With around-the-clock expert help and a community of over 100,000 knowledgeable members, you can find the help you need, whenever you need it. Join for free today »