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)In: Computer communication review, ISSN 0146-4833, E-ISSN 1943-5819, Vol. 27, no 4, 3-14 p.Article in journal (Refereed) Published
Abstract [en]

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 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
1997. Vol. 27, no 4, 3-14 p.
National Category
Computer Sciences
Research subject
Dependable Communication and Computation Systems
Identifiers
URN: urn:nbn:se:ltu:diva-14979DOI: 10.1145/263109.263133Local ID: e6f538c0-f051-11dc-ba03-000ea68e967bOAI: oai:DiVA.org:ltu-14979DiVA: diva2:987952
Note
Godkänd; 1997; 20080312 (ysko)Available from: 2016-09-29 Created: 2016-09-29 Last updated: 2017-11-24Bibliographically approved

Open Access in DiVA

fulltext(200 kB)5 downloads
File information
File name FULLTEXT01.pdfFile size 200 kBChecksum SHA-512
13421a2294188cb442d14b93d83002f465f58479f99cfcf1acbe6f1bd69a2f51abdbd2175c8d499174f7d9bf7a15a1d29a7a0e159461eb884fa70c3168359b46
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Authority records BETA

Brodnik, Andrej

Search in DiVA

By author/editor
Brodnik, Andrej
In the same journal
Computer communication review
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar
Total: 5 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

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 15 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