"Praha" . "Porovn\u00E1v\u00E1n\u00ED \u0159et\u011Bzc\u016F pro sm\u011Brova\u010De IPv6"@cs . "6"^^ . . "SOFSEM 2004: Theory and Practice of Computer Science" . . "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."@en . . "Z(MSM6383917201)" . "String Matching for IPv6 Routers"@en . "80-86732-19-3" . . "\u010Cl\u00E1nek pojedn\u00E1v\u00E1 o vyhled\u00E1v\u00E1n\u00ED v IPv6 sm\u011Brova\u010Di, kter\u00E9 je realizov\u00E1no prost\u0159ednictv\u00EDm n\u011Bkolika d\u00EDl\u010D\u00EDch operac\u00ED nad hlavi\u010Dkou paketu. Sm\u011Brov\u00E1n\u00ED je zalo\u017Eeno na hled\u00E1n\u00ED prefix\u016F, filtrov\u00E1n\u00ED je kombinac\u00ED hled\u00E1n\u00ED prefix\u016F s kontrolou rozsah\u016F a p\u0159esn\u00FDm porovn\u00E1n\u00EDm. Pro IPv6 s\u00EDt\u011B, kde je d\u00E9lka adresy v\u011Bt\u0161\u00ED ne\u017E 128 bit\u016F, nejsou SW \u0159e\u0161en\u00ED dostate\u010Dn\u011B v\u00FDkon\u00E1. Je p\u0159irozen\u00E9 p\u0159esunout \u010Dasov\u011B n\u00E1ro\u010Dn\u00E9 operace do hardwarov\u00E9ho akceler\u00E1toru. Hled\u00E1n\u00ED \u0159et\u011Bzc\u016F mus\u00ED b\u00FDt provedeno v hardwar\u016F. Nicm\u00E9n\u011B pro IPv6 protokol je nutn\u00E9 poorovnat del\u0161\u00ED \u0159et\u011Bzce ne\u017E je \u0161\u00ED\u0159ka dnes dostupn\u00FDch asociativn\u00EDch pam\u011Bt\u00ED. Z tohoto d\u016Fvodu je nutn\u00E9 zajistit hled\u00E1n\u00ED kombinac\u00ED asociativn\u00ED pam\u011Bti s dal\u0161\u00EDm zpracov\u00E1n\u00EDm. Vznik\u00E1 tak pro programovou podporu nov\u00FD \u00FAkol: je nutn\u00E9 udr\u017Eovat hrdwarov\u00E9 tabulky v konzistenci se softwarov\u00FDm sm\u011Brov\u00E1n\u00EDm a filtrov\u00E1n\u00EDm.
"@cs . "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." . . . "RIV/00216305:26230/04:PU49069" . . "1"^^ . . "RIV/00216305:26230/04:PU49069!RIV06-MSM-26230___" . . "2004-01-24+01:00"^^ . . . . "26230" . "Porovn\u00E1v\u00E1n\u00ED \u0159et\u011Bzc\u016F pro sm\u011Brova\u010De IPv6"@cs . "2"^^ . "[BB899106AF5A]" . "M\u011B\u0159\u00EDn" . . "String Matching for IPv6 Routers"@en . . "205-210" . "String Matching for IPv6 Routers" . . . . "588406" . "String Matching for IPv6 Routers" . "CESNET" . "Anto\u0161, David" . . . "String matching, IPv6, IP routing, CAM, FPGA, Liberouter."@en . "Ko\u0159enek, Jan" .