23. (a) Consider the Go-back- N pipelined protocol we discussed. Let's assume the link layer
needs to transmit k frames with sequence numbers 1 to k (i.e., 1,2,3,,k ) and then another 2k
frames with sequence numbers 1 to 2k. It then repeats these two steps indefinitely. (i) What can
be the maximum sender window size? (ii) Explain the reason for your answer. (b) Design a version
of the selective repeat pipelined protocol between a sender and a receiver, both equipped with a
half-duplex radio and the communication channel between them is noisy..
Global Lehigh Strategic Initiatives (without descriptions)
23 a Consider the Goback N pipelined protocol we discus.pdf
1. 23. (a) Consider the Go-back- N pipelined protocol we discussed. Let's assume the link layer
needs to transmit k frames with sequence numbers 1 to k (i.e., 1,2,3,,k ) and then another 2k
frames with sequence numbers 1 to 2k. It then repeats these two steps indefinitely. (i) What can
be the maximum sender window size? (ii) Explain the reason for your answer. (b) Design a version
of the selective repeat pipelined protocol between a sender and a receiver, both equipped with a
half-duplex radio and the communication channel between them is noisy.
