Publication Details

String Matching for IPv6 Routers

ANTOŠ, D.; KOŘENEK, J. String Matching for IPv6 Routers. SOFSEM 2004: Theory and Practice of Computer Science. Praha: CESNET National Research and Education Network, 2004. p. 205-210. ISBN: 80-86732-19-3.
Czech title
Porovnávání řetězců pro směrovače IPv6
Type
conference paper
Language
English
Authors
Antoš David, Mgr.
Kořenek Jan, doc. Ing., Ph.D. (DCSY)
Keywords

String matching, IPv6, IP routing, CAM, FPGA, Liberouter.

Abstract

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.

Published
2004
Pages
205–210
Proceedings
SOFSEM 2004: Theory and Practice of Computer Science
ISBN
80-86732-19-3
Publisher
CESNET National Research and Education Network
Place
Praha
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"
}
Back to top