Consider a reliable pipelined transport protocol that uses cumulative ACKs. The window size is 10. The receiver sends an ACK according to the following rule: • send an ACK if 10 consecutive packets...

Consider a reliable pipelined transport protocol that uses cumulative ACKs. The window size is 10. The receiver sends an ACK according to the following rule:

• send an ACK if 10 consecutive packets are received in order thus allowing the sender to advance its sliding window.

• if a packet is received with a sequence number different from the expected next sequence number, then send an ACK corresponding to the highest sequence number received thus far.

(a) 100 packets are sent by the sender. 1 in 10 data packets are lost in transit. Assume no ACK packets are lost. How many ACK packets are actually sent to successfully complete the transmission?

(b) How many ACK packets would have been sent without cumulative ACKs? In this case assume the protocol ACKs every packet individually and if a data packet is received out of order then it re-sends the last ACK packet.