<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

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

Access type: Metadata onlyAuthor: search.filters.author.Chan, CT

Search Results

Now showing 1 - 10 of 24
  • Thumbnail Image
    Item type:Item,
    Traffic control approaches for voice over ATM networks
    (1998-12-01)
    Chen, YC
    ;
    Chan, CT
    ;
    Hu, SC
    ;
    Wang, PC
    ;
    資訊工程學系
    In this paper we present two traffic control approaches, a circuit emulation traffic control (CETC) and an adaptive priority traffic control (APTC) for supporting voice services in ATM networks. Most voice services can be handled as CBR traffic, this causes a lot of wasted bandwidth. Sending Voice through VBR(variable bit rate) may be a better alternative. because it allows the network to allocate voice bandwidth on demand. In CETC. the service discipline guarantees the quality of service (QOS) for voice circuits. Through mathematical analysis. we show that CETC features an adequate performance in delay-jitter. Moreover, it is feasible in implementation. We also present an APTC approach which uses a dynamic buffer allocation scheme to adjust the buffer size based on the real traffic need, as well as employs an adaptive priority queuing technique to handle various delay requirements for VER voice traffic. It provides an adequate QOS for voice circuits in addition to improving the multiplexing gain. Simulation results show that voice traffic get satisfied delay performance using our approaches. It may fulfill the emerging needs of voice service over ATM networks.
  • 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,
    On the effective traffic control of ABR services in ATM networks
    (1998-02-01)
    Chen, YC
    ;
    Chan, CT
    ;
    Hu, SC
    ;
    資訊工程學系
    ;
    Department of Computer Science
    Although ATM networks support various traffic requirements, but many data applications are unable to precisely specify traffic parameters such as bit rate. These applications generally require a dynamic share of the available bandwidth among all active connections, they are called available-bit-rate (ABR) service. Due to bursty and unpredictable pattern of an ABR data stream, its traffic control is more challenging than other services. In this paper, we present an improved ABR traffic control approach, called Offset Proportional Rate Control Algorithm (OPRCA). The proposed approach achieves high link utilization, low delay and weighted fair sharing among contenting sources according to the predefined OPR. The implementation is much simpler than that of existing schemes. OPRCA combines an end-to-end rate control with link-by-link feedback control, and employs a buffering scheme that avoids Head-of-Line (HOL) blocking. It can dynamically regulate the transmission rate of source traffic and maintain the real fairness among all active connections. Simulation results have shown the effectiveness of OPRCA in several performance aspects.
  • Thumbnail Image
    Item type:Item,
    Traffic control approaches for voice over ATM networks
    (1998-12-01)
    Chen, YC
    ;
    Chan, CT
    ;
    Hu, SC
    ;
    Wang, PC
    ;
    資訊工程學系
    In this paper we present two traffic control approaches, a circuit emulation traffic control (CETC) and an adaptive priority traffic control (APTC) for supporting voice services in ATM networks. Most voice services can be handled as CBR traffic, this causes a lot of wasted bandwidth. Sending Voice through VBR(variable bit rate) may be a better alternative. because it allows the network to allocate voice bandwidth on demand. In CETC. the service discipline guarantees the quality of service (QOS) for voice circuits. Through mathematical analysis. we show that CETC features an adequate performance in delay-jitter. Moreover, it is feasible in implementation. We also present an APTC approach which uses a dynamic buffer allocation scheme to adjust the buffer size based on the real traffic need, as well as employs an adaptive priority queuing technique to handle various delay requirements for VER voice traffic. It provides an adequate QOS for voice circuits in addition to improving the multiplexing gain. Simulation results show that voice traffic get satisfied delay performance using our approaches. It may fulfill the emerging needs of voice service over ATM networks.
  • 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,
    A fast table update scheme for high-performance IP forwarding
    (2002-01-01)
    Wang, PC
    ;
    Chan, CT
    ;
    Chen, YC
    ;
    資訊工程學系
    ;
    Department of Computer Science
    In the previous work, Lampson et al. proposed an IP lookup algorithm which performs binary search on prefixes (BSP) [1]. The algorithm is attractive, even for IPv6, because of its bounded worst-case memory requirement. To achieve fast forwarding, it may need to slow down the insertion speed. Although this can be justified, the routing-table reconstruction in BSP is too time-consuming to handle the frequent route updates. In this work, we propose a fast forwarding-table construction algorithm which can accomplish more than 4,000 route updates per second. Moreover, it is simple enough to fulfill the need of fast packet forwarding. With the enhanced multiway search tree, we further reduced the depth of the tree and eliminated the pointer storage; this reduces the forwarding table size and shortens the lookup time.
  • Thumbnail Image
    Item type:Item,
    A fast packet classification by using enhanced tuple pruning
    (2002)
    Wang, PC
    ;
    Chan, CT
    ;
    Tseng, WC
    ;
    Chen, YC
    ;
    資訊工程學系
    In the packet classification, the route and resources allocated to a packet are determined by the destination address as well as other header fields of the packet such as source/destination address, TCP and UDP port numbers. It has been demonstrated that performing packet classification on a potentially large number of fields is difficult and has poor worst-case performance. In this work, we proposed an enhanced tuple pruning search algorithm called "Tuple Pruning +" that provides fast two-dimension packet classification. With reasonable extra filters added for Information Marker, only one hash access to the tuples is required. Through experiments, about 8 MB memory is required for 100K-filter database and 20 million packet per second (MPPS) is achievable. The results demonstrate that the proposed algorithm is suitable for high-speed packet classification.
  • Thumbnail Image
    Item type:Item,
    RedVegas: Performance improvement of TCP Vegas over heterogeneous networks
    (2004-07-01)
    Chan, YC
    ;
    Chan, CT
    ;
    Chen, YC
    ;
    資訊工程學系
    ;
    Department of Computer Science
    Current IP network has become the dominant paradigm for all networking environments. The significant cause of packet losses in such heterogenous networks is no longer limited to network congestion. Traditional TCP interprets every packet loss as caused by congestion which may be not the case in the current Internet. Misinterpretation of wireless random loss as an indication of network congestion results in TCP slowing down its sending rate unnecessarily. In this paper, we propose a new variant of TCP Vegas named RedVegas. By using the innate nature of Vegas and congestion indications marked by routers, RedVegas may detect random packet losses precisely. Through the packet loss differentiation, RedVegas reacts appropriately to the losses, and therefore the throughput of connection over heterogeneous networks can be significantly improved.
  • Thumbnail Image
    Item type:Item,
    Performance improvement of hardware-based packet classification algorithm
    (2005)
    Chen, YC
    ;
    Wang, PC
    ;
    Lee, CL
    ;
    Chan, CT
    ;
    資訊工程學系
    Packet classification is important in fulfilling the requirements of differentiated services in next generation networks. In the previous work, we presented an efficient hardware scheme, Condensate Bit Vector, based on bit vectors. The scheme significantly improves the scalability of packet classification. In this work, the characteristics of Condensate Bit Vector are further illustrated, and two drawbacks that may negatively affect the performance of Condensate Bit Vector are revealed. We show the solution to resolve the weaknesses and introduce the new schemes, Condensate Ordered Bit Vector and Condensate and Aggregate Ordered Bit Vector. Experiments show that our new algorithms drastically improve the search speed as compared to the original algorithm.
  • Thumbnail Image
    Item type:Item,
    Least required bandwidth in VP-based ATM networks
    (1997)
    Chen, YC
    ;
    Hu, SC
    ;
    Chan, CT
    ;
    資訊工程學系
    ;
    Department of Computer Science
    In an ATM network, a virtual path (VP) is a labeled path which can be used to transport a bundle of virtual connections (VCs) and to management the resources used by these connections. The ATM multimedia leased line service is provided across user-to-user VPs. Customers can increase/decrease VP bandwidth according to their demand. This paper proposes a method to derive the least required bandwidth on a VP which is the minimum amount of bandwidth estimated to satisfy the QoS requirement of VCs. The least required bandwidth can be a warranty of VP resource reallocation.