Publications-Conference Papers
Article View/Open
Publication Export
-
Google ScholarTM
NCCU Library
Citation Infomation
Related Publications in TAIR
題名 High-Speed Route Search Mechanism for IPV6 作者 Chen, Wen-Shyen E.
Tsai, Chung-Ting Justine
Hsu, Lu-meng日期 1999 上傳時間 18-Oct-2017 16:52:55 (UTC+8) 摘要 The Internet`s astounding growth has begun to stress the technology that supports it, namely, the current Internet Protocol Suite, IPv4. IPv6 (Internet Protocol, Version 6) was developed to address the issues. The IPv6 resolves the Internet scaling problem, provides a flexible transition mechanism, and meets the needs of such new market as nomadic personal computing devices, networked entertainment, and device control. Nevertheless, the specification of IPv6 does not provide mechanisms to speed up the processing of the packets in the routers. As a result, the introduction of IPv6 might demand more computation from the already overloaded routers. In this paper, we propose a high speed IP lookup scheme for IPv4 and then describe how the mechanism can be scaled to IPv6 in order to speed up the packet processing in the routers. The proposed mechanisms search for the Best Matching Prefix (BMP) by using em forwarding tables consisting of Prefix Information Tables (PITs) and Lookup Tables (LTs) that provide guidelines for efficient search. The FPGA implementation of the scheme for IPv6 is also shown to validate its feasibility. For IP lookup in IPv4, the scheme needs 1 memory access in the best case, and 2 memory accesses plus one hash in the worst case to locate the BMP. It requires only 560 KBytes to 670 KBytes of memory space when about 45,000 routing tables entries in the backbone are logged for simulation. More memory (about 300 Kbytes more) can be used to reduce the worst case access time to 2 memory accesses. When 50ns DRAM is used for the forwarding tables, the scheme offers lookup speed of 10 millions packets per second. The lookup speed can be improved linearly with the speedup of the type of memory used. Further, it does not need complex compression mechanisms to reduce the memory requirement. Although the currently available traces and routing entries for IPv6 do not provide the scale similar to that of the IPv4, initial analysis shows the approach takes at most 3 hashes and 2 memory accesses to locate the BMP in IPv6. Parallelism can be explored to further improve the lookup performance. 關聯 TANet`99會議論文
交換與路由器資料類型 conference dc.creator (作者) Chen, Wen-Shyen E. en_US dc.creator (作者) Tsai, Chung-Ting Justine en_US dc.creator (作者) Hsu, Lu-meng en_US dc.date (日期) 1999 dc.date.accessioned 18-Oct-2017 16:52:55 (UTC+8) - dc.date.available 18-Oct-2017 16:52:55 (UTC+8) - dc.date.issued (上傳時間) 18-Oct-2017 16:52:55 (UTC+8) - dc.identifier.uri (URI) http://nccur.lib.nccu.edu.tw/handle/140.119/113801 - dc.description.abstract (摘要) The Internet`s astounding growth has begun to stress the technology that supports it, namely, the current Internet Protocol Suite, IPv4. IPv6 (Internet Protocol, Version 6) was developed to address the issues. The IPv6 resolves the Internet scaling problem, provides a flexible transition mechanism, and meets the needs of such new market as nomadic personal computing devices, networked entertainment, and device control. Nevertheless, the specification of IPv6 does not provide mechanisms to speed up the processing of the packets in the routers. As a result, the introduction of IPv6 might demand more computation from the already overloaded routers. In this paper, we propose a high speed IP lookup scheme for IPv4 and then describe how the mechanism can be scaled to IPv6 in order to speed up the packet processing in the routers. The proposed mechanisms search for the Best Matching Prefix (BMP) by using em forwarding tables consisting of Prefix Information Tables (PITs) and Lookup Tables (LTs) that provide guidelines for efficient search. The FPGA implementation of the scheme for IPv6 is also shown to validate its feasibility. For IP lookup in IPv4, the scheme needs 1 memory access in the best case, and 2 memory accesses plus one hash in the worst case to locate the BMP. It requires only 560 KBytes to 670 KBytes of memory space when about 45,000 routing tables entries in the backbone are logged for simulation. More memory (about 300 Kbytes more) can be used to reduce the worst case access time to 2 memory accesses. When 50ns DRAM is used for the forwarding tables, the scheme offers lookup speed of 10 millions packets per second. The lookup speed can be improved linearly with the speedup of the type of memory used. Further, it does not need complex compression mechanisms to reduce the memory requirement. Although the currently available traces and routing entries for IPv6 do not provide the scale similar to that of the IPv4, initial analysis shows the approach takes at most 3 hashes and 2 memory accesses to locate the BMP in IPv6. Parallelism can be explored to further improve the lookup performance. dc.format.extent 680927 bytes - dc.format.mimetype application/pdf - dc.relation (關聯) TANet`99會議論文 zh_TW dc.relation (關聯) 交換與路由器 zh_TW dc.title (題名) High-Speed Route Search Mechanism for IPV6 en_US dc.type (資料類型) conference
