Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Small forwarding tables for fast routing lookups
Luleå tekniska universitet.
Luleå tekniska universitet.
Luleå tekniska universitet.
1997 (English)Report (Other academic)
Abstract [en]

For some time, the Internet community has believed that it is impossible to do IP routing lookups in software fast enough to support gigabit speeds. IP routing lookups must find the routing entry with the longest matching prefix, 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 fit 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 IP packet 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.

Place, publisher, year, edition, pages
Luleå: Luleå tekniska universitet, 1997. , 10 p.
Series
Research report / Luleå University of Technology, ISSN 1402-1528 ; 1997:02
National Category
Computer Sciences
Research subject
Dependable Communication and Computation Systems
Identifiers
URN: urn:nbn:se:ltu:diva-24248Local ID: a3da47f0-fb4c-11dc-a946-000ea68e967bOAI: oai:DiVA.org:ltu-24248DiVA: diva2:997299
Note
Godkänd; 1997; 20080326 (ysko)Available from: 2016-09-29 Created: 2016-09-29 Last updated: 2017-11-24Bibliographically approved

Open Access in DiVA

fulltext(233 kB)40 downloads
File information
File name FULLTEXT01.pdfFile size 233 kBChecksum SHA-512
dd1262bb89ed2963ebfaf8fc8417851940d4cc259f6ddef24f3b24b5877a1266f41c26fa2410dc90efabe7efa2f7e26e4ce7f3c3ad6d86c3f3f08e1b7c1613ff
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Brodnik, Andrej
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar
Total: 40 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 12 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf