Power-efficient TCAMs for bursty access patterns

IEEE Micro

Volumn 25, Issue 4, 2005, Pages 64-72

  Wu, Weidong ^a   Shi, Jian ^a   Zuo, Ling ^a   Shi, Bingxin ^a  

^a HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CACHE MEMORY; COMPUTER ARCHITECTURE; COMPUTER HARDWARE; DATA COMMUNICATION SYSTEMS; ELECTRIC POWER SUPPLIES TO APPARATUS; MATHEMATICAL MODELS; ROUTERS; TABLE LOOKUP;

BUSRTY ACCESS PATTERNS; DYNAMIC ARCHITECTURE; ROUTING-TABLE LOOKUPS; STATIC ARCHITECTURE; TERNARY CONTENT ADDRESSABLE MEMORIES (TCAMS);

DIGITAL STORAGE;

EID: 25844527218     PISSN: 02721732     EISSN: None     Source Type: Journal    
DOI: 10.1109/MM.2005.72     Document Type: Article

References (11)

1. P. Gupta, B, Prabhakar, and S. Boyd, "Near-Optimal Routing Lookups with Bounded Worst Case Performance," Proc. 19th Ann. IEEE Infocom (Infocom 00), IEEE Press, 2000, pp. 1,184-1,192.
2. H. Liu, "Routing Table Compaction in Ternary CAM," IEEE Micro, vol. 22, no. 1, Jan.-Feb. 2002, pp. 58-64.
3. R. Panigrahy and S. Sharma, "Reducing TCAM Power Consumption and Increasing Throughput," Proc. 10th Symp. High-Performance Interconnects (HOTI 02), IEEE CS Press, 2002, pp. 107-112.
4. F. Zane, G. Nadikar, and A. Basu, "Cool-CAMs: Power-Efficient TCAMs for Forwarding Engines," Proc. 22th Ann. IEEE Infocom (Infocom 03), IEEE Press, 2003, pp. 42-52.
5. V.C. Ravikumar and R.N. Mahapatra, "TCAM Architecture for IP Lookup Using Prefixes Properties," IEEE Micro, vol. 24, no. 2, Mar.-Apr. 2004, pp. 60-69.
6. E. Kohler et al., "Observed Structure of Addresses in IP Traffic," Proc. 2nd Ann. ACM SIGCOMM Workshop on Internet Measurement, ACM Press, 2002, pp. 253-266.
7. F. Ergun et al., "A Dynamic Lookup Scheme for Bursty Access Patterns," Proc. 20th Ann. IEEE Infocom (Infocom 01), IEEE Press, pp. 1,444-1,453.
8. S. Lin and N. McKeown, "A Simulation Study of IP Switching," Proc. ACM SIGCOMM 97, ACM Press, 1997, pp. 15-24.
9. G. Cheung and S. McCanne, "Optimal Routing Table Design for IP Address Lookups Under Memory Constraints," Proc. 16th Ann. IEEE Infocom (Infocom 99), IEEE Press, 1999, pp. 1,437-1,444.
10. S. Sahni and K. Kim, "Efficient Dynamic Lookup for Bursty Access Patterns," Int'l J. Foundations of Computer Science, vol. 15, no. 4, Aug. 2004, pp. 567-592.
11. D. Shah and P. Gupta, "Fast Updating Algorithms for TCAMs," IEEE Micro, vol. 21, no. 1, Jan.-Feb. 2001, pp 36-47.