I am an undergraduate studying Data Coms and Networking and this question about go-back-N ARQ popped up that I am struggling to get my head around and cant find anything similar online. Any help at all would be greatly appreciated.
The only thing I have at all is that throughput could be defined by (Packet bits + overhead)/N. Is this at all on the right path?
QUESTION Consider the Go-Back-N ARQ protocol with N=5 and 4 bits used for sequence numbering. The user data frame is 3000 bits long where 100 bits are overhead for header and error check, etc. The frame transmission rate is 2Mbps. Assume that the medium does not reorder the frames. The outstanding frames will be retransmitted when the sending window becomes empty. The probability that a data frame would be received without any errors is 0.3.
i) What is the effective data transmission rate of this protocol?
ii) Suppose that at time t, the receiver is waiting for an information frame with binary sequence number 1001. What is the possible sequence number Slast in binary inside the sender’s window at time t? Justify your answer.