High-performance TCAM-based IP Lookup Engines课件.ppt

Proposed work (1/5) Definitions: MSMB – LPT has a configuration with (m, n, k) m input k TCAM blocks LPT of size n Total number of prefixes M (each block contains M/k prefixes). The parameters m and k are carefully selected to achieve optimized cost and performance. Are there better MSMB schemes for given m and k ? Two proposed schemes: M – MSMB – LPT MSMB – LPT – I 精品文档 Proposed work (2/5) Multiple(M) – MSMB – LPT For large m (input), we propose to use w identical copies of MSMB – LPT of configuration (m’, n, k). input i*m’ + j as the j-th input of the (i+1)-th MSMB-LPT. m’ = m / w 精品文档 Proposed work (3/5) Multiple(M) – MSMB – LPT The w TCAM clocks TCAMj,u ,have the same content as TCAMu in MSMB-LPT, where j = 1 ~ w. We say that an M-MSMB-LPT has configuration (m, n, w, k). if it has w MSMB-LPTs of configuration (m’, n, k). In an M-MSMB-LPT scheme, w MSMB-LPTs operate completely independently. MSMB - LPTj Input (j-1)*m’ + 1 Input (j-1)*m’ + 2 Input j*m’ k CRs and k TCAM blocks … 精品文档 Proposed work (4/5) MSMB – LPT – Interleaved TCAMs (MSMB – LPT – I) An MSMB – LPT – I of configuration (m, n, w, k) has m input, and the LPT of size n. wk TCAM blocks that are partitioned into k groups, each called TCAM bundle. Input 1 Input 2 Input m The w TCAM blocks in the j-th TCAM bundle contain the same content as that of TCAMj in the MSMB-LPT scheme. k bundles 精品文档 Proposed work (5/5) Process runs concurrently i = 1~ m j = 1~ k ni – th key from input i The concurrent TCAM – search processes are coordinated by CR, which can be implemented as a round robin m – to – w selector. 精品文档 Experimental results (1/9) We conduct a serious simulations on M-MSMB-LPT and MSMB-LPT-I. First – in – first – out (FIFO) replacement policy is used for LPT update. Round – rodin (RR) arbitration is used for TCAM contention resolution. Two packet traces are used in simulations. 1. generating accroding to routing table described in [17]. 2. derived from actual packet flows given in [19