簡易檢索 / 詳目顯示

回結果列表
研究生： 劉碧娟
Pi-Chuan Liu
論文名稱： 具備快速復原達成TCP公平性之DCCP擁塞控制
DCCP Congestion Control with Fast Recovery to Achieve TCP-Fairness
指導教授： 賴源正
Yuan-Cheng Lai
口試委員: 林盈達
Ying-Dar Lin
馮輝文
Huei-Wen Ferng
學位類別： 碩士
Master
系所名稱： 管理學院 - 資訊管理系
Department of Information Management
論文出版年： 2006
畢業學年度： 94
語文別： 英文
論文頁數： 24
中文關鍵詞： 擁塞視窗 、TCP公平性 、擁塞控制 、封包擁塞控制協定(DCCP) 、快速復原
外文關鍵詞： Fast Recovery, congestion window, TCP-fairness, Datagram Congestion Control Protocol (DCCP), congestion control
相關次數： 點閱：149  下載：1 
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報
  •  上一筆

    • 封包擁塞控制協定(Datagram Congestion Control Protocol, DCCP)最近已由IETF制定為不可靠的傳輸層協定標準，DCCP適合即時性的串流媒體應用並具備擁塞控制機制，其發展目的在於結合不可靠的資料流傳輸與擁塞控制，以達到傳輸時效性，以及與TCP共享網路頻寬。然而DCCP與TCP之間存在頻寬分配不公平的現象，此不公平現象是因為DCCP與TCP的快速復原機制不相容的緣故。故本篇論文提出一個具備快速復原機制的DCCP方法，以改善DCCP與TCP之間的頻寬分配不公平，簡稱FR_DCCP。除此之外，我們還考量DCCP在擁塞避免階段時針對其擁塞視窗的擴展作修改，使DCCP的擁塞視窗變化與TCP更相似，簡稱為CA_DCCP。最後，模擬結果說明我們所提之方法FR_DCCP與CA_DCCP均能提供較好的TCP公平性。

    Recently, Datagram Congestion Control Protocol (DCCP) has been standardized by the IETF as an unreliable transport protocol for real-time streaming applications. DCCP is intended for the combination of unreliable data delivery and congestion control mechanism to achieve timely transmission and the fair sharing of network bandwidth with TCP. However, an unfair bandwidth sharing between DCCP and TCP has come into existence because DCCP does not have Fast Recovery. The present thesis proposes the application of DCCP with Fast Recovery, called FR_DCCP, to improve its fair bandwidth share with TCP. Furthermore, for fairness, we also modify DCCP congestion window (cwnd) expansion, called CA_DCCP, during Congestion Avoidance. Simulation results demonstrate that the approaches of FR_DCCP and CA_DCCP presented herein can provide more equitable TCP-fairness.

    摘要 I Abstract II 誌謝 III Table of Contents IV List of Figures V List of Tables VI 1. Introduction 1 2. Background 4 2.1. TCP Congestion Control 4 2.2. DCCP Congestion Control－CCID2 7 3. DCCP Modification 10 3.1. DCCP with Fast Recovery 10 3.2. DCCP with Modified Congestion Avoidance 13 4. Simulation and Evaluation 15 4.1. Simulation Tool and Environment 15 4.2. The Unfairness Problem between DCCP and TCP 16 4.3. Fairness between Modified DCCP and TCP 17 4.4. Effect of the Number of DCCP Flows 20 4.5. Effect of the Buffer Size on Bottlenecked Router 22 5. Conclusion and Future Works 23 References 24

    [1] E. Kohler, M. Handley, S. Floyd, and J. Padhye, “Datagram Congestion Control Protocol (DCCP),” IETF RFC 4340, March 2006.
    [2] S. Takeuchi, H. Koga, K. Iida, Y. Kadobayashi, and S. Yamaguchi, “Performance Evaluations of DCCP for Bursty Traffic in Real-time Application,” Proc. IEEE Applications and the Internet, 2005.
    [3] W. Stevens, “TCP Slow Start, Congestion Avoidance, Fast Retransmit, and Fast Recovery Algorithms,” IETF RFC 2001, January 1997.
    [4] E. Blanton, M. Allman, K. Fall, and L. Wang, “A Conservative Selective Acknowledgment (SACK)-based Loss Recovery Algorithm for TCP,” IETF RFC 3517, April 2003.
    [5] M. Mathis, J. Mahdavi, S. Floyd, and A. Romanow, “TCP Selective Acknowledgment Options,” IETF RFC 2018, October 1996.
    [6] S. Floyd and E. Kohler, “Profile for Datagram Congestion Control Protocol (DCCP) Congestion Control ID 2: TCP-like Congestion Control,” IETF RFC 4341, March 2006.
    [7] S. Floyd, E. Kohler, and J. Padhye, “Profile for Datagram Congestion Control Protocol (DCCP) Congestion Control ID 3: TCP-Friendly Rate Control (TFRC),” IETF RFC 4342, March 2006.
    [8] The Network Simulator - ns-2. http://www.isi.edu/nsnam/ns
    [9] N.-E. Mattsson. A DCCP module for ns-2. Master’s thesis, Lule°a University of Technology, Sweden, May 2004. Available at http://lifc.univ-fcomte.fr/~dedu/.

    QR CODE