Please use this identifier to cite or link to this item: https://doi.org/10.1016/S1389-1286(01)00310-3
Title: TCP HACK: A mechanism to improve performance over lossy links
Authors: Balan, R.K.
Lee, B.P.
Kumar, K.R.R.
Jacob, L. 
Seah, W.K.G. 
Ananda, A.L. 
Keywords: Protocol analysis
Protocol design
Wireless networks
Issue Date: 2002
Source: Balan, R.K., Lee, B.P., Kumar, K.R.R., Jacob, L., Seah, W.K.G., Ananda, A.L. (2002). TCP HACK: A mechanism to improve performance over lossy links. Computer Networks 39 (4) : 347-361. ScholarBank@NUS Repository. https://doi.org/10.1016/S1389-1286(01)00310-3
Abstract: In recent years, wireless networks have become increasingly common and an increasing number of devices are communicating with each other over lossy links. Unfortunately, TCP performs poorly over lossy links as it is unable to differentiate the loss due to packet corruption from that due to congestion. In this paper, we present an extension to TCP which enables TCP to distinguish packet corruption from congestion in lossy environments resulting in improved performance. We refer to this extension as the HeAder ChecKsum option (HACK). We implemented our algorithm in the Linux kernel and performed various tests to determine its effectiveness. Our results have shown that HACK performs substantially better than both selective acknowledgement (SACK) and NewReno in cases where burst corruptions are frequent. We also found that HACK can co-exist very nicely with SACK and performs even better with SACK enabled. © 2002 Elsevier Science B.V. All rights reserved.
Source Title: Computer Networks
URI: http://scholarbank.nus.edu.sg/handle/10635/43053
ISSN: 13891286
DOI: 10.1016/S1389-1286(01)00310-3
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

10
checked on Dec 7, 2017

WEB OF SCIENCETM
Citations

5
checked on Nov 28, 2017

Page view(s)

87
checked on Dec 11, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.