傳輸控制協(xié)議中擁塞控制算法的改進
發(fā)布時間：2018-10-22 07:38
【摘要】：目前，計算機網(wǎng)絡技術得到了飛躍發(fā)展，網(wǎng)絡在日常生活中扮演的角色越來越重要。隨之而來的是網(wǎng)民數(shù)量飛速增加和網(wǎng)絡流量急劇增長。網(wǎng)絡一旦出現(xiàn)擁塞情況，網(wǎng)絡會出現(xiàn)大量丟包現(xiàn)象，吞吐量也會受到影響，甚至嚴重時會導致網(wǎng)絡崩潰；因此如何對網(wǎng)絡進行擁塞控制對網(wǎng)絡繼續(xù)發(fā)展具有重要意義。 本文主要是對TCP/IP中的TCP擁塞控制協(xié)議進行分析，并提出了Reno-J算法，避免了Reno算法在慢啟動后期出現(xiàn)大量突發(fā)數(shù)據(jù)量的不足： 對TCP協(xié)議進行了詳細分析，主要介紹了TCP報文段的首部格式，并且通過詳細分析三步握手機制和滑動窗口機制說明TCP是如何實現(xiàn)可靠傳輸?shù)模謩e解釋了擁塞產生的原因和擁塞控制的概念，詳細分析了慢啟動、擁塞避免、快速重傳/快速恢復、超時重傳四個階段的工作原理，，簡要闡述了擁塞控制協(xié)議經歷的版本演進。 根據(jù)現(xiàn)在的擁塞控制算法中閾值設置恒定帶來的問題，重點分析比較了Westwood算法及升級版本的優(yōu)缺點并對帶寬估計算法做出改進，分別通過對確認的包長度和確認到達時間進行采樣求得它們各自的平均值，然后兩者相除得到帶寬估計值，改進的可用帶寬估計算法能更加準確的對網(wǎng)絡帶寬的使用情況進行估計； 在慢啟動階段，TCP Reno以指數(shù)方式增加其擁塞窗口，這會導致慢啟動后期出現(xiàn)大量突發(fā)數(shù)據(jù)，正因如此，通過數(shù)學分析提出一種關于中點對稱的分段數(shù)學函數(shù)模型，使得在慢啟動前期，擁塞窗口增長速率加快，而到了后期，擁塞窗口增長速率減慢，從而平滑過渡到擁塞避免階段；最后通過NS2仿真對其擁塞窗口、吞吐量、丟包率、友好性進行評估驗證；實驗結果顯示，新算法能夠有效的降低網(wǎng)絡傳輸分組丟棄，提高網(wǎng)絡吞吐量，減少網(wǎng)絡的抖動的次數(shù)，維持網(wǎng)絡穩(wěn)定；除此之外，新算法與Reno算法一同應用時，體現(xiàn)了友好性。
[Abstract]:At present, with the rapid development of computer network technology, network plays a more and more important role in daily life. What follows is the netizen quantity to increase rapidly and the network traffic to grow sharply. Once the network congestion occurs, the network will have a large number of packet loss phenomenon, throughput will also be affected, and even serious will lead to network collapse, so how to control the network congestion is of great significance for the continued development of the network. This paper mainly analyzes the TCP congestion control protocol in TCP/IP, and puts forward the Reno-J algorithm, which avoids the shortage of a large amount of burst data in the Reno algorithm in the later stage of slow start. The TCP protocol is analyzed in detail. This paper mainly introduces the first format of TCP message segment, and explains how TCP realizes reliable transmission by analyzing the three-step handshake mechanism and sliding window mechanism in detail, and explains the causes of congestion and the concept of congestion control, respectively. The principles of slow start, congestion avoidance, fast retransmission / fast recovery and timeout retransmission are analyzed in detail, and the evolution of congestion control protocol is briefly described. According to the problem of constant threshold setting in the current congestion control algorithm, the advantages and disadvantages of the Westwood algorithm and the upgraded version are analyzed and compared, and the bandwidth estimation algorithm is improved. Their average values are obtained by sampling the confirmed packet length and the confirmed time of arrival, and then dividing the two to obtain the bandwidth estimate. The improved available bandwidth estimation algorithm can estimate the bandwidth of the network more accurately. In the slow start phase, TCP Reno increases its congestion window exponentially, which leads to the emergence of a large number of burst data in the late stage of slow start. For this reason, a piecewise mathematical function model of midpoint symmetry is proposed through mathematical analysis, which makes the growth rate of congestion window increase faster in the early stage of slow start, but slow down in later stage. Finally, the congestion window, throughput, packet loss rate and friendliness are evaluated and verified by NS2 simulation. The experimental results show that the new algorithm can effectively reduce packet dropping in network transmission. In addition, the new algorithm and Reno algorithm show friendliness when it is used together with the Reno algorithm to improve the network throughput, reduce the number of times of network jitter, and maintain the stability of the network.
【學位授予單位】：沈陽理工大學
【學位級別】：碩士
【學位授予年份】：2014
【分類號】：TP393.04
本文編號：2286526
[Abstract]:At present, with the rapid development of computer network technology, network plays a more and more important role in daily life. What follows is the netizen quantity to increase rapidly and the network traffic to grow sharply. Once the network congestion occurs, the network will have a large number of packet loss phenomenon, throughput will also be affected, and even serious will lead to network collapse, so how to control the network congestion is of great significance for the continued development of the network. This paper mainly analyzes the TCP congestion control protocol in TCP/IP, and puts forward the Reno-J algorithm, which avoids the shortage of a large amount of burst data in the Reno algorithm in the later stage of slow start. The TCP protocol is analyzed in detail. This paper mainly introduces the first format of TCP message segment, and explains how TCP realizes reliable transmission by analyzing the three-step handshake mechanism and sliding window mechanism in detail, and explains the causes of congestion and the concept of congestion control, respectively. The principles of slow start, congestion avoidance, fast retransmission / fast recovery and timeout retransmission are analyzed in detail, and the evolution of congestion control protocol is briefly described. According to the problem of constant threshold setting in the current congestion control algorithm, the advantages and disadvantages of the Westwood algorithm and the upgraded version are analyzed and compared, and the bandwidth estimation algorithm is improved. Their average values are obtained by sampling the confirmed packet length and the confirmed time of arrival, and then dividing the two to obtain the bandwidth estimate. The improved available bandwidth estimation algorithm can estimate the bandwidth of the network more accurately. In the slow start phase, TCP Reno increases its congestion window exponentially, which leads to the emergence of a large number of burst data in the late stage of slow start. For this reason, a piecewise mathematical function model of midpoint symmetry is proposed through mathematical analysis, which makes the growth rate of congestion window increase faster in the early stage of slow start, but slow down in later stage. Finally, the congestion window, throughput, packet loss rate and friendliness are evaluated and verified by NS2 simulation. The experimental results show that the new algorithm can effectively reduce packet dropping in network transmission. In addition, the new algorithm and Reno algorithm show friendliness when it is used together with the Reno algorithm to improve the network throughput, reduce the number of times of network jitter, and maintain the stability of the network.
【學位授予單位】：沈陽理工大學
【學位級別】：碩士
【學位授予年份】：2014
【分類號】：TP393.04
【參考文獻】
相關期刊論文 前6條
1 陳琳;雙雪芹;;TCP網(wǎng)絡擁塞控制算法比較研究[J];長江大學學報(自然科學版)理工卷;2010年01期
2 何建新;王建新;;有線無線網(wǎng)絡擁塞控制技術最新研究進展[J];電腦與信息技術;2008年02期
3 汪紀鋒;胡晗;王春輝;;TCP帶寬估計算法[J];重慶大學學報(自然科學版);2006年11期
4 朱麗,溫曉暉,李偉;Internet的TCP擁塞控制機制改進[J];廣州航海高等�？茖W校學報;2003年02期
5 王德鎖,舒勤;TCP擁塞控制機制在高速網(wǎng)絡中的局限性[J];中國測試技術;2004年02期
6 馬俊文,劉繼君;網(wǎng)絡擁塞的原因分析及當前的預防措施[J];網(wǎng)絡安全技術與應用;2005年10期
本文編號：2286526
本文鏈接：http://www.sikaile.net/guanlilunwen/ydhl/2286526.html
最近更新
教材專著
