<link rel="stylesheet" href="styles.cf390c6bfbe7555f.css"> Skip to main content

學術出版;;Publications

Permanent URI for this communityhdl:11536/1

收集所有交通大學研究人員與學生個人或團體所發表之各項學術著作,涵蓋期刊論文、教師專書、學位論文等項。;;Collections of Publications of NCTU Researchers and Students Like Journal Papers and Thesis.

Browse

🏛️國立陽明交通大學機構典藏

Search Results

Now showing 1 - 4 of 4
  • Item type:Item,
    An enhanced congestion avoidance mechanism for TCP vegas
    (2003-07-01)
    Chan, YC
    ;
    Chan, CT
    ;
    Chen, YC
    ;
    資訊工程學系
    ;
    Department of Computer Science
    TCP Vegas detects network congestion in the early stage and successfully prevents periodic packet loss that usually occurs in traditional schemes. It has been demonstrated that TCP Vegas achieves much higher throughput than TCP Reno. However, TCP Vegas cannot prevent unnecessary throughput degradation when congestion occurs in the backward path. In this letter, we propose an enhanced congestion avoidance mechanism for TCP Vegas. By distinguishing whether congestion occurs in the forward path or not, it significantly improves the connection throughput when the backward path is congested.
  • Item type:Item,
    RoVegas: a router-based congestion avoidance mechanism for TCP Vegas
    (2004-10-15)
    Chan, YC
    ;
    Chan, CT
    ;
    Chen, YC
    ;
    資訊工程學系
    ;
    Department of Computer Science
    Transmission control protocol (TCP) Vegas detects network congestion in the early stage and successfully prevents periodic packet loss that usually occurs in TCP Reno. It has been demonstrated that TCP Vegas outperforms TCP Reno in many aspects. However, TCP Vegas suffers several problems that inhere in its congestion avoidance mechanism, these include issues of rerouting, persistent congestion, fairness, and network asymmetry. In this paper, we propose a router-based congestion avoidance mechanism (RoVegas) for TCP Vegas. By performing the proposed scheme in routers along the round-trip path, RoVegas can solve the problems of rerouting and persistent congestion, enhance the fairness among the competitive connections, and improve the throughput when congestion occurs on the backward path. Through the results of both analysis and simulation, we demonstrate the elfectiveness of RoVegas. (C) 2004 Elsevier B.V. All rights reserved.
  • Item type:Item,
    Improving performance of delay-based TCPs with rerouting
    (2007-01-01)
    Ho, Cheng-Yuan
    ;
    Chen, Yaw-Chung
    ;
    Ho, Cheng-Yun
    ;
    資訊工程學系
    ;
    Department of Computer Science
    Delay-based TCPs detect network congestion in the early stage and successfully prevent periodic packet loss that usually occurs in loss-based mechanisms. It has been demonstrated that delay-based algorithms outperform loss-based schemes in many aspects. However, a delay-based TCP may not prevent unnecessary throughput degradation when rerouting occurs and in mobile IP networks and mobile ad hoe networks because it could not differentiate whether the increased RTT is due to route change or network congestion. This work investigates how to improve the performance of delay-based TCPs with rerouting and proposes a mechanism for delay-based TCPs. The proposed mechanism is able to re-measure the BaseRTT if necessary by detecting the change of TTL value of two end-hosts. Based on the simulation results, we demonstrate the effectiveness and utilities.
  • Item type:Item,
    Quick Vegas: Improving performance of TCP Vegas for high bandwidth-delay product networks
    (2008-04-01)
    Chan, Yi-Cheng
    ;
    Lin, Chia-Liang
    ;
    Ho, Cheng-Yuan
    ;
    資訊工程學系
    ;
    Department of Computer Science
    An important issue in designing a TCP congestion control algorithm is that it should allow the protocol to quickly adjust the end-to-end communication rate to the bandwidth on the bottleneck link. However, the TCP congestion control may function poorly in high bandwidth-delay product networks because of its slow response with large congestion windows. In this paper, we propose an enhanced version of TCP Vegas called Quick Vegas, in which we present an efficient congestion window control algorithm for a TCP source. Our algorithm improves the slow-start and congestion avoidance techniques of original Vegas. Simulation results show that Quick Vegas significantly improves the performance of connections as well as remaining fair when the bandwidth-delay product increases.