Question

(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 number. 1. If the transmitter sends frames 0, 1, 2, and 3, how many more frames can be sent without an acknowledgment returned by the receiver? 2. If the receiver sends back ACK 2, how many more frames can be sent? What are their frame numbers?

(c) Assume a Sliding Window with Selective-Reject ARQ is being used on a transmission link with a 3-bit sequence number. Host A sends frames 0, 1, and 2 to Host B and frame 0 is lost. 1. How many more frames can be received by Host B? 2. What would be the frame number in the Select Rej frame sent back by Host B?

0 1
Add a comment Improve this question Transcribed image text
Answer #1

Go-Back N ARQ (Automatic Repeat Request) • Go-Back N ARQ (Automatic Repeat Request) protocol uses the sliding window process.If the frame with sequence number 2 is not acknowledged, then the frames 2, 3, 4, 6, and 7 will be resent again to the receiv

In Selective-Reject ARQ, only the packet which is lost need to be retransmitted. Here, the sequence number is a 3-bit field.

Add a comment
Know the answer?
Add Answer to:
(a) Assume a Sliding Window with Go-Back N ARQ is being used on a transmission link...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

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
  • 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...

  • 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...

  • Draw two time sequence diagrams: 1. Submit a diagram showing stop-and-wait ARQ where frames 0, 1,...

    Draw two time sequence diagrams: 1. Submit a diagram showing stop-and-wait ARQ where frames 0, 1, and 2 are transmitted successfully and frame 3 is in error and a successful retransmit of frame 3 occurs. 2. Submit a diagram showing Go-back-N ARQ with a window size of seven where frames 0, 1, 2, and 3 are sent. Frames 0, 1, and 3 are received error-free. Frame 2 is damaged in transit and is dropped in the network is not received....

  • (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...

  • 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...

  • The question has parts: a,b,c,d and e. Intro. To Telecommunications Assign#4 (d) Suppose the same situation...

    The question has parts: a,b,c,d and e. Intro. To Telecommunications Assign#4 (d) Suppose the same situation as above but sender and receiver use Selective Repeat ARQ What frame(s) would the sender need to retransmit? Explain. 1. Suppose that a sender and a receiver are using ARQ to perform reliable data delivery. (a) In a Go-Back-N ARQ protocol, the window size is 6. Frames with sequence numbers 1, 2, 3, 4 and 5 have been sent. The sender just received an...

  • Layout the time flow diagram for both Go-Back-N and Selective Repeat ARQ mechanism in the following...

    Layout the time flow diagram for both Go-Back-N and Selective Repeat ARQ mechanism in the following given scenario. Sender Receiver A B Frame o ACK 1 Frame 1 ACK 2 Frame 2 Lost Frame 3 ACK 3 ACK 4 Time Time

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

    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?

  • 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

  • Consider an ARQ algorithm running over 2-Mbps point-to-point link to a stationary satellite orbiting around the...

    Consider an ARQ algorithm running over 2-Mbps point-to-point link to a stationary satellite orbiting around the earth at an altitude of 4 x 104 km. Assume that the speed of light is 3 X 108 m/s and that each frame carries 2 KB (kilobyte) of data. What is the minimum number of bits you need for the sequence number for the following cases? i. RWS = 1 ii. RWS = SWS

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