<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

2000 - 20014

Settings

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

Subject: search.filters.subject.gigabit networking

Search Results

Now showing 1 - 4 of 4
  • Thumbnail Image
    Item type:Item,
    A fast IP routing lookup scheme
    (2001-03-01)
    Wang, PC
    ;
    Chan, CT
    ;
    Chen, YC
    ;
    資訊工程學系
    ;
    Department of Computer Science
    A major issue in router design for the next generation Internet is the fast IP address lookup mechanism. The existing scheme by Huang et al. performs the IP address lookup in hardware in which the forwarding table can be compressed to fit into reasonable-size SRAM, and a lookup can be accomplished in three memory accesses. In this letter, we claim that with a little extra memory, it is able to further reduce the lookup time to two memory accesses.
  • Thumbnail Image
    Item type:Item,
    Performance enhancement of IP forwarding by reducing routing table construction time
    (2001-05-01)
    Wang, PC
    ;
    Chan, CT
    ;
    Chen, YC
    ;
    資訊工程學系
    ;
    Department of Computer Science
    In previous work, Lampson et al, proposed an IP lookup algorithm which performs binary search on prefixes (BSP) [3], The algorithm is attractive for IPv6 because of its bounded worst-case memory requirement. Although for the sake of fast forwarding, the cost paid for the slowing down insertion is reasonable, the performance of routing-table reconstruction in BGP is too time-consuming to handle the frequent route updates. In this letter, we propose a fast forwarding-table construction algorithm which can handle more than 3600 route updates per second, Moreover, it is simple enough to fulfill the need of fast packet forwarding.
  • Thumbnail Image
    Item type:Item,
    An efficient IP routing lookup by using routing interval
    (2001-12-01)
    Wang, PC
    ;
    Chan, CT
    ;
    Chen, YC
    ;
    資訊工程學系
    ;
    Department of Computer Science
    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, this complicates the IP lookup. Currently, this process is mainly performed 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 IP lookups, our approach is not based on BMP and significantly reduces the complexity, thus 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 millions of packets per second (MPPS) and 5,000 route updates/s under the same experiment setup with an even larger routing table.
  • 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.