File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/ISDA.2010.5687097
- Scopus: eid_2-s2.0-79851486231
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: On RTO timer implementation in TCP
Title | On RTO timer implementation in TCP |
---|---|
Authors | |
Issue Date | 2010 |
Citation | Proceedings Of The 2010 10Th International Conference On Intelligent Systems Design And Applications, Isda'10, 2010, p. 1350-1354 How to Cite? |
Abstract | The retransmission timeout (RTO) timer used in TCP has long been standardized by the IETF in RFC2988, referred to as the TCP-RFC in this paper. Over the years, various deficiencies have been identified. In this paper, we focus on the implicit RTO offset problem, where the exact timeout limit of each packet is stretched by restarting the timer using the current timer value on the arrival of each acknowledgement (that acknowledges some new data). It would result in a slow timeout detection which unavoidably degrades the TCP throughput. In this paper, we first present a review of the TCP-RFC with special focus on the implicit RTO offset problem. Based on the insights obtained, we propose an enhanced RTO timer implementation, called E-RTO, for TCP. The implicit RTO offset is removed by mimicking the operation of a multi-timer implementation using a single timer. We then compare our E-RTO with TCP-RTO by simulations. We show that the faster timeout detection of our E-RTO leads to a throughput improvement of up to 3%. © 2010 IEEE. |
Persistent Identifier | http://hdl.handle.net/10722/158685 |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Wen, Z | en_US |
dc.contributor.author | Yeung, KL | en_US |
dc.date.accessioned | 2012-08-08T09:00:50Z | - |
dc.date.available | 2012-08-08T09:00:50Z | - |
dc.date.issued | 2010 | en_US |
dc.identifier.citation | Proceedings Of The 2010 10Th International Conference On Intelligent Systems Design And Applications, Isda'10, 2010, p. 1350-1354 | en_US |
dc.identifier.uri | http://hdl.handle.net/10722/158685 | - |
dc.description.abstract | The retransmission timeout (RTO) timer used in TCP has long been standardized by the IETF in RFC2988, referred to as the TCP-RFC in this paper. Over the years, various deficiencies have been identified. In this paper, we focus on the implicit RTO offset problem, where the exact timeout limit of each packet is stretched by restarting the timer using the current timer value on the arrival of each acknowledgement (that acknowledges some new data). It would result in a slow timeout detection which unavoidably degrades the TCP throughput. In this paper, we first present a review of the TCP-RFC with special focus on the implicit RTO offset problem. Based on the insights obtained, we propose an enhanced RTO timer implementation, called E-RTO, for TCP. The implicit RTO offset is removed by mimicking the operation of a multi-timer implementation using a single timer. We then compare our E-RTO with TCP-RTO by simulations. We show that the faster timeout detection of our E-RTO leads to a throughput improvement of up to 3%. © 2010 IEEE. | en_US |
dc.language | eng | en_US |
dc.relation.ispartof | Proceedings of the 2010 10th International Conference on Intelligent Systems Design and Applications, ISDA'10 | en_US |
dc.title | On RTO timer implementation in TCP | en_US |
dc.type | Conference_Paper | en_US |
dc.identifier.email | Yeung, KL:kyeung@eee.hku.hk | en_US |
dc.identifier.authority | Yeung, KL=rp00204 | en_US |
dc.description.nature | link_to_subscribed_fulltext | en_US |
dc.identifier.doi | 10.1109/ISDA.2010.5687097 | en_US |
dc.identifier.scopus | eid_2-s2.0-79851486231 | en_US |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-79851486231&selection=ref&src=s&origin=recordpage | en_US |
dc.identifier.spage | 1350 | en_US |
dc.identifier.epage | 1354 | en_US |
dc.identifier.scopusauthorid | Wen, Z=36190141000 | en_US |
dc.identifier.scopusauthorid | Yeung, KL=7202424908 | en_US |