Draw a space-time diagram similar to Figure 3.22 of textbook for the following problem: Sender is sending 10 packets to receiver. Stop after 7 packets are accepted by receiver.
Protocol Used: Go-Back-N
Sliding Window size = 6
Timeout interval =1RTT
Assume transmission time of a packet = 1/4 RTT
Assume Packet 1 is lost, then ACK 2 is lost, and then ACK 6 is lost
Note: The sender starts a timer when base = nextseqnum, i.e. at beginning of your example. Then when an ACK is received, if base is not nextseqnum, the timer is started.
Extracted text: Sender Receiver send pkt0 rcv pkt0 send pktl send ACKO rcv pktl send pkt2 send ACK1 X (loss) send pkt3 (wait) rcv pkt3, discard send ACK1 rcv ACKO send pkt4 rcv ACK1 send pkt5 rcv pkt4, discard send ACK1 pkt2 timeout send pkt2 rcv pkt5, discard send pkt3 send ACK1 send pkt4 send pkt5 rcv pkt2, deliver send ACK2 rcv pkt3, deliver send ACK3 Figure 3.22 • Go-Back-N in operation
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here