<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

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

Author: search.filters.author.Chen, JR

Search Results

Now showing 1 - 10 of 19
  • Thumbnail Image
    Item type:Item,
    Performance evaluation of an end-to-end rate control approach for ABR services
    (1998-12-01)
    Chen, JR
    ;
    Chen, YC
    ;
    Chan, CT
    ;
    資訊工程學系
    ;
    Department of Computer Science
    In this work, we propose an End-to-End Rate Control Approach (EERCA) for congestion avoidance in Available Bit Rate (ABR) service on Asynchronous Transmit Mode (ATM) networks. In our approach: the network estimates the number of cells stored in the switch for each VC. The source generates a specific traffic pattern, then a proper explicit rate can be derived based on the received traffic pattern at the destination. This approach is designed to reduce the rate calculation effort in the switch as well as to avoid the complexity in setting the monitoring-interval. EERCA features higher efficiency, higher utilization, more stable queue occupancy shorter transient response time, and better fairness compared with existed schemes.
  • Thumbnail Image
    Item type:Item,
    Performance evaluation of an end-to-end rate control approach for ABR services
    (1998-12-01)
    Chen, JR
    ;
    Chen, YC
    ;
    Chan, CT
    ;
    資訊工程學系
    ;
    Department of Computer Science
    In this work, we propose an End-to-End Rate Control Approach (EERCA) for congestion avoidance in Available Bit Rate (ABR) service on Asynchronous Transmit Mode (ATM) networks. In our approach: the network estimates the number of cells stored in the switch for each VC. The source generates a specific traffic pattern, then a proper explicit rate can be derived based on the received traffic pattern at the destination. This approach is designed to reduce the rate calculation effort in the switch as well as to avoid the complexity in setting the monitoring-interval. EERCA features higher efficiency, higher utilization, more stable queue occupancy shorter transient response time, and better fairness compared with existed schemes.
  • 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,
    Design and analysis of queuing delay control for end-to-end rate control algorithm
    (1999-10-01)
    Chen, JR
    ;
    Chen, YC
    ;
    資訊工程學系
    ;
    Department of Computer Science
    distributed congestion avoidance scheme, the End-to-End Rate Control Algorithm (EERCA), has been proposed [5] for Available Bit Rate (ABR) service. In this work, we enhance EERCA by replacing the Queue Occupancy Reduction with the queuing delay control (QDC), which manipulates the queue occupancy more efficiently with less functional complexity. Furthermore, it alleviates per-VC accounting requirement and thus reduces the complexity of a switch. From both the analysis and the simulation, it shows that the proposed virtual queue occupancy precisely reflects the variation of the actual queue occupancy. This enhanced EERCA features higher efficiency and more stable queue occupancy than the original algorithm.
  • Thumbnail Image
    Item type:Item,
    Improving data transport performance through SSCOP with rate-based flow control
    (1999-12-01)
    Chen, JR
    ;
    Chen, YC
    ;
    資訊工程學系
    ;
    Department of Computer Science
    This work tries to improve the effective throughput as well as to achieve better fairness of the transport protocol with efficient selective retransmission scheme. The commonly used transport layer protocol, transmission control protocol (TCP), has been developed for more than two decades, but its retransmission scheme is hard to be satisfactory. However, service specific connection oriented protocol (SSCOP) provides an excellent retransmission mechanism with poor flow control function. When the lower layer protocol is Asynchronous Transfer Mode, using SSCOP instead of TCP/IP over AA5 to provide transport layer service can specifically reduce the protocol overhead. We propose a scheme for SSCOP to enhance its flow control performance. This scheme combines the rate-based flow control with the queuing delay control. The simulation result shows that our enhanced SSCOP achieves both higher throughput and better fairness. It demonstrates that a proper flow control scheme with efficient selective retransmission is crucial for optimizing the performance of a transport protocol. (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.
  • Thumbnail Image
    Item type:Item,
    Providing service differentiation in wireless networks
    (2001-04-01)
    Lee, CL
    ;
    Chen, YC
    ;
    Chen, JR
    ;
    資訊工程學系
    ;
    Department of Computer Science
    Differentiated services: (Diffserv) model is one of the possible solutions for providing quality of service (QoS) on the Internet. Most existing approaches assume that the packet loss is an indication of network congestion and thus reduce the sending rates: of sources. For wireless networks, the assumption is not proper since packet losses may he caused by other reasons, such as fading and interference of the signal. Therefore, these approaches do not work well in wireless networks. In this paper, we propose an approach which is able to provide service differentiation in wireless environments. In our approach, the rate share of a connection is determined by the associated weight. By keeping a proper amount of extra data in the network, the proposed approach can achieve weighted proportional fairness, which can provide selective QoS without any particular support, from the network. We use the ns simulator to evaluate our approach. Simulation results show the validity of the proposed approach.
  • Thumbnail Image
    Item type:Item,
    A simplified approach based on source control for ATM ABR service
    (2001-08-15)
    Lee, CL
    ;
    Chen, YC
    ;
    Chen, JR
    ;
    資訊工程學系
    ;
    Department of Computer Science
    The available bit rate (ABR) service is designed to provide efficient support of data traffic in ATM networks. A variety of rate-based flow control approaches have been proposed to support ABR service. Most of these approaches improve both the fairness among active connections and the link utilization by putting more and more complexity into a switch. In this article, we propose a flow control approach in which part of rate-calculation work is moved from switches to end-systems. As a result, the proposed approach reduces the rate-calculation effort in the switch. This may reduce the switch complexity and thus the implementation cost. Furthermore, it mitigates the difficulty for setting the measurement interval in switches. as well as features lower and more stable queue occupancy in the network. Simulation results are presented to demonstrate that the proposed approach achieves better performance than ERICA +, a well-known switch algorithm. (C) 2001 Elsevier Science B.V. All rights reserved.
  • Thumbnail Image
    Item type:Item,
    Synthesis and physical properties of linear and branch phenoxies
    (2001-12-01)
    Chen, JR
    ;
    Li, YS
    ;
    Chang, FC
    ;
    應用化學系
    ;
    Department of Applied Chemistry
    Linear and branch phenoxies have been synthesized by reacting difunctional epoxy and diphenol or triphenol monomer, using phosphonium salt as the catalyst. The reaction kinetics is analyzed by the ASTM E 698 method, which is suitable for a first order reaction system. The bulky structure of the bisphenol Z moiety retards the reaction; therefore, the reaction temperature required is higher- at 200 degreesC, compared to 190 degreesC for the bisphenol A based system. The introduction of a branch structure increases both molecular weight and the polydispersity of the phenoxy. A slightly branched structure tends to increase the distance between the polymer chains and results in a lower shear viscosity for easier processing. A higher branch results in light crosslinking and decreases the mobility of the polymer. The branch structure has a negligible effect on its glass transition temperature because the average distance between branches is substantially longer than the critical mainchain length for T-1's Brownian motion. The 100/1 (bisphenol/ trisphenol) system has the lowest viscosity, but its mechanical properties and the gas permeation properties are poorer than those of the others. The bisphenol Z based phenoxy shows superior mechanical properties, higher T-g, lower coefficient of thermal expansion, and lower gas permeation properties than the corresponding bisphenol A based phenoxy because of the steric hindrance structure of the bisphenol Z moiety.