Try it on paper first. A hint, the key idea and the worked solution are here when you need them.
A sender uses an automatic repeat query to send packets, one at a time. A packet and its acknowledgement take in all. The timeout is .
A check digit is worked out from the other digits and catches data entry errors. ISBN-13 and bar codes: multiply the digits by from the left and add; the check digit makes the total a multiple of . ARQ: positive acknowledgement (no error), negative acknowledgement (error, resend), and a timeout after which the sender resends.
Have you tried it?
Work it out on paper first. It is fine to get stuck or make a mistake: that is how we learn. When you are ready, go through the solution one step at a time, and check each step against your own.
Step 1. The sends. first sends, plus one more for each of packets , and : .
Step 2. Sends that get a reply. All sends except the lost one get an acknowledgement, positive or negative: sends at , which is .
Step 3. The lost packet. The sender waits the timeout, , and then sends packet again.
Step 4. The total. .
Check. A negative acknowledgement costs one round trip (), but a lost packet costs the whole timeout. That is why a sensible timeout is only a little longer than a round trip.
Answer: (a) packets. (b) .
Log in to join the discussion.
Loading…