With the selective repeat protocol (as defined in section 3.4.4 of the textbook), it is possible for the sender to receive an ACK for a packet that falls outside of its current window (Textbook page 294, Problem 24)?Group of answer choicesIt is NOT possible. The selective repeat algorithm is designed to ensure this can not happen.It is possible. The selective repeat algorithm is robust enough to handle this situation.
Question
With the selective repeat protocol (as defined in section 3.4.4 of the textbook), it is possible for the sender to receive an ACK for a packet that falls outside of its current window (Textbook page 294, Problem 24)?Group of answer choicesIt is NOT possible. The selective repeat algorithm is designed to ensure this can not happen.It is possible. The selective repeat algorithm is robust enough to handle this situation.
Solution
It is possible. The selective repeat algorithm is robust enough to handle this situation. In the Selective Repeat Protocol, the sender sends a number of frames specified by a window size even without the need to wait for individual ACK from the receiver. As the sequence number of the frames also falls within the window, the receiver can acknowledge frames without asking the sender to stop. If a frame is lost or damaged, the receiver while acknowledging the received frames, sends a negative acknowledgement for the lost or damaged frame. The sender on receiving the negative acknowledgement retransmits the lost or damaged frame. Therefore, it is possible for the sender to receive an ACK for a packet that falls outside of its current window.
Similar Questions
Answer the same question, but this time for the Go-Back-N algorithm as described in section 3.4.3. Is it possible for a sender using Go-Back-N to receive an ACK for a packet that falls outside its current window?Group of answer choicesIt is NOT possible. The Go-Back-N algorithm is designed to ensure this can not happen.It is possible. The Go-Back-N algorithm is robust enough to handle this situation.
Describe Go Back N and Selective Repeat protocol.
TCP sequence numbers and ACKs (2). Suppose that as shown in the figure below, a TCP sender is sending segments with 100 bytes of payload. The TCP sender sends five segments with sequence numbers 100, 200, 300, 400, and 500. Suppose that the segment with sequence number 300 is lost. The TCP receiver will buffer correctly-received but not-yet-in-order segments for later delivery to the application layer (once missing segments are later received). Complete the sentences below ....After receiving segment 100, the receiver responds with an ACK with value: After receiving segment 200, the receiver responds with an ACK with value: After receiving segment 500, the receiver responds with an ACK with value: After receiving the retransmitted segment 300, the receiver responds with an ACK with value:
A TCP receiver must send an acknowledgement for every segment it receives.Group of answer choicesTrue: for the sender to know that the bytes in each segment have been received the receiver must ACK each segment individually.False: TCP uses cumulative acknowledgements, so the receiver need only send an acknowledgment for the bytes in the segment with the largest sequence number that has been successfully received.
Sliding window protocol works on _________ in which there is simultaneous two-way communicationQuestion 5Select one:a.full duplexb.half duplexc.no duplexd.Multiple Duplexe.single duplex
Upgrade your grade with Knowee
Get personalized homework help. Review tough concepts in more detail, or go deeper into your topic by exploring other relevant questions.