ANTOŠ, David and Jan KOŘENEK. String Matching for IPv6 Routers. In SOFSEM 2004. Měřín: MATFYZPRESS, Prague, 2004, p. 205-210. ISBN 80-86732-19-3.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name String Matching for IPv6 Routers
Authors ANTOŠ, David and Jan KOŘENEK.
Edition Měřín, SOFSEM 2004, p. 205-210, 6 pp. 2004.
Publisher MATFYZPRESS, Prague
Other information
Original language English
Type of outcome Proceedings paper
Field of Study 20206 Computer hardware and architecture
Country of publisher Czech Republic
Confidentiality degree is not subject to a state or trade secret
Organization unit Institute of Computer Science
ISBN 80-86732-19-3
Keywords in English String matching; IPv6; IP routing; CAM; FPGA; Liberouter
Tags CAM, FPGA, IP routing, IPv6, liberouter, String matching
Changed by Changed by: RNDr. David Antoš, Ph.D., učo 3077. Changed: 13/1/2005 11:00.
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.
Links
MSM 000000001, plan (intention)Name: Vysokorychlostní síť národního výzkumu a její nové aplikace
PrintDisplayed: 18/8/2024 03:27