Small forwarding tables for fast routing lookupsReportar como inadecuado

Small forwarding tables for fast routing lookups - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Luleå tekniska universitet.Brodnik, Andrej Carlsson, Svante Luleå tekniska universitet.Pink, Stephen 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.

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: diva2:987952

Note: Godkänd; 1997; 20080312 (ysko)Available from: 2016-09-29 Created: 2016-09-29Bibliographically approved

Autor: Degermark, Mikael


Documentos relacionados