Small forwarding tables for fast routing lookups (1997)
Cached
Download Links
| Venue: | in ACM Sigcomm |
| Citations: | 157 - 0 self |
BibTeX
@INPROCEEDINGS{Degermark97smallforwarding,
author = {Mikael Degermark and Andrej Brodnik and Svante Carlsson and Stephen Pink},
title = {Small forwarding tables for fast routing lookups},
booktitle = {in ACM Sigcomm},
year = {1997},
pages = {3--14}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
For some time, the networking community has assumed that it is impossible to do IP routing lookups in software fast enough to support gigabit speeds. IP routing lookups must �nd the routing entry with the longest matching pre�x, a task that has been thought to require hardware support at lookup frequencies of millions per second. We present a forwarding table data structure designed for quick routing lookups. Forwarding tables are small enough to �t in the cache of a conventional general purpose processor. With the table in cache, a 200 MHz Pentium Pro or a 333 MHz Alpha 21164 can perform a few million lookups per second. This means that it is feasible to do a full routing lookup for each IPpacket at gigabit speeds without special hardware. The forwarding tables are very small, a large routing table with 40,000 routing entries can be compacted to a forwarding table of 150�160 Kbytes. A lookup typically requires less than 100 instructions on an Alpha, using eight memory references accessing a total of 14 bytes. 1
