English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 93244/123616 (75%)
Visitors : 27867504      Online Users : 456
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    政大機構典藏 > 理學院 > 資訊科學系 > 學位論文 >  Item 140.119/29702
    Please use this identifier to cite or link to this item: http://nccur.lib.nccu.edu.tw/handle/140.119/29702


    Title: 在無線隨建即連網路中利用路由器輔助的TCP擁塞控制技術
    A New TCP Congestion Control Mechanism over Wireless Ad Hoc Networks by Router-Assisted Approach
    Authors: 蕭和政
    Hsiao, Ho-Cheng
    Contributors: 連耀南
    Lien, Yao-Nan
    蕭和政
    Hsiao, Ho-Cheng
    Keywords: 傳輸協定
    擁塞控制
    路由器
    無線網路
    TCP
    Congestion Control
    Router
    MANET
    Date: 2006
    Issue Date: 2009-09-11 16:05:15 (UTC+8)
    Abstract: 隨著網路訊務流量的快速成長和無線網路技術日漸成熟,如何妥善的運用有限的網路資源是一個成功擁塞控制機制要面對的根本問題。TCP為現行網路上最廣為使用的傳輸層協定,並且有許多的不同版本被提出來改進其效能上的問題,例如TCP NewReno,TCP SACK 及TCP Vegas等。然而由於TCP傳送端並未具有網路內部狀態的資訊,如可用頻寬等,大部份的TCP擁塞控制機制僅能依賴封包遺失做為觸發擁塞控制的指標。許多研究指出在無線的環境下TCP無法有效使用有限的資源並且分辨封包遺失的原因,因而造成整體的效能不佳。本篇研究提出一個藉由路由器輔助的TCP擁塞控制協定-TCP Muzha,仰賴路由器提供調速資訊,以幫助傳送端能不依靠封包遺失進行傳輸速度控制,並可更快速的達到最佳的傳輸速度。本研究同時提出模糊化的多層級速率調整方法,藉由動態所獲得的細膩資訊做擁塞避免及因應無線環境下因路由改變或傳輸介質不穩所產生的不必要傳輸速度減低。最後我們在NS2模擬器上對所提出的協定做效能評估,實驗結果顯示本協定除了能有效的避免擁塞外,並能減少不必要的降速及重傳封包的次數。
    Communication networks have evolved tremendously in the past decades. TCP is the most dominant and deployed end-to-end transport protocol across Internet today and will continue to be in the foresee future. It has numerous enhancing versions for wired network such as TCP Reno, TCP NewReno and TCP Vegas to improve the drawbacks of initial version of TCP. As IEEE 802.11 wireless network technology gains popularity, TCP is very likely to be popular for existing applications so far. However due to unawareness of network conditions, regular TCP is not able to fully control the limited resources and distinguish packet loss from congestion loss and random loss. Based on such implicit assumption, many studies have shown this would results in serious performance degradation in wireless environment. In this paper, we proposed a new TCP congestion control mechanism by router-assisted approach which is inspired by the concept of each wireless node playing the roles of terminal and router simultaneously. Based on the information feedback from routers, sender is able to adjust the sending speed dynamically in order to avoid overshooting problem. We also proposed a multilevel date rate adjustment method to control the date rate more precisely. Finally we evaluate the performance of our approach by NS2 simulator. Our proposed protocol has 5~10% higher throughput than TCP NewReno and much less number of retransmission. The fairness requirement is also achieved while our proposed protocol coexists with other major TCP variants.
    Reference: [1] J. Postel, "Transmission Control Protocol," IETF RFC 793, 1981.
    [2] V. Jacobson, "Congestion Avoidance and Control," Proc. of ACM SIGCOMM, pp. 314-329, Aug. 1988.
    [3] V. Jacobson, "Modified TCP Congestion Avoidance Algorithm," Technical report, Apr. 1990.
    [4] S. Floyd, T. Henderson, and A. Gurtov, “The NewReno Modification to TCP’s Fast Recovery Algorithm,” RFC 3782, April 2004.
    [5] W. Stevens, "TCP Slow Start, Congestion Avoidance, Fast Retransmit, and Fast Recovery Algorithms," IETF RFC 2001, 1997.
    [6] 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, pp. 1-14, 1989.
    [7] M. Mathis, J. Mahdavi, S. Floyd, and A. Romanow, "TCP Selective Acknowledgement Options," IETF RFC 2018, 1996.
    [8] K. Fall and S. Floyd, "Simulation-based Comparisons of Tahoe, Reno, and SACK TCP," ACM Computer Communication Review, vol. 26, no.3, pp. 5-21, 1996.
    [9] Sally Floyd, "TCP and Explicit Congestion Notification," ACM Computer Communication Review, 1994.
    [10] S. Floyd and V. Jacobson, "Random Early Detection Gateways for Congestion Avoidance," IEEE/ACM Transaction on Networking, vol.1, no.4, pp. 397-413, 1993.
    [11] L. S. Brakmo, S. W. O’Malley, and Larry L. Peterson. "TCP Vegas: New Techniques for Congestion Detection and Avoidance, " Proc. Of ACM SIGCOMM, pp. 24-35, Aug. 1994.
    [12] L. S. Brakmo and L. L. Peterson. "TCP Vegas: End to End Congestion Avoidance on a Global Internet," IEEE Journal on Selected Areas in Communication, vol.13, no.8, pp. 1465-1480, Oct. 1995.
    [13] IEEE Std. 802.11, “Wireless LAN Media Access Control (MAC) and Physical Layer (PHY) Specifications,” 1999.
    [14] M. Gerla, K. Tang, and R. Bagrodia, "TCP performance in wireless multi-hop networks," in Proceedings of IEEE WMCSA'99, February 1999.
    [15] C. Barakat, E. Altman, and W. Dabbous, "On TCP Performance in a Heterogeneous Network: A Survey," IEEE Communications Magazine, vol.38, no.1, pp. 44-46, Jan. 2000.
    [16] R. Denda, A. Banchs and W. Effelsberg, "The Fairness Challenge in Computer Networks," Proc. of Quality of future Internet Service, vol. 1922, pp. 208-220, Springer-Verlag Heidelberg, Jun. 2000.
    [17] Yi-Cheng Chan, Chia-Tai Chan, and Yaw-Chung Chen, "RoVegas : A Router-based Congestion Avoidance Mechanism for TCP Vegas," Computer Communications, vol.27, Issue 16, pp. 1624-1636, Oct. 2004.
    [18] Y. Tian, K. Xu, N. Ansari, "TCP in Wireless Environment: Problems and Solution," IEEE Communications, vol 43. no.3, 2005.
    [19] S. Ryu, C. Rump, C. Qiao, "Advances in Internet Congestion Control," IEEE Communications Surveys and Tutorials, vol 5. no.2, 2003.
    [20] A. Hanbali, E. Altman, P. Philippe, "A Survey of TCP over Ad Hoc Networks," IEEE Communications Surveys and Tutorials, vol. 7. no.3, 2005.
    [21] W. Stevens, "TCP/IP Illustrated, Volume 1: The Protocols," Addison-Wesley,
    [22] C.P.Fu, S.C. Liew, "TCP Veno: TCP enhancement for transmission over wireless access networks", IEEE Journal on Selected Areas in Communications, vol. 21, no. 2, Feb 2003
    [23] K. Xu, Y. Tian, N. Ansari, "TCP-Jersey for wireless IP communications", IEEE Journal on Selected Areas in Communications, vol. 22, no. 4, May 2004.
    [24] M. Gerla, M. Y. Sanadidi, R. Wang, A. Zanella, C. Casetti, S. Mascolo, "TCP Westwood: Congestion window control using bandwidth estimation", GLOBECOM 2001 - IEEE Global Telecommunications Conference, no. 1, Nov 2001.
    [25] UCB/LBNL/VINT. The network simulator – ns-2. http://www.isi.edu/nsnam/ns/
    [26] G. Holland and N. Vaidya, "Analysis of TCP performance over mobile ad hoc networks," Proc. ACM Mobicom ‘99, Seattle, WA, 1999.
    [27] X. Yu, “Improving TCP performance over mobile ad hoc networks by exploiting cross-layer information awareness,” in Proc. ACM MobiCom ‘04, Philadelphia, PA, September, 2004.
    [28] J. Liu and S. Singh, “ATCP: TCP for mobile ad hoc networks,” IEEE J-SAC, vol. 19, no. 7, pp. 1300–1315, 2001.
    [29] Z. Fu, P. Zerfos, H. Luo, S. Lu, L. Zhang, and M. Gerla, “The impact of multihop wireless channel on TCP throughput and loss,” in Proc. IEEE INFOCOM, San Francisco, CA, March 2003.
    [30] K. Nahm, A. Helmy, and C.-C J. Kuo, “TCP over Multihop 802.11 Networks: Issues and Performance Enhancement,” in Proc. ACM MobiHoc ’05, Urbana-Champaign, Illinois, USA, May 2005
    [31] S. Xu and T. Saadawi, “Does the IEEE 802.11 MAC protocol work well in multihop wireless ad hoc networks?” IEEE Communications Magazine, pp. 130–137, June 2001.
    [32] K. Chen and K. Nahrstedt, “Limitations of equation-based congestion control in mobile ad hoc networks,” in Proc. IEEE WWAN, Tokyo, Japan, March 2003.
    [33] Z. Fu, X. Meng, and S. Lu, “How bad TCP can perform in mobile ad-hoc networks,” in Proc. IEEE ICNP ’02, Paris, France, 2002.
    [34] K. Chen, Y. Xue, and K. Nahrstedt, “On setting TCP’s congestion window limit in mobile ad hoc networks,” in Proc. IEEE ICC 2003, Anchorage, Alaska, May, 2003.
    [35] K. Sundaresan, V. Anantharaman, H. Hsieh, and R. Sivakumar, “ATP: a reliable transport protocol for ad-hoc networks,” in Proc. ACM MobiHoc ’03, Annapolis, ML, 2003.
    [36] C. Perkins, E. Belding-Royer, and S. Das, “Ad hoc on-demand distance vector (AODV) routing,” IETF Internet Draft, draft-ietf-manet-aodv-13.txt, February 2003.
    [37] J. Monks, P. Sinha, and V. Bharghavan, “Limitations of TCP-ELFN for ad hoc networks,” in Proc. IEEE MOMUC ’00, Tokyo, Japan, 2000.
    [38] R. Jain, D-M. Chiu, W. Hawe, “A Quantitative Measure of Fairness and Discrimination for Resource Allocation in Shared Computer Systems,” Technical Report TR-301, DEC Research Report, Sept. 1984
    [39] F. Wang and Y. Zhang, ”Improving TCP Performance over Mobile Ad-Hoc Networks with Out-of-Order Detection and Response,” Proc. Third ACM Int’l Symp. Mobile Ad Hoc Networking & Computing , 2002
    [40] T. Dyer and R. Boppana, “A comparison of TCP Performance over three routing protocols for mobile ad hoc networks,” in Proc. ACM MobiHoc ’02, Lausanne, Switzerland, June, 2002.
    [41] Z. Fu and B. Greenstein, “Design and Implementation of a TCP-Friendly Transport Protocol Ad Hoc Wireless Networks,” IEEE International Conference on Network Protocols (ICNP’02), Paris, France, November 2002.
    [42] J. Mo, R. J. La, V. Anantharam, and J. Walrand, “Analysis and comparison of TCP Reno and Vegas,” in Proc. IEEE INFOCOM ’99, pp. 1556-1563, March 1999.
    [43] Y. Lai, “Improving the performance of TCP Vegas in heterogeneous environment,” in Proc. Int. Conf. Parallel and Distributed Systems, pp. 581-587, June 2001.
    [44] W. Feng and S. Vanichpun, “Enabling compatibility between TCP Reno and TCP Vegas,” in Proc. IEEE Symposium on Application and the Internet, pp. 301-308, January 2003.
    Description: 碩士
    國立政治大學
    資訊科學學系
    93753008
    95
    Source URI: http://thesis.lib.nccu.edu.tw/record/#G0937530081
    Data Type: thesis
    Appears in Collections:[資訊科學系] 學位論文

    Files in This Item:

    File SizeFormat
    index.html0KbHTML137View/Open


    All items in 政大典藏 are protected by copyright, with all rights reserved.


    社群 sharing

    著作權政策宣告
    1.本網站之數位內容為國立政治大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,惟仍請適度,合理使用本網站之內容,以尊重著作權人之權益。商業上之利用,則請先取得著作權人之授權。
    2.本網站之製作,已盡力防止侵害著作權人之權益,如仍發現本網站之數位內容有侵害著作權人權益情事者,請權利人通知本網站維護人員(nccur@nccu.edu.tw),維護人員將立即採取移除該數位著作等補救措施。
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback