Abstract | ||
---|---|---|
The increasing presence of UDP traffic in the Inter- net 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 anal- ysis 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 dif- ference in bandwidth and loss probability, with little variation of overhead and no change to the algorithms. |
Year | DOI | Venue |
---|---|---|
2002 | 10.1109/INFCOM.2002.1019401 | INFOCOM |
Keywords | Field | DocType |
feedback,robustness,performance,error correction,transport protocols,robust control,cumulant,bandwidth,internet | Computer science,Retransmission,Network packet,Computer network,Robustness (computer science),Error detection and correction,Bandwidth (signal processing),Acknowledgement,Robust control,Distributed computing,The Internet | Conference |
Volume | ISSN | ISBN |
3 | 0743-166X | 0-7803-7476-2 |
Citations | PageRank | References |
3 | 0.53 | 8 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Hoi-Sheung Wilson So | 1 | 382 | 24.78 |
Ye Xia | 2 | 352 | 31.20 |
Jean C. Walrand | 3 | 898 | 168.78 |