DocumentCode
432862
Title
An Efficient Content-Addressable Memory Implementation Using Dynamic Routing
Author
James-Roxby, Philip B. ; Downs, Daniel J.
Author_Institution
Xilinx, Inc.
fYear
2001
fDate
March 29 2001-April 2 2001
Firstpage
81
Lastpage
90
Abstract
Content addressable memories are important components in high-speed networking equipment. This paper describes the design of a wide CAM suitable for use as an IPv6 traffic classifier for a 622Mb/s communications link. The design flow uses a combination of standard design tools in conjunction with JBits, a low-level configuration API for manipulating programmable resources. The CAMs are 320 bits wide to accommodate a full IPv6 header. The most powerful wildcarding possible is supported, ranging from don’t cares on single bits of the header, all the way through to don’t cares for the whole header. A priority mechanism has been designed which allows explicit priority encoding to be used without required a costly sorting network. This is performed by dynamic routing, whereby routes are determined at run-time between the match units and the priority encoder. This allows a smaller, faster implicit priority encoder to be used, whilst still allowing priority to be explicitly defined. An experimental set-up is shown, which allows 128 320-bit patterns to be matched at 50.9 Msearches/s.
fLanguage
English
Publisher
ieee
Conference_Titel
Field-Programmable Custom Computing Machines, 2001. FCCM '01. The 9th Annual IEEE Symposium on
Conference_Location
Rohnert Park, CA, USA
Print_ISBN
0-7695-2667-5
Type
conf
Filename
1420904
Link To Document