A scalable and small forwarding table for fast IP address lookups

被引：0
|
作者：
Jean, S [1 ]
Chung, SH [1 ]
Cho, JW [1 ]
Yoon, H [1 ]
机构：
[1] Korea Adv Inst Sci & Technol, Dept Elect Engn & Comp Sci, Div Comp Sci, Yusong Gu, Taejon 305701, South Korea
来源：
2001 INTERNATIONAL CONFERENCE ON COMPUTER NETWORKS AND MOBILE COMPUTING, PROCEEDINGS | 2001年
关键词：
D O I：
10.1109/ICCNMC.2001.962626
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
IP address lookup is an important design issue for the high performance Internet routers. The most important function of routers is to determine the output port of an incoming IP packet according to its destination address. In this paper, we propose a scalable and simple forwarding table structure for fast hardware-based IP address lookup which reduces memory requirements and memory access times. Proposed scheme requires maximum two memory access times in the worst case to finish an IP address lookup. And it consumes about 0.6 similar to 1.1MBytes memory for large routing tables with 16,000 similar to 43,000 routing prefixes when any compression method is not used.
引用
收藏
页码：413 / 418
页数：4
相关论文
共 50 条
  • [21] A parallel IP-address forwarding approach based on partitioned lookup table techniques
    Song, Y
    Aboelela, E
    [J]. LCN 2004: 29TH ANNUAL IEEE INTERNATIONAL CONFERENCE ON LOCAL COMPUTER NETWORKS, PROCEEDINGS, 2004, : 425 - 426
  • [22] Novel hardware architecture for fast address lookups
    Mehrotra, P
    Franzon, PD
    [J]. IEEE COMMUNICATIONS MAGAZINE, 2002, 40 (11) : 66 - 71
  • [23] Scalable Multi-Failure Fast Failover via Forwarding Table Compression
    Stephens, Brent
    Cox, Alan L.
    Rixner, Scott
    [J]. SYMPOSIUM ON SOFTWARE DEFINED NETWORKING (SDN) RESEARCH (SOSR'16), 2016,
  • [24] Fast address lookups using controlled prefix expansion
    Srinivasan, V
    Varghese, G
    [J]. ACM TRANSACTIONS ON COMPUTER SYSTEMS, 1999, 17 (01): : 1 - 40
  • [25] Routing table partitioning for speedy packet lookups in scalable routers
    Tzeng, NF
    [J]. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2006, 17 (05) : 481 - 494
  • [26] Fast IP routing lookups for high performance routers
    Kijkanjarat, T
    Chao, HJ
    [J]. COMPUTER COMMUNICATIONS, 1999, 22 (15-16) : 1415 - 1422
  • [27] Bit-map trie: A data structure for fast forwarding lookups
    Oh, SH
    Ahn, JS
    [J]. GLOBECOM '01: IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-6, 2001, : 1872 - 1876
  • [28] Reconfigurable memory architecture for scalable IP forwarding
    Nourani, M
    Akhbarizadeh, M
    [J]. MICROPROCESSORS AND MICROSYSTEMS, 2003, 27 (5-6) : 253 - 263
  • [29] Multi-zone caches for accelerating IP routing table lookups
    Chvets, IL
    MacGregor, MH
    [J]. HPSR 2002: WORKSHOP ON HIGH PERFORMANCE SWITCHING AND ROUTING, PROCEEDINGS: MERGING OPTICAL AND IP TECHNOLOGIES, 2002, : 121 - 126
  • [30] Fast IP packet forwarding and classification
    O'Reilly, P
    [J]. IEEE NETWORK, 2001, 15 (02): : 2 - 2
12345