Please use this identifier to cite or link to this item: http://hdl.handle.net/11455/7713
標題: 擁塞控制使用SCTP及TCP之效能評估
Performance Evaluation of Congestion Control on SCTP and TCP Variants
作者: 徐光儀
Hsu, Kuang-Yi
關鍵字: TCP Tahoe;TCP NewReno;TCP SACK;SCTP;SCTP NewReno
出版社: 電機工程學系所
引用: [1] J. Postel, “Transmission Control Protocol,” IETF RFC 793,Sept. 1981; available at http://ietf.org/rfc/rfc793.txt. [2] R. Stewart, Q. Xie, K. Morneault, and C. Sharp et. Al.,“Stream Control Transmission Protocol”IETF RFC 2960, Oct 2000. [3] J. Postel, “User Datagram Protocol,” IETF RFC 768,August. 1980. [4] Fu,S. and Atiquzzaman,M., “SCTP:State of the Art in Research,Products, and Technical Challenges”, IEEE Communication Magazine,Vol.42, No.4, pp.64- 76,April 2004 [5] R. Stewart and C. Metz, “SCTP : New Transport Protocol for TCP/IP”,IEEE Journal of Internet Computing Volume: 5, Issue: 6, pp. 64-69,Nov.-Dec. 2001. [6] A. L. Caro et al., “SCTP: A Proposed Standard for Robust Internet Data Transport,” IEEE Comp., vol. 36,no. 11, Nov. 2003, pp. 56–63. [7] SCTP multi-homing at www.cs.unt.edu/~rdantu/FALL_2005_ ADVANCED_COMPUTER_NETWORKS/NEXT_ GENERATION_ PROTOCOLS/sctp.02f%5B1%5D.ppt [8] Stevens, W., "TCP Slow Start, Congestion Avoidance, Fast Retransmit,and Fast Recovery Algorithms", RFC 2001, Jan 1997 [9] M. Allman, V. Paxson, and W. Stevens, “TCP Congestion Control,"IETF RFC 2581, Apr. 1999; http://ietf.org/rfc/rfc2581.txt. [10] M. Mathis et al., “TCP Selective Acknowledgment Options,” IETF RFC 2018, Oct. 1996; http://ietf.org/rfc/rfc2018.txt. [11] Stewart,R and Amer,P.D., “Why is SCTP needed given TCP and UDP are widely available?”, Internet Society, June, 2004. [12] 柯志亨等著,計算機網路實驗—以NS2 模擬工具實作,學貫 行銷,台北,民國94 年。 [13] The Network Simulator ns-2 at http://www.isi.edu/nsnam/ns/ [14] SCTP Module for ns-2 available at http://pel.cis.udel.edu/ [15] The cygwin at http://linux.tnc.edu.tw/techdoc/shell/x52.html [16] SCTP multi-homing model for ns-2 at http://www.armandocaro.net/software/ns2sctp/ [17] Kevin Fall and Sally Floyd. Simulation-based Comparisons of Tahoe,Reno, and SACK TCP. In Computer Communication Review, V. 26 N.3, pp. 5-21. July 1996.
摘要: 
SCTP(Stream Control Transmission Protocol)是新一代的第四層網路傳輸協定,2000年由網路工程組織IETF(Internet Engineering Task Force)的信號傳輸工程組(SIGTRAN Working Group)所提出。提供連結導向(connection-oriented)及可靠性傳輸(reliable transport)的服務,新增multi-homing與multi-streaming的機制,改善傳統TCP在傳輸效率與安全性的缺陷,有效提升網路傳送的效能。
本論文將針對TCP(Transmission Control Protocol)的三種版本(Tahoe、NewReno、SACK)與SCTP(SCTP、NewReno),在擁塞控制方面作傳送效能比較。使用網路模擬軟體NS-2(Network Simulator-Version 2),分別模擬多種封包遺失時的封包接收數量與擁塞視窗(congestion window size)的變化情形,以及同時存在二種第四層傳輸協定時的封包接收數量、吞吐量(throughput)與遺失封包的分布情形。結果證實,SCTP在擁塞控制方面的設計確實優於TCP,尤其是面對多重封包遺失的情形,不但能有效降低封包遺失的機率,傳送效能也比TCP提升許多。

SCTP(Stream Control Transmission Protocol), a new fourth layer transport protocol, was proposed by the SIGTRAN Working Group of the IETF(Internet Engineering Task
Force). The protocol is a connection-oriented and reliable transport service. It also supports multi-homing and multi-streaming mechanisms and can improve the transmission efficiency and enhance the security of traditional TCP.
In this thesis we will focus on the congestion control for TCP (Transmission Control Protocol) (Tahoe, NewReno, SACK) and SCTP(SCTP, NewReno) and will compare the performance issue on delivery. We use the NS-2(Network Simulator-Version 2), a network simulation software, to simulate several scenarios of packet loss and congestion window size. The number of packets received, throughput and distribution of packet loss was simulated under two fourth layer transport protocol existing at the same time. The simulation results shows that the design of congestion control of SCTP is better than using TCP. The SCTP can not only reduce the probability of packet loss, but also improve the performance of delivery than TCP while face the suffering of multiple packet loss.
URI: http://hdl.handle.net/11455/7713
其他識別: U0005-2507200718330700
Appears in Collections:電機工程學系所

Show full item record
 
TAIR Related Article

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.