Přístupnostní navigace
E-přihláška
Vyhledávání Vyhledat Zavřít
Detail publikace
ANTOŠ, D., KOŘENEK, J.
Originální název
String Matching for IPv6 Routers
Typ
článek ve sborníku ve WoS nebo Scopus
Jazyk
angličtina
Originální abstrakt
String matching problem instantiates in IP routing into several operations on packet headers. Routing itself is finding the best matching prefix of a set of strings, packet filtering is a combination of prefix matching, exact, and range checks. With the increase of IPv6 importance (with its 128~bit addresses) those operations get more critical in time. Software implementations may not be powerful enough. Natural way is to move the most demanding operations into a hardware accelerator, just in the sense of hardware/software co-design ideas. String matching must be performed by hardware. Unfortunately, we have to check wider strings than today's Content Addressable Memories can hold; therefore combination of CAM and additional processing may be employed. New task for software support arises here: it has to maintain hardware lookup tables consistent with the software's ideas about routing and packet filtering.
Klíčová slova
String matching, IPv6, IP routing, CAM, FPGA, Liberouter.
Autoři
Vydáno
16. 2. 2004
Nakladatel
CESNET National Research and Education Network
Místo
Praha
ISBN
80-86732-19-3
Kniha
SOFSEM 2004: Theory and Practice of Computer Science
Strany od
205
Strany do
210
Strany počet
6
BibTex
@inproceedings{BUT16903, author="David {Antoš} and Jan {Kořenek}", title="String Matching for IPv6 Routers", booktitle="SOFSEM 2004: Theory and Practice of Computer Science", year="2004", pages="205--210", publisher="CESNET National Research and Education Network", address="Praha", isbn="80-86732-19-3" }