ZuoTi.Pro
Question

(a) In a sliding window protocol with RWS=SWS=5, a very large set of possible sequence numbers...

(a) In a sliding window protocol with RWS=SWS=5, a very large set of possible sequence numbers (assume no wrapping), and in-order packet arrivals, why can the receiver be assured -3- that it will never again receive the frame with sequence number 10 if it is currently expecting frame 17?

(b) For the sliding window protocol, if the sender’s window size (SWS) equals the receiver’s window size (RWS), what is the minimum number of sequence numbers that are required? How many bits must be reserved in the packet header for sequence numbers?

(c) For the go-back-N protocol with N, the send window size, equal to 8, what is the smallest number of sequence numbers that are needed to ensure reliable delivery of the frames?

engineering   Computer-Science   
0 0
Add a comment Improve this question Transcribed image text
Next > < Previous
Sort answers by oldest

Homework Answers

Answer #1

0 Ansoer aud 仑。 -fo -the cond oos? 3c qe 5 here ) . Sodh 9n turn meant Cb number e header is eaval to2 NO Seavenco lumblrC hava o S eaui rad loq tog

0 0
Add a comment
Know the answer?
Add Answer to:
(a) In a sliding window protocol with RWS=SWS=5, a very large set of possible sequence numbers...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions

  • Consider a Go-Back-N protocol with a sender window size of 5 and a sequence number range...

    Consider a Go-Back-N protocol with a sender window size of 5 and a sequence number range of 1,024, and assume the receiver sends ACKs with the number of the next sequence number expected. Suppose that at time t, the next in-order packet that the receiver is expecting is a packet with the sequence number 8. Assume that the channel does not reorder packets. (a) What are the possible sets of sequence numbers inside the sender’s window at time t? Justify...

  • 3. On a connection using the Sliding Window protocol, on the Sender side, Last Acknowledgement Received...

    3. On a connection using the Sliding Window protocol, on the Sender side, Last Acknowledgement Received (LAR) = 3 and Send Window Size (SWS) = 15. What is the highest sequence number packet that the sender can send at this point? What does the Sender currently do with the packet with sequence number 21?

  • 25. Suppose you are designing a sliding window protocol for a 1-Mbps point-to-point link to the...

    25. Suppose you are designing a sliding window protocol for a 1-Mbps point-to-point link to the stationary satellite evolving around the Earth at an altitude of 3 x 104 km. Assuming that each frame carries 1 KB of data, what is the minimum number of bits you need for the sequence number in the following cases? Assume the speed of light is 3 x 108 m/s. (a) RWS-1 (b) RWS-SWS

  • Since the range of sequence numbers is so large relative to the window size, when answering...

    Since the range of sequence numbers is so large relative to the window size, when answering the questions, you don’t need to worry about the necessity of wrapping the sequence numbers from the higher end (1023) back to the lower end (0). 1.Consider the go-back-n protocol with a sender window size N=4 and a sequence number range of 0-1023. (Apparently, for some reason, this sender is not using the maximum possible value 1023 as its window size, but that is...

  • Sliding window protocol with window size of 7 frames are used between the data link layers of mac...

    please answer the question clearly. Sliding window protocol with window size of 7 frames are used between the data link layers of machines A and B. Assume that machine B sends an ACK (acknowledgement) for every frame it receives without error, and it sends a NAK (negative acknowledgement) for every frame it receives with error. This corresponds to a receiver window size of 1 frame. Assume also that no frames are lost in the transmission medium. For the scenario shown...

  • (a) Assume a Sliding Window with Go-Back N ARQ is being used on a transmission link...

    (a) Assume a Sliding Window with Go-Back N ARQ is being used on a transmission link with a 3-bit sequence number. The transmitter has previously sent frames with sequence numbers 0, 1 and 2. Is the transmitter allowed to send a frame with sequence number 3 if the frame with sequence number 2 has not been acknowledged? Explain your answer. (b) Assume a Sliding Window with Go-Back N ARQ is being used on a transmission link with a 3-bit sequence...

  • 2. Suppose that we run the sliding window algorithm with SWS=5 and RWS=3, and no out-of-order...

    2. Suppose that we run the sliding window algorithm with SWS=5 and RWS=3, and no out-of-order arrivals. Also, assume the sequence numbers start with 0. a) Find the smallest value for MaxSeqNum so that we do not have the problem of being able to distinguish between different incarnations of the same sequence numbers. You may assume that it suffices to find the smallest MaxSeqNum such that if DATA[MaxSeqNum] is in the receive window, then DATA[O] can no longer arrive. b)...

  • You are hired to design a reliable byte-stream protocol that uses a sliding window (like TCP)....

    You are hired to design a reliable byte-stream protocol that uses a sliding window (like TCP). This protocol will run over a 1-Gbps network. The RTT of the network is 200 ms. How many bits would you include in the AdvertisedWindow field of your protocol header? (choose the closest number that can satisfy the above requirement). Hints: - First, determine how much data to keep the pipe full (i.e. delay * bandwidth) - Second, if we assume the window is...

  • Consider a 1-Mbps satellite channel. Frame length is 1000 bits and the probability of an unsucces...

    Please, answer all the parts of the question. The subject is Networking. Consider a 1-Mbps satellite channel. Frame length is 1000 bits and the probability of an unsuccessfiul frame transmission is P. Assume that the errors on different frames are independent. Neglect acknowledgment transmission time and receiver processing time and assume a sliding window protocol, using the selective-repeat ARQ method of error recovery. Assume t-50x10° seconds (a) What is the average number of transmission per frame N Assume P 0.01...

  • You are designing a reliable byte stream transport layer protocol (not TCP) to operate over a...

    You are designing a reliable byte stream transport layer protocol (not TCP) to operate over a 1x107 bps network and it is using a sliding window for flow control. The time for keeping the transmission pipe full is taken to be the RTT of the network which is 50ms. Each number in the advertised window or sequence number represents 2 bytes of data. a) What is the minimum number of bits necessary for the Advertised Window field of your protocol...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT