Efficient prefix cache for network processors

Conventional routing cache systems store destination IP addresses in their cache directory. We present a routing cache technique that stores the most recently used route prefixes, instead of IP addresses, to achieve a significantly smaller cache size. A nesting prefix is partially represented in this cache by its minimal expansions. Such expanded prefixes are obtained using an incremental technique without any modifications to the routing table. Consequently, our cache works with most of the common route lookup algorithms and efficiently maintains coherency with the routing table. Experiments show that, for a hit ratio over 0.96, our design can achieve more than 33 times reduction in cache size, compared to a conventional routing cache.

[1]  Douglas Comer,et al.  Network Systems Design Using Network Processors , 2003 .

[2]  Chung-Hsun Huang,et al.  High-speed and low-power CMOS priority encoders , 2000, IEEE Journal of Solid-State Circuits.

[3]  Suresh Singh,et al.  Greening of the internet , 2003, SIGCOMM '03.

[4]  Tzi-cker Chiueh,et al.  Cache Memory Design for Internet Processors , 2000, IEEE Micro.

[5]  Walid Dabbous,et al.  Survey and taxonomy of IP address lookup algorithms , 2001, IEEE Netw..

[6]  Rina Panigrahy,et al.  Reducing TCAM power consumption and increasing throughput , 2002, Proceedings 10th Symposium on High Performance Interconnects.

[7]  Tzi-cker Chiueh,et al.  High-performance IP routing table lookup using CPU caching , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[8]  Mohammad Peyravian,et al.  Search engine implications for network processor efficiency , 2003, IEEE Netw..