Responsive image
博碩士論文 etd-0803101-180106 詳細資訊
Title page for etd-0803101-180106
論文名稱
Title
考量TCP連線狀態的緩衝區管理法
Buffer Management with Consideration of States in TCP Connections
系所名稱
Department
畢業學年期
Year, semester
語文別
Language
學位類別
Degree
頁數
Number of pages
58
研究生
Author
指導教授
Advisor
召集委員
Convenor
口試委員
Advisory Committee
口試日期
Date of Exam
2001-07-24
繳交日期
Date of Submission
2001-08-03
關鍵字
Keywords
TCP、緩衝區管理法、壅塞控制、公平性
fairness, TCP, congestion control, buffer mangement
統計
Statistics
本論文已被瀏覽 5625 次,被下載 2212
The thesis/dissertation has been browsed 5625 times, has been downloaded 2212 times.
中文摘要
TCP是在網路傳輸層中主要的協定。當網路壅塞時,不論是傳送端上的TCP或是路由器的緩衝區管理法都有他們各自的方法來反映網路壅塞。但往往這兩種做法是獨立的。在TCP方面,許多修正過的TCP版本被提出,如Tahoe, Reno, New Reno, SACK, Vegas, FACK等等。雖然他們比原先的TCP有較好的傳輸效能,但這些不同版本的TCP間的互動卻不理想。並且也有一些本身就對TCP不友善的連線會對TCP有不利的影響。而在緩衝區管理法上,不同連線間的公平性能夠達成。但由於緩衝區管理法對TCP的行為不了解而產生某些現象卻會對TCP造成影響。在這篇論文中,我們說明一個當新連線要加入網路時緩衝區管理法會造成對該條連線不友善的問題。這個問題會造成(1)對TCP不友善的行為(2)使的緩和網路壅塞的功能較沒有效率(3)造成連線間的不公平。我們提出一個方法來解決這個問題並且這方法相當容易運作到一些現行的緩衝區管理法上。
Abstract
TCP is the most popular transport layer protocol. When there is congestion in the network, either sender’s TCP or router’s buffer management has its way to resist the penalties of congestion. But each of them achieves this goal in an independent way. In TCP, Tahoe, Reno, New Reno, SACK, Vegas, FACK, and some modifications to TCP to improve performance were proposed. Although they have better performance than previous TCP, the cooperation between different types of TCP is not well. And TCP-unfriendly connections will be adverse to TCP connections. In buffer management, the fairness between different connections can be maintained. But some phenomena will be adverse to TCP connection because of buffer management is TCP-unawareness. In this paper, we show a problem that buffer management scheme may be unfriendly to new connection which is going to join the network with congestion. This problem will incur (1) TCP-unfriendly behavior, (2) alleviating congestion inefficiently, (3) unfairness between two connections. We propose a scheme to alleviate this problem and this scheme is easy to implement with existing buffer management scheme.
目次 Table of Contents
Abstract………………………………………………………………………………..i
Contents……………………………………………………………………………….ii
List of Figures………………………………………………………………………..iii
List of Tables………………………………………………………………………….iv
Chapter 1. Introduction..………………………………………………………………1
Chapter 2. Brief Introduction of TCP…..……………………………………………..3
2.1. Flow Control in TCP……………………………………………………...3
2.2. Congestion Control in TCP……………………………………………….5
2.3. Evolution in TCP………………………………………………………….7
2.3.1. New Reno TCP……………………………………………………7
2.3.2. SACK TCP………………………………………………………..7
2.3.3. TCP Vegas………………………………………………………...8
2.3.4. FACK TCP………………………………………………………..9
2.3.5. Problems between different types of TCP……………………….10
Chapter 3. Brief Introduction of Buffer Management..………………………………11
3.1. RED……………………………………………………………………...12
3.2. LQD……………………………………………………………………...15
3.3. EFD……………………………………………………………………...17
Chapter 4. The Problem..…………………………………………………………….18
Chapter 5. Our Solution..…………………………………………………………….21
5.1. Idea………………………………………………………………………21
5.2. Modified Drop-from-Tail………………………………………………..22
5.3. Modified RED………………………………………………………...…24
Chapter 6. Simulations….……………………………………………………………25
6.1. Environment……………………………………………………………..25
6.2. Modified Drop-from-Tail with TCP connections……………………..…27
6.3. Modified RED with TCP connections…………………………………...33
6.4. Modified RED with both TCP and UDP connections…………………...38
6.5. Modified RED with TCP, UDP, and HTTP connections………….……..43
Chapter 7. Future Work and Summary……………………………………………….47
References……………………….……………………………….……...…………...49
參考文獻 References
[1] W. Richard Stevens, TCP/IP Illustrated, Volume 1, Reading, MA: Addision-Wesley, Nov. 1994.
[2] W. Stevens, “TCP Slow Start, Congestion Avoidance, Fast Retransmit, and Fast Recovery Algorithms”, RFC2001, Jan. 1997.
[3] Sally Floyd, and Van Jacobson, “Random Early Detection Gateways for Congestion Avoidance”, IEEE/ACM Transaction on Networking, Vol. 1, No. 4, Page(s): 397 ~ 413, Aug. 1993.
[4] B. Davie, S. Deering, D. Estrin, S. Floyd, V. Jacobson, G. Minshall, C. Partridge, L.Peterson, K. Remakrishnan, S. Shenker, J. Wroclawski, L. Zhang, “Recommendations on Queue Management and Congestion Avoidance in the Internet”, RFC 2309, Apr. 1998.
[5] Bernhard Suter, T. V. Lakshman, Dimitrios Stiliadis, and Abhijit K. Choudhury, “Design Considerations for Supporting TCP with Per-flow Queueing”, INFOCOM '98, Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies, Proceedings, IEEE , Vol. 1, Page(s): 299 ~ 306, 1998.
[6] Bernhard Suter, T. V. Lakshman, Dimitrios Stiliadis, and Abhijit K. Choudhury, “Buffer Management Scheme for Supporting TCP in Gigabit Router with Per-Flow Queueing”, IEEE Journal on Selected Areas in Communications, Vol. 17, No. 6, Page(s): 1159 ~ 1169, Jun. 1999.
[7] John Bruno, Banu Özden, Abraham Silberschatz, and Huzur Saran, “Early Fair Drop: A New Buffer Management Policy”, In Proceedings SPIE: Multimedia Computing and Networking 1999, San Jose, California, Page(s): 148 ~ 161, Jan. 1999.
[8] M. Allman, V. Paxson, W. Stevens, “TCP Congestion Control”, RFC 2581, Apr. 1999.
[9] W. Leland, M. Taqqu, W. Willinger, and D. Wilson, “On the Self-Similar Nature of Ethernet Traffic (Extended Version), IEEE/ACM Transactions on Networking, Vol. 2, No. 1, Page(s): 1 ~ 15, Feb. 1994.
[10] E. Hashem. “Analysis of Random Drop for Gateway Congestion Control”, Rep. LCS TR-465, Lab. for Comput. Sci., M.I.T., Page(s): 103, 1989.
[11] L. Zhang, “A New Architecture for Packet Switching Network Protocols”, MIT/LCS/TR-455, Lab. for Comput. Sci., Mass. Inst. Of Techol., Aug. 1989.
[12] S. Shenker, “Comments on the IETF Performance and Congestion Control Working Group Draft on Gateway Congestion Control Policies”.
[13] S. Floyd, T. Henderson, “The NewReno Modification to TCP’s Fast Recovery Algorithm”, RFC 2582, Apr. 1999.
[14] M. Mathis, S. Floyd, A. Romanow, “TCP Selective Acknowledgment Options”, RFC 2018, Oct. 1996.
[15] Lawrence S. Brakmo, Larry L. Peterson, “TCP Vegas: End to End Congestion Avoidance on a Global Internet”, IEEE. Journal on Selected Areas in Communications, Vol. 13, No. 8, Page(s): 1465 ~ 1480, Oct. 1995.
[16] Matthew Mathis, Jamshid Mahdavi, “Forward Acknowledgment: Refining TCP Congestion Control”, Proceedings of SIGCOMM'96, Stanford, CA, Page(s): 281 ~ 191, Aug. 1996.
[17] Rajendra K. Jain, Dah-Ming W. Chiu, William R. Hawe, “A Quantitative Measure of Fairness and Discrimination for Resource Allocation in Shared Computer System”, Sep. 1984.
電子全文 Fulltext
本電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。
論文使用權限 Thesis access permission:校內立即公開,校外一年後公開 off campus withheld
開放時間 Available:
校內 Campus: 已公開 available
校外 Off-campus: 已公開 available


紙本論文 Printed copies
紙本論文的公開資訊在102學年度以後相對較為完整。如果需要查詢101學年度以前的紙本論文公開資訊,請聯繫圖資處紙本論文服務櫃台。如有不便之處敬請見諒。
開放時間 available 已公開 available

QR Code