TY - JOUR
T1 - An efficient flow control approach for TCP over wireless networks
AU - Zabir, Salahuddin Muhammad Salim
AU - Ashir, Ahmed
AU - Shiratori, Norio
N1 - Funding Information:
A part of this research was supported by JGN-2 project and Research Grant of Kiban (B): No. 6300011 from Ministry of Education, Science and Culture, Japan.
PY - 2004/4
Y1 - 2004/4
N2 - Recently, mobile and wireless devices are being incorporated to the Internet at a rapid pace. This initiates the need for optimizing major applications to perform satisfactorily over wireless links. TCP performance over wireless networks is affected by high link errors, low bandwidth and large delay. Existing well established solutions like the Eifel algorithm, TCP I&RW, TCP SACK and D-SACK attempt to address these issues. However, Eifel or TCP I&RW suffer from ACK losses, while TCP SACK or D-SACK introduce overhead in addition to failure in the presence of multiple packet loss. In this paper, we propose a scheme that overcomes the above problems by introducing a concept of indirect acknowledgment. We name this scheme as TCP IACK. Our proposal exploits TCP timestamp option as an additional identifier to TCP segments for the purpose. Furthermore, it deploys one padding byte following TCP timestamp option to recover from ACK loss. Our proposal is therefore, lightweight, more efficient and robust than existing approaches. We also verify these performance implications through experiments.
AB - Recently, mobile and wireless devices are being incorporated to the Internet at a rapid pace. This initiates the need for optimizing major applications to perform satisfactorily over wireless links. TCP performance over wireless networks is affected by high link errors, low bandwidth and large delay. Existing well established solutions like the Eifel algorithm, TCP I&RW, TCP SACK and D-SACK attempt to address these issues. However, Eifel or TCP I&RW suffer from ACK losses, while TCP SACK or D-SACK introduce overhead in addition to failure in the presence of multiple packet loss. In this paper, we propose a scheme that overcomes the above problems by introducing a concept of indirect acknowledgment. We name this scheme as TCP IACK. Our proposal exploits TCP timestamp option as an additional identifier to TCP segments for the purpose. Furthermore, it deploys one padding byte following TCP timestamp option to recover from ACK loss. Our proposal is therefore, lightweight, more efficient and robust than existing approaches. We also verify these performance implications through experiments.
UR - http://www.scopus.com/inward/record.url?scp=3843096051&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=3843096051&partnerID=8YFLogxK
U2 - 10.1142/S0218126604001416
DO - 10.1142/S0218126604001416
M3 - Article
AN - SCOPUS:3843096051
SN - 0218-1266
VL - 13
SP - 341
EP - 360
JO - Journal of Circuits, Systems and Computers
JF - Journal of Circuits, Systems and Computers
IS - 2
ER -