The RDT 2.2 protocol. Consider the rdt 2.2 sender and receiver below, with FSM transitions labeled in red. Also consider the sender and receiver timeline following the FSMs, where a green OK label indicates a message that is not corrupted, and a red corrupt label indicates a message that is corrupted. We are interested in the sequence number (0 or 1) of a data message, and the ACK number (0 or 1) of an ACK message for the messages sent at t= 2, 3, 4, 5 in the figure below. Which of the following sequences of interleaved data sequence numbers and ACK numbers corresponds to those in the messages sent at t=2 (data sequence number); t=3 (ACK number), t=4 (data sequence number), and t=5 (ACK number)? Only one sequence is correct. explain 1, 1, 1, 1 0, 0, 0, 0 1, 0, 1, 0 0, 1, 1, 0 1, 1, 1, 0 1, 1, 0, 1 1, 0, 0, 1 1, 0, 1, 1 S5rdt_rev(revpkt)&& not corrupt (revpkt)&& isACK (revpkt, 1)AR3rdt_rev(revpkt) &&(corrupt (revpkt)||S4) iSACK(revpkt,0))udt_send(sndpkt)rdt_rev (revpkt) &&(corrupt (revpkt)||has_seql (revpkt))sndpkt-make_pkt(ACK, 1, checksum)udt_send (sndpkt)SO(RO)Wait forcall 0 fromabove(S3)rdt_send (data)(R2)sndpkt-make_pkt (0, data, checksum)udt_send(sndpkt)Wait forACK 1RDT 2.2 senderrdt_send (data)Wait forACK 0Wait forI call 1 fromabovesndpkt-make_pkt (1, data, checksum)udt_send (sndpkt)Wait for0 frombelowextract (revpkt, data)deliver_data (data)sndpkt make_pkt (ACK, 0, checksum)udt_send(sndpkt)rdt_rev (revpkt) && notcorrupt (revpkt)&& has_seq0 (revpkt)RDT 2.2receiverrdt_rev(revpkt) &&(corrupt (revpkt) ||isACK (revpkt, 1))udt_send (sndpkt)rdt_rev (revpkt)& & notcorrupt (revpkt)&& isACK (revpkt,0)extract (rcvpkt, data)deliver_data (data)sndpkt make_pkt (ACK,1, checksum)udt_send(sndpkt)R1Wait for1 frombelowrdt_rev (revpkt) && notcorrupt (revpkt)&& has_seq1 (revpkt)AS1S2rdt_rev (revpkt) & &(corrupt (revpkt) ||has_seq0(revpkt))Dsndpkt-make_pkt (ACK, 0, checksum)udt_send(sndpkt) sendert = 0t=2-t=4-t=6OKHACKcorrupt←ACKcorruptACKQKdataOKdataefdatadatareceiver-t=1-t=3-t = 5

To solve the above problem you can refer this solution

Answered: The RDT 2.2 protocol. Consider the rdt…

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Question

The RDT 2.2 protocol. Consider the rdt 2.2 sender and receiver below, with FSM
transitions labeled in red. Also consider the sender and receiver timeline following the
FSMs, where a green OK label indicates a message that is not corrupted, and a red
corrupt label indicates a message that is corrupted. We are interested in the sequence
number (0 or 1) of a data message, and the ACK number (0 or 1) of an ACK message for
the messages sent at t= 2, 3, 4, 5 in the figure below.

Which of the following sequences of interleaved data sequence numbers and ACK
numbers corresponds to those in the messages sent at t=2 (data sequence number); t=3
(ACK number), t=4 (data sequence number), and t=5 (ACK number)? Only one sequence
is correct. explain
1, 1, 1, 1
0, 0, 0, 0
1, 0, 1, 0
0, 1, 1, 0
1, 1, 1, 0
1, 1, 0, 1
1, 0, 0, 1
1, 0, 1, 1