TCP/IP 是現今主要的網際網路協定，它原本只是針對有線環境的擁塞控制而設定的。封包在無線環境中經常的random loss是有線環境中所沒有的。因此，TCP在無線環境的效能比在有線環境還差。所以用數學分析來模擬無線TCP的效能是有必要的，此外在我們的分析中也考慮到RED及DropTail路由的效應。因而無線TCP的傳輸率可以用RED路由的平均佇列長度及無線環境random loss機率的函式來表示。

此外我們也使用Forward Error Correction 來減低封包的遺失率，並且自動的調整Reed-Solomon碼的比率來最佳化無線TCP的傳輸效能。而使用Reed-Solomon碼的無線TCP傳輸率也以數學來加以分析。

TCP/IP is the dominant protocol in today’s Internet. Basically, it was designed only to perform congestion control for wired environment. The wireless environment is quite different from wired one, and packet loss in the wireless environment is due to random loss frequently. For this reason, the performance of TCP in the wireless environment is worse than in the wired one. Therefore, modeling the wireless TCP throughput by mathematical analysis is a desirable method to understand the performance of TCP in wireless. In addition, the effect of RED and DropTail routers are considered in our mathematical analysis. The wireless TCP throughput is modeled as a function of wireless loss rate and average queue length of RED router.

Moreover, we use Forward Error Correction to improve the packet loss rate and maximize the wireless TCP performance by adjusting the Reed-Solomon code rate automatically. The throughput of wireless TCP with Reed-Solomon codes was also modeled.

Content
Chapter 1 Introduction 1
Chapter 2 Related Works 4
2.1 Overview of Reed-Solomon Codes 4
2.1.1 Introduction of Reed-Solomon Codes 4
2.1.2 Properties of Reed-Solomon Codes 6
2.2 TCP Problems over Wireless Links 8
2.2.1 Corruption 8
2.2.2 Excess Delays 9
2.2.3 High Loss Probability 10
2.3 Algorithms improving TCP performance over wireless links 10
Chapter 3 Performance Analysis of Wireless TCP 13
3.1 Wired TCP Throughput Model 14
3. 2 Mathematical Model for Wireless TCP 16
3.2.1 A Single Congested Router 17
3.2.2 A Network of Multiple Congested Routers 18
3.2.3 Multiple Congested Routers And Wireless Links with RS Code 21
3.2.4 DropTail Routers 23
Chapter 4 Simulations 24
4.1 A Single Congested Router 24
4.1.1 TCP Reno for A Single Congested Router 25
4.1.2 TCP with RS Code for Single Congested Router 28
4.2 A Network of Multiple Congested Routers 29
4.2.1 TCP Reno in A Network of Multiple Congested Routers 30
4.2.2 TCP Reno with RS Code in A Network of Multiple Congested Routers 32
Chapter 5 Experiments for Wireless TCP with Reed-Solomon Codes 33
Description & Components 34
5.1 Experiments for Wireless TCP with Reed-Solomon Codes 35
5.1.1 RS with Block Size 127 Symbols 35
5.2 RS with Block Size 63 Symbols 37
5.3 Decoding Time for Various RS Block Size 38
Chapter 6 Experiments for Wireless TCP with Adaptive Reed-Solomon Codes 41
6.1 ARSC Design 42
6.1.1 Adaptive Reed-Solomon Code in Client Site (ARSCCS) 42
6.1.2 Adaptive Reed-Solomon Code in Server Site (ARSCSS) 42
6.1.3 Communication Between ARSCCS And ARSCSS 45
6.2 The State Diagram for Adaptive Reed-Solomon Codes 46
6.3 Experiments for Adaptive Reed-Solomon Codes 47
Chapter 7 Conclusions 53
Bibliography 55

Bibliography
[1] J. Padhye, V. Firoiu, D. Towsley, and J. Kurose, "Modeling TCP Reno Performance: a Simple Model and Its Empirical Validation," IEEE/ACM Trans. on Networking, Apr. 2000.

[2] Tian Bu and Don Towsley, "Fixed Point Approximations for TCP Behavior in an AQM Network," ACM Sigmetrics, June 2001.

[3] S. Floyd and T. Henderson, "The NewReno Modification to TCP's Fast Recovery Algorithm," RFC2582, Apr. 1999.

[4] V. Firoiu and M. Borden, "A study of Active Queue Management for Congestion Control," Proc. of the 2000 IEEE Infocom, Mar 2000.

[5] M. Mathis and J. Mahdavi, S. Floyd, and A. Romanow, "TCP Selective Acknowledgement Options," RFC2018, Oct. 1996.

[6] S. Floyd, "Issues of TCP with SACK," Technical report, Jan. 1996.

[7] S. MCanne and S. Flody, ns-LBL network simulator, 1997 obtain via http://mash.cs.berkeley.edu/ns/ns.html

[8] S. Lin and D. J. Costello, " Error Correcting Coding: Fundamentals and Applications." Prentice Hall, Englewood Cliffs, NJ, 1983.

[9] F. J. MacWilliams and N. J. A. Sloane, " The Theory of Error-Correcting Codes." North-Holland, Amsterdam, 1981.

[10] S. Floyd and V. Jacobson, "Random Early Detection gateways for Congestion Avoidance," IEEE/ACM Transactions on Networking, August 1993.

[11] V. Jacobson, “ Congestion Avoidance and Control,” ACM SIGCOMM, 1988.

[12] V. Jacobson, “Modified TCP Congestion Control Avoidance Algorithm,” mailing list, end2end-interest, 30 April 1990.

[13] V. Paxson, “TCP Congestion Control,” RFC2581, April 1999.

[14] W. Stevens, “TCP Slow Start, Congestion Control, Fast Retransmit, and Fast Recovery Algorithm,” RFC2001, January 1997.

[15] R. Caceres, L. Iftode, “Improving The Performance of Reliable Transport Protocols in Mobile Computing Environments,” IEEE journal on selected areas in communications, June 1995

[16] A. Bakre, B.R. Badrinath, “I-TCP: Indirect TCP for Mobile Hosts,” ICDCS, October 1995.

[17] K. Brown, S. Singh, “M-TCP: TCP for Mobile Cellular Networks,” Computer Communication Review (a publication of ACM SIGCOMM), October 1997.

[18] P. Sinha, N. Venkitaraman, R. Sivakumar and V. Bharghavan, “WTCP: A Reliable Protocol for Wireless Wide-Area Networks,” Mobicom, 1999.

[19] A. Bakre and B.R. Badrinath, “Implementation and Performance Evaluation of Indirect-TCP,” IEEE Transactions on Computers, March 1997

[20] J. Postel, “Transmission Control Protocol,” RFC793, September 1981.