臺灣博碩士論文加值系統

近年來串流流量在網際網路的世界中快速的成長，由於一些連續性媒體上的考量，這些串流流量大部份比較傾向於採用UDP做為其傳輸層的通訊協定。此外，RTP以及RTCP亦經常被多媒體傳輸的應用程式所採用，用以加強UDP傳送多媒體資料的能力。然而，這些協定並沒有提及任何擁塞控制的機制，因此當TCP及UDP的流量共存時可能會導致擁塞崩潰的現象發生，因而降低網路的品質及使用率。
在本研究中，我們提出一個稱為適應性規劃器的機制，其由rate-smoothing元件及TCP-Friendly擁塞控制元件所組成。此機制可用以調整串流流量的傳送速度以減少對TCP資料流的傷害。首先適應性規劃器會攔截RTP及RTCP的封包並取得所需的流量資訊，當頻寬資源足夠時，rate-smoothing元件利用排隊長度的變化動態的估計串流流量的到達速度並減少傳輸速度的震盪。此外，當網路發生擁塞時，TCP-Friendly擁塞控制元件會迫使串流流量能夠反應擁塞並防止TCP資料流發生飢餓現象。最後，由模擬的結果顯示適應性規劃器使網路的有效性由92.5%提升至99.5%，並且能減少串流資料流對TCP資料流的影響。
關鍵字: 規劃器，TCP友善擁塞控制

In recent years, streaming traffic has been employed in the Internet world with a rapid increase, most of which is preferably carried by the UDP transport protocol because of certain continuous media concerns. In addition, the RTP and RTCP, embedded with appropriate information, are generally employed to enhance original UDP with continuous media applications when multimedia data are transmitted. However, these protocols do not address any mechanism for congestion control and thus under such a non-congestion controlled situation, coexisting TCP and UDP traffic can lead to congestion collapse, which degrades the performance and utilization of the network.
In this work, we propose a mechanism called Adaptive Shaper (AS) inclusive of the rate-smoothing component and the TCP-Friendly congestion control component. It is expected to reduce the harm for TCP flows by gathering the network traffic loading information and adjusting the sending rate of the streaming flow. As the bandwidth resource is sufficient, the rate-smoothing component takes advantage of the variations in queue length to dynamically estimate the arrival rate of the streaming traffic which reduces the fluctuation of the rate effectively. While, as the network is congested, the TCP-Friendly congestion control component forces the streaming flow to respond to the congestion and immediately prevent TCP flows from starvation. Finally, the simulation results present that the adaptive shaper increases the efficiency of the network form 92.5% to 99.5% and reduces the impacts of continuous media on TCP flows.

CHAPTER 1 1
INTRODUCTION 1
CHAPTER 2 4
INTEROPERATION SCENARIOS OF TCP AND UDP 4
2.1. Scenario one — Problems of unfairness and congestion collapse 4
2.2. Scenario two — Problems of the inherent fluctuation of streaming traffic 7
2.3. Scenario three — Different effects on TCP and RTP when congestion occurs 9
CHAPTER 3 12
ADAPTIVE SHAPER (AS) 12
3.1. Feedback Mechanism 12
3.2. The Architecture of the Adaptive Shaper (AS) 14
3.3. Two Components of Adaptive Shaper (AS) 15
3.3.1. Rate-smoothing Component 15
3.3.2. TCP-Friendly Congestion Control Component 19
CHAPTER 4 22
INTEROPERATION SCENARIOS OF TCP AND SHAPED UDP 22
4.1 Evaluation of the Rate-smoothing Component 22
4.2 Elimination of the Congestion Collapse 24
4.3 Fairness of Shaped Flows 26
4.4 Fairness of Shaped Flows and TCP Flows 28
CHAPTER 5 32
CONCLUSION AND FUTURE WORK 32
REFERENCES 33

[1] H. Schulzrinne, S. Casner, R. Frederick, and V. Jacobson, “RTP: A Transport Protocol for Real-Time Applications,” Jan. 1996, RFC 1889
[2] K. Thompson, G.J. Miller, and R. Wilder, “Wide-area internet traffic patterns and characteristics, “ IEEE Network, vol. 11, Issue. 6, Nov. 1997, pp. 10-23
[3] Michanel D. Mayer, Wilhelm A. Mohn, and Christian Zabbal. “PCs vs. TVs,” The Mckinsey Quarterly, http://www.mckinseyquarterly.com, 2001 Number 3
[4] Francois Lainee, Gregory Maged, and Paul J. Roche. “Internet services: Who’s smiling now,” The Mckinsey Quarterly, http://www.mckinseyquarterly.com, 2001 Number 4.
[5] D. Clark, S. Shenker, and L. Zhang, “Integrated Services in the Internet Architecture: an Overview,” Jun. 1994, RFC 1633
[6] D.Black, M. Carlson, and E. Davies, “An Architecture for Differentiated Services,” Dec. 1998, RFC 2475
[7] S. Floyd and K. Fall, “Promoting the use of end-to-end congestion control in the internet, “ IEEE/ACM Transaction on Network, vol. 7, Issue.4, Aug. 1999, pp.458-472
[8] R. Rejaie, M. Handley, and D. Estrin, “Rap: An end-to-end rate-based congestion control mechanism for realtime streams in the internet,” Proc. IEEE Infocom, vol. 3, Mar. 1999, pp. 1337-1345
[9] S. Floyd, M. Handley, J. Padhye, and J. Widmer, “Equation-based congestion control for unicast applications,” Proc. ACM SIGCOMM, Aug. 2000, pp.43-56
[10] D. Sisalem and A. Wolisz, “LDA+ TCP-friendly adaptation: A measurement and comparison study,” Proc. International Workshop on Network and Operating Systems Support for Digital Audio and Video, June 2000
[11] D. Bansal and H. Balakrishnan, “Binomial Congestion Control Algorithms,” Proc. IEEE Infocom, vol.2, Apr. 2001, pp. 631-640
[12] Y. R. Yang and S. S. Lam, “General AIMD Congestion Control,” Technical Report TR-2000-09, University of Texas at Austin, May 2000
[13] J. Widmer, R. Denda, and M. Mauve, “A Survey on TCP-Friendly Congestion Control” IEEE Network, Vol. 15, Issue. 3, May-Jun. 2001, pp 28-37
[14] D. Chiu and R. Jain, “Analysis of the increase and decrease algorithms for congestion avoidance in computer networks,” Computer Networks and ISDN Systems, Vol. 17, No. 1, Jun. 1989, pp. 1-14
[15] J. Padhye, V. Firoiu, D. Towsley, and J. Kurose, “Modeling TCP throughput: A simple model and its empirical validation,” Proc ACM SIGCOMM, Oct 1998, pp:303-314