Name
Title | ||
|---|---|---|
Low power fast and dense longest prefix match content addressable memory for IP routers |
Abstract | ||
|---|---|---|
An IP router determines the next hop for an internet protocol packet by finding the longest prefix match. Ternary CAMs, which allow bit masking of the IP address, are commonly used for this fast search function. In this paper, a CAM that directly determines the longest prefix match to the stored address is described. One of these best matching (IPCAM) entries replaces on average 22 TCAM entries. Overall, the resulting IPCAM array is less than 1/10 the size of the equivalent TCAM and dissipates 93.5% less dynamic power. The design automatically produces an encoded prefix match length that is limited by the prefix mask, so entries do not need to be sorted in prefix mask length order. Simulations of extracted layouts in a bulk CMOS 65-nm foundry process show the proposed IPCAM circuits can operate above 1 GHz |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1145/1594233.1594333 | ISLPED |
Keywords | Field | DocType |
prefix mask length order,low power,equivalent tcam,tcam entry,encoded prefix match length,dense longest prefix match,proposed ipcam circuit,ip address,content addressable memory,ipcam array,ip routers,ip router,prefix mask,longest prefix match,internet protocol,ip routing,longest prefix matching | Internet Protocol,Content-addressable memory,Computer science,Network packet,Parallel computing,Mask,Real-time computing,Prefix,Dynamic demand,Longest prefix match,Yottabyte | Conference |
Citations | PageRank | References |
1 | 0.37 | 8 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Satendra Kumar Maurya | 1 | 5 | 1.54 |
| Lawrence T. Clark | 2 | 155 | 33.27 |