Station A needs to send a message consisting of 9 packets to Station B using a sliding window (window size 3) and go-back-n error control strategy. All packets are ready and immediately available for transmission. If every 5th packet that A transmits gets lost (but no acks from B ever get lost), then what is the number of packets that A will transmit for sending the message to B?
16 is the answer m sure our coachin teacher solved it this question haunted me a lot
1234567 timme out since window size is 3 it can have 3 unacknowl frames therfore even 5 acknow. doesnt arrive 6n7 are sent and after 7 is sent timer for 5 expires causing it to send 567 in its window