# Answered! In selective repeat, assume the sender is using the ambiguity window constraint of is W = 2b-1, with b bits in the…

In selective repeat, assume the sender is using the ambiguity window constraint of is W = 2b-1, with b bits in the sequence number. Let b = 4, so frames are numbered cyclically, from 0 t 15. Make the assumptions that signals can’t jump over each other in time, and that error detection is perfect. Suppose the receiver has correctly received all frames numbered up through 10, a gap from 11, and also has received frames 12 and 13 immediately after the gap.

a) What is the number of the oldest frame that could come to the receiver when the receiver is in this state? Note the receiver doesn’t know what acknowledgments have successfully returned to the sender, other than what can be deduced based on knowing the sender’s window rule.

Don't use plagiarized sources. Get Your Custom Essay on
Answered! In selective repeat, assume the sender is using the ambiguity window constraint of is W = 2b-1, with b bits in the…
GET AN ESSAY WRITTEN FOR YOU FROM AS LOW AS \$13/PAGE

b) In this state, what is the most advanced frame number that the sender would be allowed to send without violating the condition to prevent ambiguity?