A Robust Acknowledgement Scheme for Unreliable Flows

Abstract—The increasing presence of UDP traffic in the Internet and the emergence of sensing applications which do not require full reliability motivates the search for a robust acknowledgement scheme for unreliable flows. TCP-styled cumulative ack relies on the eventual retransmission of all lost packets and hence cannot be used for unreliable flows. Our contribution is the design and analysis of a simple, yet robust acknowledgement scheme for unreliable flows. We show that our scheme achieves good performance even when the actual network conditions deviate from the designer’s estimate. It works in networks having orders of magnitude difference in bandwidth and loss probability, with little variation of overhead and no change to the algorithms.

• Type: Conference
• Year: 2002
• Where: INFOCOM
• Authors: Hoi-sheung Wilson So, Ye Xia, Jean C. Walrand
• Keywords: Communications, Cumulative Ack Relies, INFOCOM 2002, Robust Acknowledgement Scheme, Unreliable flows