<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

1998 - 199932000 - 20057

Settings

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

Author: search.filters.author.Wang, PCHas files: No

Search Results

Now showing 1 - 10 of 10
  • 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,
    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,
    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,
    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,
    An efficient traffic control approach for GFR services in IP/ATM internetworks
    (1998)
    Chan, CT
    ;
    Chen, YC
    ;
    Wang, PC
    ;
    資訊工程學系
    ;
    Department of Computer Science
    The Guaranteed Frame Rate (GFR)/UBR+ service has been proposed to support traffic streams with a minimum packet level guarantee for packets not exceeding the maximum size. In addition, the service also specifies that the excess traffic of a user should have access to a fair share of available resource. In this paper, we investigate a packet-discard strategy in combination with the push-out scheme, which alleviates the effect of fragmentation and supports GFR services efficiently. The simulation results show that our proposed method achieves the requirements of GFR service as well as improves the TCP throughput using the common FIFO cell scheduling. Moreover, it is feasible in implementation.
  • Thumbnail Image
    Item type:Item,
    A fast IP routing lookup scheme
    (2000)
    Wang, PC
    ;
    Chan, CT
    ;
    Chen, YC
    ;
    資訊工程學系
    ;
    Department of Computer Science
    A major design issue for the next generation routers is the 1P lookup mechanism. The router needs to perform a longest prefix matching on the address lookup for each incoming packet to determine the next hop. Currently, the process is done in software and has become a major performance bottleneck of the router. In this paper, we propose a fast IP lookup mechanism in which the forwarding table is small enough to fit in SRAM with very low cost. It also can be implemented in hardware using the pipeline technique. A large routing table with 45,000 routing prefixes can be compressed to a forwarding table with about 430 Kbytes in size by using our proposed method. In the worst case, the number of memory accesses for a lookup is three. When implemented in pipeline technique, the proposed mechanism can achieve one routing lookup per memory access. With current ions SRAM, this mechanism provides approximately 100 million routing lookups per second. Futhermore, the lookup speed can be improved linearly through the speedup of the memory access.
  • Thumbnail Image
    Item type:Item,
    A fast table update scheme for high-performance IP forwarding
    (2001)
    Wang, PC
    ;
    Chan, CT
    ;
    Chen, YC
    ;
    資訊工程學系
    ;
    Department of Computer Science
    There has been an extensive study in constructing the routing tables during the past few years. Although the existing works have certain advantages, ho,vel er, those approaches either use complicated data structures which result in large storage requirement and high complexity updating/building the forwarding table, or they are not scalable refit in IPv6. Lampson et al. proposed an IP lookup algorithm which performs binary search on prefixes (BSP) [11] The algorithm is attractive, even for IPv6, because of its bounded worst-case memory requirement. For achieving fast forwarding the cost paid is the slowing down insertion. Although this can be justified, the performance of routing-table reconstruction in BGP is too time-consuming,ring to handle the frequent route updates. In this work, we propose a fast forwarding-table construction algorithm which can handle more than 4,000 route updates per second. Moreover; it is simple enough to fufil the need of fast packet forwarding. With the modified multiway search tree, we can further reduce the depth of the tree and eliminate the storage for pointers, this reduces the fowarding table size and shorten the lookup time.
  • Thumbnail Image
    Item type:Item,
    Routing interval: A new concept for IP lookups
    (2001)
    Wang, PC
    ;
    Chan, CT
    ;
    Hu, SC
    ;
    Chen, YC
    ;
    資訊工程學系
    Nowadays, the commonly used table lookup scheme for IP routing is based on the so-called classless interdomain routing (CIDR). With CIDR, routers must find out the best matching prefix (BMP) for IP packets forwarding, which complicates the IP lookup. Currently, this process is mainly done in software and several schemes have been proposed for hardware implementation. Since the IP lookup performance is a major design issue for the new generation routers, in this article we investigate the properties of the routing table and present a new approach for EP lookups, our approach does not require the rule of BMP and thus significantly reduces the complexity. By applying our proposed approach, the computation cost of existing schemes can be significantly reduced. We also propose an efficient IP lookup algorithm, with which we improve the binary search on prefixes to 30 MPPS and 5,000 route updates/s under the same experiment setup with an even larger routing table.
  • Thumbnail Image
    Item type:Item,
    Performance enhancement of XCP for high bandwidth-delay product networks
    (2005)
    Yang, YR
    ;
    Chan, CT
    ;
    Wang, PC
    ;
    Chen, YC
    ;
    資訊工程學系
    It has been demonstrated that as the per-flow product of bandwidth delay increases, TCP becomes inefficient and unstable, regardless of the queuing discipline. By decoupling utilization control from fairness control, the eXplicit Control Protocol (XCP) outperforms TCP in both conventional and high bandwidth-delay environments. In this article,. we present an efficient flow control scheme based on XCP for high bandwidth-delay product networks. It can shorten the response time and improve the performance of XCP. Simulation results show the effectiveness of our proposed scheme in several performance aspects. Moreover, its implementation is simple enough to fulfill the required criteria of high bandwidth-delay product networks.