 |
English
|
正體中文
|
简体中文
|
Post-Print筆數 : 27 |
Items with full text/Total items : 113656/144643 (79%)
Visitors : 51718710
Online Users : 643
|
|
|
Loading...
|
Please use this identifier to cite or link to this item:
https://nccur.lib.nccu.edu.tw/handle/140.119/113801
|
| Title: | High-Speed Route Search Mechanism for IPV6 |
| Authors: | Chen, Wen-Shyen E.
Tsai, Chung-Ting Justine
Hsu, Lu-meng |
| Date: | 1999 |
| Issue Date: | 2017-10-18 16:52:55 (UTC+8) |
| 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. |
| Relation: | TANet`99會議論文
交換與路由器 |
| Data Type: | conference |
| Appears in Collections: | [TANET 台灣網際網路研討會] 會議論文
|
Files in This Item:
| File |
Description |
Size | Format | |
|---|
| 090.pdf | | 664Kb | Adobe PDF2 | 208 | View/Open |
|
All items in 政大典藏 are protected by copyright, with all rights reserved.
|
著作權政策宣告 Copyright Announcement1.本網站之數位內容為國立政治大學所收錄之機構典藏，無償提供學術研究與公眾教育等公益性使用，惟仍請適度，合理使用本網站之內容，以尊重著作權人之權益。商業上之利用，則請先取得著作權人之授權。
The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.
2.本網站之製作，已盡力防止侵害著作權人之權益，如仍發現本網站之數位內容有侵害著作權人權益情事者，請權利人通知本網站維護人員(
nccur@nccu.edu.tw)，維護人員將立即採取移除該數位著作等補救措施。
NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(
nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.
