跳到主要內容

臺灣博碩士論文加值系統

(44.201.99.222) 您好!臺灣時間:2022/12/03 14:22
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

我願授權國圖
: 
twitterline
研究生:吳豐年
研究生(外文):Wu,Feng-Nien
論文名稱:快速啟動機制於網路壅塞控制之研究
論文名稱(外文):Fast Start Mechanism for Congestion Control of Networking
指導教授:唐啟儀唐啟儀引用關係
指導教授(外文):Tang,Chi-Yi
學位類別:碩士
校院名稱:國防大學理工學院
系所名稱:資訊科學碩士班
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2010
畢業學年度:98
語文別:中文
論文頁數:50
中文關鍵詞:快速啟動機制壅塞控制
外文關鍵詞:Fast StartCongestion Control
相關次數:
  • 被引用被引用:1
  • 點閱點閱:263
  • 評分評分:
  • 下載下載:0
  • 收藏至我的研究室書目清單書目收藏:0
隨著網路技術的日益精進,網路頻寬的容量越來越大。但高速網路環境卻因TCP傳輸機制上的限制導致無法有效利用原本該有的頻寬。
現今的TCP壅塞控制機制,大多是採用Reno演算法,此演算法包含了四個部份:慢速啟動、壅塞避免、快速重傳以及快速回復。對於高網路頻寬的環境而言,慢速啟動限制了網路初始傳輸的效率,而壅塞控制演算法的不適當造成了壅塞視窗增減的幅度過大。因此如何能夠在連線初期將頻寬有效率的發揮,並且持續讓傳輸保持在更穩定的狀態中,即是相當重要的議題。這個問題主要
取決於如何根據網路的壅塞狀況去調整壅塞視窗的大小。
本論文針對Reno演算法中,慢速啟動的部份以及封包遺失發生時壅塞視窗變化的方式,提出了快速啟動傳輸協定(FSTP, Fast Start Transmission Protocol)。將原本在慢速啟動階段壅塞視窗成長的速率大幅提升,改善了原本慢速啟動的等待時間以增加網路傳輸的效益。並由網路傳輸時每個週期接收端所回傳的訊息中,計算求得適合目前網路狀況的傳輸速率,藉此調整壅塞視窗的大小,使壅塞視窗在面對封包遺失的情況時,能更有效的調整視窗大小,藉此改善在傳輸的過程中傳輸速率因壅塞視窗的大幅變動而造成傳輸品質下降的情形。
經實驗証明,FSTP除了本身傳輸具有公平性之外,對於Reno也能保持一定的相容性而不致於影響彼此的傳輸。在不穩定的網路環境中FSTP亦有效改善了Reno大幅降低的傳輸效率而提高了傳輸穩定度。對於高頻寬與遠距離的網路環境,FSTP相較於Reno也提高了網路的使用效率,避免不必要的資源浪費。
With the increasingly develepment of network technologies, the capacity of network bandwidth becomes larger and larger, but the high-speed network environment is limited by TCP transmission protocol and can’t effectively take advantage of the bandwidth.
Most of the TCP congestion algorithms are based on the RENO algorithm, which includes four parts: slow-start, congestion avoidance, fast retransmission, and fast recovery. The slow-start part is not very important for the local area network with few users and large bandwidth volumes. It has become a significant issue that how to maximize the usage efficiency of bandwidth during an initial short period for users. In an e-learning network environment, if a user can acquire enough bandwidth once the network links are initially connected, the delay can be effectively reduced. Therefore, for the slow-start part of the Reno algorithm, this paper proposes a fast-start concept to maximize the usage efficiency of bandwidth during an initial short period, so that the original long waiting time in the slow-start part can be improved.
For the slow-start part and variation of congestion window while packet losing, this paper proposed the FSTP(Fast Start Transmission Protocol) to enhance the growth rate original congestion window in the slow-start phase and improve the waiting time to increase the effectiveness of network traffic. The suitable transmission rate by the receiving message of each cycle to adjust the congestion window size
The experiment results showed that FSTP can not only fairly transmite but the traffics maintain a certain compatibility for the Reno algorithm. Additionally, FSTP significantly reduce the transmission efficiency and improved transmission reliability under an unstable network environment. In a large bandwidth and long-distance network environment, FSTP also increased the useage efficiency of network and voided the unnecessary waste of resources.
誌謝 ii
摘要 iii
ABSTRACT iv
目錄 vi
表目錄 ix
圖目錄 x
1. 緒論 1
1.1 研究動機 1
1.2 研究目的 3
1.3 論文架構 4
2. 背景知識及相關文獻探討 5
2.1 傳輸層之通訊協定 5
2.2 TCP壅塞控制機制 9
2.2.1 網路協助的壅塞控制 9
2.2.2 端點到端點的壅塞控制 10
2.2.3 TCP Tahoe演算法 11
2.2.3.1 慢速啟動(Slow Start) 12
2.2.3.2 壅塞避免(Congestion Avoidance) 12
2.2.3.3 快速重傳(Fast Retransmission) 13
2.2.4 TCP Reno演算法 15
2.2.5 TCP NewReno演算法 15
2.2.6 TCP Sack演算法 15
2.2.7 TCP Vegas演算法 16
2.3 TCP效能改進的相關研究 17
3. 研究方法 19
3.1 問題定義 19
3.2 設計構想 20
3.3 FSTP運作流程 22
4. 模擬環境與實驗 26
4.1 實驗概要 26
4.1.1 實驗環境 26
4.2快速啟動與慢速啟動 27
4.2.1 實驗環境 27
4.2.2 慢速啟動階段之比較 27
4.2.3 效能分析 29
4.3 FSTP與Reno效能比較 30
4.3.1 實驗環境 30
4.3.2 實驗結果與分析 31
4.4 FSTP之公平性 32
4.4.1 實驗環境 32
4.4.2 實驗結果與分析 33
4.5 FSTP與Reno之公平性 35
4.5.1 實驗環境 35
4.5.2 實驗結果與分析 36
4.6遺失率之影響 37
4.6.1 實驗環境 37
4.6.2 實驗結果與分析 39
4.7 RTT對傳輸效能的影響 43
4.7.1 實驗環境 43
4.7.2 實驗結果與分析一 44
4.7.3 實驗結果與分析二 44
5. 結論與未來研究工作 47
5.1 結論 47
5.2 未來研究工作 48
參考文獻 49
自傳 51
[1]Postel, J. B., “Transmission control protocol,” RF C-793, September 1981.
[2]Stevens, W. R., “TCP/IP Illustrated,” Vol. 1. Addison-Wesley, 1994.
[3]Ren, Y. M., Tang, H. N., J, Li., Qian, H. L., “Optical network control and management for grid applications,” Journal of Software, 19(6): 1481-1490,
2008.
[4]Chiu, Dah. Ming., and Raj, Jain., “Analysis of the increase and decrease algorithms for congestion avoidance in computer networks,” Computer
Networksand ISDN Systems, June, 1989.
[5]Fall, K., and Floyd, S., “Simulation-based comparisons of Tahoe, Reno, and
Sack, ” TCP.ACM Communications Review, 26(3):5–21, July 1996.
[6]Floyd, S., Henderson, T., “The New-Reno Modification to TCP’s Fast Recovery
Algorithm,” RFC 2582, Apr, 1999.
[7]Mathis, M., Mahdavi, J., Floyd, S., and Romanow, A., “TCP Selective
Acknowledgement Options,” IETF RFC 2018, 1996.
[8]Brakmo, L. S., Malley, S. W., and Larry, L., “TCP Vegas: New
Techniques for Congestion Detection and Avoidance,” Proc. of ACMSIGCOMM, pp.24-35, Aug, 1994.
[9] 柯志亨,程榮祥,謝錫堃,黃文祥,“計算機網路實驗:以NS2模擬工具實作”
,學貫行銷股份有限公司,臺北,第9-3頁,2008。
[10]Floyd, S., “Limited Slow Start for TCP with Large Congestion Window,” RFC
3742, 2004.
[11]Enachescu, M., Ganjali, Y., Goel, A., “Router with Very Small Buffers.”
ACM/SIGCOMM Computer Communication Review, 35(3): 83-90, 2005.
[12]Allman, M., Paxson, V., and Stevens, W., “TCP Congestion Control,” RFC
2581,April 1999.
[13] Hoe, J. C., “Improving the Start-up Behavior of A Congestion ControlSchemefor
TCP,” Proc. ACM SIGCOMM ’96, 1999.
[14]Pau, G., Yamada, K., “TCP Startup Performance in Large Bandwidth Delay
Networks,” Proc. of the IEEE INFOCOM’04. Piscataway, 796-805, 2004.
[15]Allcock, B., Bester, J., Bresnahan, A., Chervenak, L., Foster, I., Kesselman, C., Meder, S., Nefedova, V., Quesnel, D., and Tuecke, S., “Secure, Efficient Data
Transport and Replica Management for High-Performance Data-Intensive
Computing,” in IEEE Mass Storage Conference, 2001.
[16]Cheng, Jin., David, X. Wei., Steven, H. Low., “FAST TCP: Motivation,
Algorithms, Performance, ” Proceedings of IEEE INFOCOM 2004.
[17]Floyd, S., “High Speed TCP for large congestion windows, ” RFC 3649,
December, 2003.
[18]Allcock, B., Bester, J., Bresnahan, A., Chervenak, L., Foster, I., Kesselman, C., Meder, S., Nefedova, V., Quesnel, D., and Tuecke, S., “Secure, Efficient Data
Transport and Replica Management for High-Performance Data-Intensive
Computing,” in IEEE Mass Storage Conference, 2001.
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top