Chinese Journal of Computers   Full Text
Title	Corruption-based TCP rate adjustment in wireless networks
Authors	XU Chang-Biao1) LONG Ke-Ping2) YANG Shi-Zhong3)
Address
Year	2002
Issue	No.4(445-448)
Abstract &   Background	For a given TCP connection, it is reasonable to assume that the possibility of packet lost by corruption can be obtained approximately from pe=m/n, where n is the number of total packets and m is the sum of packets lost by corruption during the period of time T. In this way, the possibility for n packets to be sent successfully to receiver is p=(1-pe)n, and TCP sender‘s maximum average packet sending rate is ####, where a is the lower limit of p. Based on the main idea, three TCP corruption-based rate adjustment mechanisms can be obtained, namely, two mechanisms driven by the event of packet loss in which TCP sender's packet sending rate is adjusted as soon as packet lost by corruption is detected, and one mechanism driven by TCP sender's sending period in which the rate is only adjusted while sending period expires. In terms of analysis, the mechanisms presented in this paper have the following characteristics: (1) TCP sender's packet sending rate is adjusted self-adaptively by link corruption. (2) Unnecessary packets lost by corruption can be greatly avoided with light influences to throughput and delay through the choice of parameter a #### at the time of heavy packet loss by corruption. (3) The mechanisms can also be simply implemented with less overheads. keywords Wireless network, Packet lost by corruption, Rate adjustment mechanism, Network congestion