Other formats:
BibTeX
LaTeX
RIS
@inproceedings{492614, author = {Antoš, David and Kořenek, Jan}, address = {Měřín}, booktitle = {SOFSEM 2004}, keywords = {String matching; IPv6; IP routing; CAM; FPGA; Liberouter}, language = {eng}, location = {Měřín}, isbn = {80-86732-19-3}, pages = {205-210}, publisher = {MATFYZPRESS, Prague}, title = {String Matching for IPv6 Routers}, year = {2004} }
TY - JOUR ID - 492614 AU - Antoš, David - Kořenek, Jan PY - 2004 TI - String Matching for IPv6 Routers PB - MATFYZPRESS, Prague CY - Měřín SN - 8086732193 KW - String matching KW - IPv6 KW - IP routing KW - CAM KW - FPGA KW - Liberouter N2 - 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. ER -
ANTOŠ, David and Jan KOŘENEK. String Matching for IPv6 Routers. In \textit{SOFSEM 2004}. Měřín: MATFYZPRESS, Prague, 2004, p.~205-210. ISBN~80-86732-19-3.
|