An efficient IP routing lookup by using routing interval

檔案

日期

2001-12-01

類型

期刊名稱

JOURNAL OF COMMUNICATIONS AND NETWORKS

卷期與頁次

第 3 卷第 4 期,頁 374–382

ISSN

1229-2370

語言

英文

摘要

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.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Wang, P., Chan, C., & Chen, Y. (2001). An efficient IP routing lookup by using routing interval. JOURNAL OF COMMUNICATIONS AND NETWORKS, 3(4), 374–382. https://ir.lib.nycu.edu.tw/handle/11536/29235

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/29235