政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/49478
English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  全文筆數/總筆數 : 112704/143671 (78%)
造訪人次 : 49754234      線上人數 : 479
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    政大機構典藏 > 資訊學院 > 資訊科學系 > 學位論文 >  Item 140.119/49478
    請使用永久網址來引用或連結此文件: https://nccur.lib.nccu.edu.tw/handle/140.119/49478


    題名: 利用可變速率方法賦予網路電話壅塞控制能力
    Congestion Control Enabled VoIP by Flexible Bit-rate
    作者: 丁諭祺
    Ting, Yu Chi
    貢獻者: 連耀南
    Lien, Yao Nan
    丁諭祺
    Ting, Yu Chi
    關鍵詞: 壅塞控制
    可變速率
    數據壅塞控制協定
    網路電話
    Congestion Control
    Flexible Bit-rate
    DCCP
    VoIP
    日期: 2010
    上傳時間: 2010-12-08 12:13:00 (UTC+8)
    摘要: 近年來,一個具有壅塞控制機制的傳輸協議DCCP被提出,期能取代UDP成為不可靠傳輸的主流協議。我們以NS-2網路模擬器和實際網路進行實驗,發現DCCP無法與其他傳輸協議公平分享頻寬,因此現行DCCP的設計,尚無法完全取代UDP。此外,目前DCCP以調整封包間隔的方式進行壅塞控制,也不適用於講求時效性的網路服務。
    本研究首先以實驗證明,當網路情況不佳時,DCCP無法與其他傳輸協議公平的分享頻寬;當使用DCCP傳輸越洋長距離網路電話,如遇頻寬不足時,會因頻寬競爭力較弱而無法維持通話品質。本研究提出可變速率方法(Flexible Bit-rate)調整時效性網路服務的封包大小來進行壅塞控制,在維持一定服務品質之前提下,促進網路的和諧。我們在一個實際網路的實驗環境中評估以UDP、DCCP及可變速率三種方式傳輸網路電話封包的效能,結果顯示透過可變速率方法,能有效降低網路電話的封包遺失率,維持通話品質。
    With congestion-control ability, Datagram Congestion Control Protocol (DCCP) is expected to replace UDP as a mainstream unreliable transport protocol. But our study found that DCCP is not able to get a fair share of bandwidth under the competition of others transport protocols no matter in NS-2 simulation or real world networking environments. Furthermore, any congestion control protocol that postpones the transmission of packets may not be adequate to support time-sensitive network services.
    To maintain the quality of time-sensitive network services as well as to be TCP-friendly when facing network bandwidth fluctuation, we propose a Flexible Bit-rate congestion control mechanism for VoIP to adjust their data rate. Our experiments show that Flexible Bit-rate congestion control method could effectively reduce the packet loss rate and to maintain VoIP quality as compared with UDP and DCCP. Furthermore, it can have a much better bandwidth efficiency and adjust better to network fluctuation.
    參考文獻: [1] C. Albuquerque, B.J. Vickers, and T. Suda, "Network border patrol: Preventing congestion collapse and promoting fairness in the Internet," IEEE-ACM Transactions on Networking, vol. 12, no. 4, Dec. 2004, pp. 173-186.
    [2] L. S. Brakmo, S. W. O’Malley, and Larry L. Peterson. "TCP Vegas: New Techniques for Congestion Detection and Avoidance," ACM SIGCOMM, Aug. 1994, pp. 24-35.
    [3] D. Chiu and R. Jain, "Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks," Computer Networks and ISDN Systems, vol.1, 1989, pp. 1-14.
    [4] A. Falk, D. Katabi, Y. Pryadkin," Specification for the Explicit Control Protocol (XCP)," draft-falk-xcp-03.txt (work in progress), July 2007.
    [5] K. Fall and S. Floyd, "Simulation-based Comparisons of Tahoe, Reno, and SACK TCP," ACM Computer Communication Review, vol. 26, no.3, 1996, pp. 5-21.
    [6] S. Floyd and T. Henderson, "The NewReno Modification to TCP`s Fast Recovery Algorithm," IETF RFC 2582, 1999.
    [7] S. Floyd and E. Kohler, "Profile for DCCP Congestion Control ID 2: TCP-like Congestion Control," IETF draft-ietf-dccp-ccid2-08, http://www.ietf.org/internet-drafts/draft-ietfdccp-ccid2-10.txt, Mar. 2005.
    [8] S. Floyd, E. Kohler, and J. Padhye, "Profile for DCCP Congestion Control ID 3: TFRC Congestion Control," IETF draft-ietf-dccp-ccid3-11, http://www.ietf.org/internetdrafts/draft-ietf-dccp-ccid3-11.txt, Mar. 2005.
    [9] Z. Fu, P. Zerfos, H. Luo, S. Lu, L. Zhang, and M. Gerla, "The impact of multihop wireless channel on TCP throughput and loss," IEEE INFOCOM, San Francisco, CA, March 2003.
    [10] Eddie Kohler, Mark Handley, and Sally Floyd, "Designing DCCP: Congestion Control Without Reliability," SIGCOMM 06, Sep. 2006, Pisa, Italy, pp. 27-38.
    [11] V. Jacobson, "Congestion Avoidance and Control," ACM SIGCOMM, Aug. 1988, pp. 314-329.
    [12] N. E. Mattsson, "A DCCP module for ns-2," http://epubl.luth.se/1402-1617/2004/175/LTU-EX-04175-SE.pdf, Sep. 2004.
    [13] J.Nagle, "Congestion Control in TCP/IP," RFC896, Jan 1984.
    [14] K. Nahm, A. Helmy, and C.-C J. Kuo, "TCP over Multihop 802.11 Networks: Issues and Performance Enhancement," ACM MobiHoc 05, Urbana-Champaign, Illinois, USA, May 2005.
    [15] F. Sabrina and J.-M. Valin,"Adaptive Rate Control for Aggregated VoIP Traffic," GLOBECOM 2008, pp. 1405-1410.
    [16] W. Stevens, "TCP Slow Start, Congestion Avoidance, Fast Retransmit, and Fast Recovery Algorithms," IETF RFC 2001, 1997.
    [17] The E-Model, http://www.itu.int/rec/T-REC-G.107.
    [18] "The Network Simulator - ns-2", http://www.isi.edu/nsnam/ns/.
    [19] G.723, http://www.itu.int/rec/T-REC-G.723/e.
    [20] G.729, http://www.itu.int/rec/T-REC-G.729/e.
    [21] iLBC, http://www.ietf.org/rfc/rfc3951.txt.
    [22] Mean Opinion Score, http://en.wikipedia.org/wiki/Mean_opinion_score.
    [23] SpeeX, http://www.speex.org/.
    描述: 碩士
    國立政治大學
    資訊科學學系
    97753014
    99
    資料來源: http://thesis.lib.nccu.edu.tw/record/#G0977530141
    資料類型: thesis
    顯示於類別:[資訊科學系] 學位論文

    文件中的檔案:

    檔案 大小格式瀏覽次數
    014101.pdf1651KbAdobe PDF2621檢視/開啟


    在政大典藏中所有的資料項目都受到原著作權保護.


    社群 sharing

    著作權政策宣告 Copyright Announcement
    1.本網站之數位內容為國立政治大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,惟仍請適度,合理使用本網站之內容,以尊重著作權人之權益。商業上之利用,則請先取得著作權人之授權。
    The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

    2.本網站之製作,已盡力防止侵害著作權人之權益,如仍發現本網站之數位內容有侵害著作權人權益情事者,請權利人通知本網站維護人員(nccur@nccu.edu.tw),維護人員將立即採取移除該數位著作等補救措施。
    NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回饋