Recent acknowledgement support for ns-3 TCP

dc.contributor.authorBakshi, S.
dc.contributor.authorTahiliani, M.P.
dc.date.accessioned2020-03-30T10:23:00Z
dc.date.available2020-03-30T10:23:00Z
dc.date.issued2019
dc.description.abstractRecent Acknowledgement (RACK) is a TCP packet loss detection technique proposed by Google. It uses the notion of time to detect packet losses instead of packet or sequence counting approaches like Fast Retransmit and other non-standard techniques. RACK algorithm is described in an Internet Draft in the TCP Maintenance Working Group (tcpm) at IETF and is the de facto loss detection technique since Linux 4.4. However, to the best of our knowledge, there does not exist a model to study RACK using network simulators. Network simulations provide flexibility to extensively evaluate the upcoming network protocols without resorting to complex real-time experiments. In this paper, we propose the design, implementation and validation of a new model for RACK in ns-3. We evaluate RACK by comparing its performance with Fast Retransmit and verify that the model in ns-3 exhibits key attributes of RACK. � 2019 ACM.en_US
dc.identifier.citationACM International Conference Proceeding Series, 2019, Vol., , pp.9-16en_US
dc.identifier.urihttps://idr.nitk.ac.in/handle/123456789/8908
dc.titleRecent acknowledgement support for ns-3 TCPen_US
dc.typeBook chapteren_US

Files