DocumentCode
2459340
Title
Developing Slow Start over Wireless Networks
Author
Liu, Yuhua ; Huang, Hao ; Xu, Kaihua ; Yang, Chun
Author_Institution
Dept. of Comput. Sci., Huazhong Normal Univ., Wuhan
fYear
2008
fDate
18-20 Oct. 2008
Firstpage
106
Lastpage
109
Abstract
In wired networks, congestion is the main reason for most of the packet losses and the original TCP is the best option to implement. However, in wireless networks, these losses will arise for reasons other than congestion. TCPW has been proved to work better in performance and bandwidth utilization than Reno and New Reno in wireless networks. Our research mainly focuses on the slow-start phase of TCPW and develops an algorithm to divide the phase into two parts. In this paper, we propose a simple refinement of slow-start algorithm of TCP Westwood (TCPW), which is a TCP variant focused on to achieve higher performance in wireless and wired networks. We show by results that the new theme could reduce possibility of packet loss in wireless networks. In the first half of slow-start, we use the exponential increase just like the original slow-start. Moreover, we grow the congestion window gradually to decrease packet burstiness in the second half of slow-start.
Keywords
bandwidth allocation; radio networks; transport protocols; Reno wireless network; TCP Westwood; bandwidth utilization; congestion window; slow-start algorithm; wired network; Bandwidth; Communication system control; Computer networks; Computer science; Data communication; Delay; Payloads; Protocols; Space technology; Wireless networks;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer and Computational Sciences, 2008. IMSCCS '08. International Multisymposiums on
Conference_Location
Shanghai
Print_ISBN
978-0-7695-3430-5
Type
conf
DOI
10.1109/IMSCCS.2008.40
Filename
4760305
Link To Document