<link rel="stylesheet" href="styles.cf390c6bfbe7555f.css">

學術出版;;Publications

Permanent URI for this communityhdl:11536/1

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

Browse

Filters

1999 - 20003

Settings

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

Author: search.filters.author.Chen, JRSubject: search.filters.subject.fairness

Search Results

Now showing 1 - 3 of 3
  • Thumbnail Image
    Item type:Item,
    Pseudo-rate TCP: a congestion avoidance scheme with nearly optimized fairness and throughput
    (1999-09-25)
    Chen, JR
    ;
    Chen, YC
    ;
    資訊工程學系
    ;
    Department of Computer Science
    As the bandwidth requirement on the Internet grows, the efficiency of networking protocol becomes an important concern. This paper proposes a so-called pseudo-rate TCP, which features both better fairness and higher throughput than TCP Vegas by exponentially increasing the window size to a derived bound. The pseudo-rate TCP avoids the typical problem that sources with shorter round-trip times always get better chance in allocating the bandwidth. We discuss two key mechanisms designed for pseudo-rate TCP, and compare its performance with TCP Vegas through system simulation. (C) 1999 Elsevier Science B.V. All rights reserved.
  • Thumbnail Image
    Item type:Item,
    Vegas plus: Improving the service fairness
    (2000-05-01)
    Chen, JR
    ;
    Chen, YC
    ;
    資訊工程學系
    ;
    Department of Computer Science
    TCP Vegas is a congestion avoidance scheme designed to prevent the periodic packet loss which occurs in traditional schemes. Since Vegas successfully avoids such packet loss, it achieves much higher throughput than TCP Reno. However, it does not concern the fairness among source-destination pairs with different round-trip times (RTT's). In this letter, we propose a different mechanism to adjust the window size, this allows TCP to provide much better fairness regardless the large variation of RTT's.
  • Thumbnail Image
    Item type:Item,
    An end-to-end flow control approach based on round trip time
    (2000-09-30)
    Chen, JR
    ;
    Chen, YC
    ;
    Lee, CL
    ;
    資訊工程學系
    ;
    Department of Computer Science
    Traditional TCP Row control schemes, such as Tahoe and Reno, continuously increase the window size until possible packet loss is detected. These schemes generate congestion unnecessarily by themselves and utilize the buffer space inefficiently. Therefore, Vegas was proposed to accommodate the drawbacks. It uses the measured round-trip time (RTT) to obtain the information required for the flow control. in this work, we propose a Row control scheme, RTT-based TCP, which uses the RTT directly to control the window size adjustment. RTT-based TCP comprises four mechanisms: the modified exponential window increment, the RTT measurement, the queue occupancy estimation, and the quick queue-occupancy reduction. Simulation results show that RTT-based TCP outperforms Vegas in the aspects of throughput, fairness and efficiency of buffer usage. (C) 2000 Elsevier Science B.V. All rights reserved.