Forwarding engine for fast routing lookups and updates

被引：0

作者：

Yu, DX ^{[1
]}

Smith, BC ^{[1
]}

Wei, B ^{[1
]}

机构：

[1] San Jose State Univ, Dept Elect Engn, San Jose, CA 95192 USA

来源：

GLOBECOM'99: SEAMLESS INTERCONNECTION FOR UNIVERSAL SERVICES, VOL 1-5 | 1999年

关键词：

D O I：

暂无

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

The IP address lookup is a bottleneck for a gigabit router as the router needs to find the longest matching prefix (BMP) for the address. Our hash-based design allocates hashed keys among memory modules based on their statistics to minimize hash collisions and facilitate parallel table lookup. It requires 1.5 Mbyte-memory for a 42,156-entry routing table. The table lookup speed is 20 ns for a 24-bit prefix and update speed is 25 ns, given 5 ns for a 1,280-byte SRAM module. The design is scalable with respect to the number of router interfaces, and can be easily extended to IPv6.

引用

页码：1556 / 1564

页数：9

共 50 条

[31] Routing interval: A new concept for IP lookups
Wang, PC
Chan, CT
Hu, SC
Chen, YC
JOINT 4TH IEEE INTERNATIONAL CONFERENCE ON ATM (ICATM'01) AND HIGH SPEED INTELLIGENT INTERNET SYMPOSIUM, 2001, : 310 - 315
[32] Fast IP Network Recovery Using Imperative-Forwarding-Path Routing
Pan, Shu-wen
Chen, Shan-zhi
Li, Xin
2009 5TH INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING, VOLS 1-8, 2009, : 4108 - +
[33] Binary search schemes for fast IP lookups
Mehrotra, P
Franzon, PD
GLOBECOM'02: IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-3, CONFERENCE RECORDS: THE WORLD CONVERGES, 2002, : 2005 - 2009
[34] Toward Fast NDN Software Forwarding Lookup Engine Based on Hash Tables
So, Won
Narayanan, Ashok
Oran, Dave
Wang, Yaogong
PROCEEDINGS OF THE EIGHTH ACM/IEEE SYMPOSIUM ON ARCHITECTURES FOR NETWORKING AND COMMUNICATIONS SYSTEMS (ANCS'12), 2012, : 85 - 86
[35] A memory-efficient parallel routing lookup model with fast updates
Li, Yanbiao
Zhang, Dafang
Huang, Kun
He, Dacheng
Long, Weiping
COMPUTER COMMUNICATIONS, 2014, 38 : 60 - 71
[36] A high-speed IP routing lookup scheme with fast updates
Kim, BY
Choi, YH
HSNMC 2002: 5TH IEEE INTERNATIONAL CONFERENCE ON HIGH SPEED NETWORKS AND MULTIMEDIA COMMUNICATIONS, 2002, : 167 - 171
[37] On the Granularity of Trie-Based Data Structures for Name Lookups and Updates
Ghasemi, Chavoosh
Yousefi, Hamed
Shin, Kang G.
Zhang, Beichuan
IEEE-ACM TRANSACTIONS ON NETWORKING, 2019, 27 (02) : 777 - 789
[38] Novel hardware architecture for fast address lookups
Mehrotra, P
Franzon, PD
HPSR 2002: WORKSHOP ON HIGH PERFORMANCE SWITCHING AND ROUTING, PROCEEDINGS: MERGING OPTICAL AND IP TECHNOLOGIES, 2002, : 105 - 110
[39] Forwarding and Routing With Packet Subscriptions
Jepsen, Theo
Fattaholmanan, Ali
Moshref, Masoud
Foster, Nate
Carzaniga, Antonio
Soule, Robert
IEEE-ACM TRANSACTIONS ON NETWORKING, 2022, 30 (06) : 2464 - 2479
[40] Power-efficient TCAM partitioning for IP lookups with incremental updates
Chang, YK
INFORMATION NETWORKING: CONVERGENCE IN BROADBAND AND MOBILE NETWORKING, 2005, 3391 : 531 - 540

← 1 2 3 4 5 →