Paper Info
Title
Finding an Optimum Maximum Congestion Window for TCP Reno over 802.11 Based Ad Hoc Networks
Abstract
Bandwidth delay product (BDP) represents the maximum amount of allowed unacknowledged data in flight at any moment in the network. Due to the spatial reuse property of 802.11 MAC protocol in multi-hop ad hoc networks, the BDP of the path approximates 1/4 of the path length and is a value of several packets. With such a small BDP, TCP cannot work efficiently since its congestion window increases far beyond BDP most of the time, which can generate heavy congestion in the network. This paper presents a mathematical approach to derive an optimum maximum congestion window for TCP Reno over 802.11 based ad hoc networks. We adopt a Markov renewal approach to analyze the behavior of TCP Reno, which incorporates an accurate and realistic modelling of the fast-recovery process. Through analysis, we find that the optimum maximum congestion window is 6 packets for a multi-hop chain with any path length.
Year
DOI
Venue
2007
10.1109/WCNC.2007.663
WCNC
Keywords
Field
DocType
markov renewal approach,tcp reno,telecommunication congestion control,multihop chain,transport protocols,access protocols,ad hoc networks,markov processes,optimum maximum congestion window,throughput,bandwidth,computer networks,propagation delay,bandwidth delay product,ad hoc network,aerospace engineering,spread spectrum communication,wireless communication
H-TCP,TCP Westwood plus,CUBIC TCP,TCP Vegas,Computer science,Computer network,Real-time computing,Network congestion,TCP tuning,TCP global synchronization,TCP Friendly Rate Control
Conference
ISSN
ISBN
Citations 
1525-3511 E-ISBN : 1-4244-0659-5
1-4244-0659-5
1
PageRank 
References 
Authors
0.35
3
3
Name
Order
Citations
PageRank
Xia Li110.35
Peng Yong Kong213318.92
Kee-Chaing Chua32145156.27