File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Design and analysis of TCP AIMD in wireless networks

TitleDesign and analysis of TCP AIMD in wireless networks
Authors
KeywordsCompensation scheme
Design and analysis
Generic expression
Network scenario
Packet reordering
Performance Gain
Systematic analysis
Unified solutions
Issue Date2013
PublisherIEEE Communications Society. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000817
Citation
The 2013 IEEE Wireless Communications and Networking Conference (WCNC 2013), Shanghai, China, 7-10 April 2013. In IEEE Wireless Communications and Networking Conference Proceedings, 2013, p. 1422-1427 How to Cite?
AbstractThe class of additive-increase/multiplicative-decrease (AIMD) algorithms constitutes a key mechanism for congestion control in modern communication networks, like the current Internet. The algorithmic behaviour may, however, be distorted when wireless links are present. Specifically, spurious window reductions may be triggered due to packet reordering and non-congestive loss. In this paper, we develop a framework for AIMD in TCP to analyze the aforementioned problem. The framework enables a systematic analysis of the existing AIMD-based TCP variants and assists in the design of new TCP variants. It classifies the existing AIMD-based TCP variants into two main streams, known as compensators and differentiators, and develops a generic expression that covers the rate adaptation processes of both approaches. It further identifies a new approach in enhancing the performance of TCP, known as the compensation scheme. A tax-rebate approach is proposed as an approximation of the compensation scheme, and used to enhance the AIMD-based TCP variants to offer unified solutions for effective congestion control, sequencing control, and error control. In traditional wired networks, the new family of TCP variants with the proposed enhancements automatically preserves the same inter-flow fairness and TCP friendliness. We have conducted a series of simulations to examine their performance under various network scenarios. In most scenarios, significant performance gains are attained. © 2013 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/184991
ISBN
ISSN

 

DC FieldValueLanguage
dc.contributor.authorLai, Cen_US
dc.contributor.authorLeung, KCen_US
dc.contributor.authorLi, VOKen_US
dc.date.accessioned2013-07-15T10:22:17Z-
dc.date.available2013-07-15T10:22:17Z-
dc.date.issued2013en_US
dc.identifier.citationThe 2013 IEEE Wireless Communications and Networking Conference (WCNC 2013), Shanghai, China, 7-10 April 2013. In IEEE Wireless Communications and Networking Conference Proceedings, 2013, p. 1422-1427en_US
dc.identifier.isbn978-1-4673-5939-9-
dc.identifier.issn1525-3511-
dc.identifier.urihttp://hdl.handle.net/10722/184991-
dc.description.abstractThe class of additive-increase/multiplicative-decrease (AIMD) algorithms constitutes a key mechanism for congestion control in modern communication networks, like the current Internet. The algorithmic behaviour may, however, be distorted when wireless links are present. Specifically, spurious window reductions may be triggered due to packet reordering and non-congestive loss. In this paper, we develop a framework for AIMD in TCP to analyze the aforementioned problem. The framework enables a systematic analysis of the existing AIMD-based TCP variants and assists in the design of new TCP variants. It classifies the existing AIMD-based TCP variants into two main streams, known as compensators and differentiators, and develops a generic expression that covers the rate adaptation processes of both approaches. It further identifies a new approach in enhancing the performance of TCP, known as the compensation scheme. A tax-rebate approach is proposed as an approximation of the compensation scheme, and used to enhance the AIMD-based TCP variants to offer unified solutions for effective congestion control, sequencing control, and error control. In traditional wired networks, the new family of TCP variants with the proposed enhancements automatically preserves the same inter-flow fairness and TCP friendliness. We have conducted a series of simulations to examine their performance under various network scenarios. In most scenarios, significant performance gains are attained. © 2013 IEEE.-
dc.languageengen_US
dc.publisherIEEE Communications Society. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000817-
dc.relation.ispartofIEEE Wireless Communications and Networking Conference Proceedingsen_US
dc.rightsIEEE Wireless Communications and Networking Conference. Proceedings. Copyright © IEEE Communications Society.-
dc.rights©2013 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.-
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.subjectCompensation scheme-
dc.subjectDesign and analysis-
dc.subjectGeneric expression-
dc.subjectNetwork scenario-
dc.subjectPacket reordering-
dc.subjectPerformance Gain-
dc.subjectSystematic analysis-
dc.subjectUnified solutions-
dc.titleDesign and analysis of TCP AIMD in wireless networksen_US
dc.typeConference_Paperen_US
dc.identifier.emailLai, C: laichengdi@eee.hku.hken_US
dc.identifier.emailLeung, KC: kacleung@hkucc.hku.hken_US
dc.identifier.emailLi, VOK: vli@eee.hku.hk-
dc.identifier.authorityLeung, KC=rp00147en_US
dc.identifier.authorityLi, VOK=rp00150en_US
dc.description.naturepublished_or_final_version-
dc.identifier.doi10.1109/WCNC.2013.6554772-
dc.identifier.scopuseid_2-s2.0-84881608513-
dc.identifier.hkuros216609en_US
dc.identifier.hkuros225545-
dc.identifier.spage1422-
dc.identifier.epage1427-
dc.publisher.placeUnited States-
dc.customcontrol.immutablesml 131106-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats