DUOS - Simple dual TCAM architecture for routing tables with incremental update

Proceedings - IEEE Symposium on Computers and Communications

Volumn , Issue , 2010, Pages 503-508

  Mishra, Tania ^a   Sahni, Sartaj ^a  

^a University of Florida   (United States)

Author keywords

Consistent lookup; Incremental updates; IP routing table; Power

Indexed keywords

DATA-PLANE; INCREMENTAL UPDATES; IP ROUTING; LOOKUPS; MEMORY MANAGEMENT; POWER; POWER CONSUMPTION; ROUTING TABLE;

TELECOMMUNICATION NETWORKS;

TABLE LOOKUP;

EID: 77956520957     PISSN: 15301346     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISCC.2010.5546713     Document Type: Conference Paper

References (22)

1. M. Akhbarizadeh, M. Nourani, R. Panigrahy and S. Sharma, A TCAM-based parallel architecture for high-speed packet forwarding, IEEE Trans. on Computers, 56, 1, 2007, 58-2007.
2. Y. Chang, Power-efficient TCAM partitioning for IP lookups with incremental updates, ICOIN Proceedings, Lecture Notes in Computer Science, Springer Verlag, 3391, 2005, 531-540.
3. W. Lu and S. Sahni, Low Power TCAMs For Very Large Forwarding Tables, Proceedings of INFOCOM, 2008.
4. http://bgp.potaroo.net, 2007.
5. http://www.ripe.net/projects/ris/rawdata.html, 2008.
6. H. Liu, Routing Table Compaction in Ternary-CAM, IEEE Micro, 22, 3, 2002.
7. V.C. Ravikumar, R. N. Mahapatra, and L. N. Bhuyan, EaseCAM: An Energy And Storage Efficient TCAM-Based Router Architecture for IP Lookup, IEEE Transactions on Computers, 54, 5, May 2005, 521-533.
8. R. Draves, C. King, S. Venkatachary, and B.Zill, Constructing Optimal IP Routing Tables, Proceedings of INFOCOM, 1999.
9. M. Ruiz-Sanchez, E. Biersack, and W. Dabbous, Survey and taxonomy of IP address lookup algorithms, IEEE Network, 2001, 8-23.
10. S. Sahni, K. Kim, and H. Lu, Data structures for one-dimensional packet classification using most-specific-rule matching, International Journal on Foundations of Computer Science, 14, 3, 2003, 337-358.
11. C. A. Zukowski, and S. Wang, Use of Selective Precharge for Low-Power Content-Addressable Memories, IEEE International Symposium on Circuits and Systems, 1997.
12. N. Mohan, and M. Sachdev, Low Power Dual Matchline Ternary Content Addressable Memory, IEEE International Symposium on Circuits and Systems, 2004.
13. H. Miyatake, M. Tanaka, and Y.Mori, A design for high-speed lowpower CMOS fully parallel content addressable memory macros, IEEE Journal of Solid State Circuits, 36, 6, June 2001, 956-968.
14. C.-S. Lin, J.-C. Chang, and B.-D Liu, A low-power pre-computation based fully parallel content addressable memory, IEEE Journal of Solid State Circuits, 38, 4, April 2003, 654-662.
15. Z. Wang, H. Che, M. Kumar, and S.K. Das, CoPTUA: Consistent Policy Table Update Algorithm for TCAM without Locking, IEEE Transactions on Computers, 53, 12, December 2004, 1602-1614.
16. G.Wang and N. Tzeng TCAM-Based Forwarding Engine withMinimum Independent Prefix Set (MIPS) for Fast Updating, IEEE International Conference of Communications Volume 1, June 2006, 103-109
17. F. Zane, G. Narlikar and A. Basu, CoolCAMs: Power-Efficient TCAMs for Forwarding Engines, INFOCOM, 2003.
18. T. Mishra and S.Sahni, PETCAM - A Power Efficient TCAM For Forwarding Tables, IEEE Symposium on Computers and Communications, 2009
19. D. Shah and P. Gupta, Fast Updating Algorithms on TCAMs, IEEE Micro Volume 21, Issue 1, Jan-Feb 2001, 36-47
20. M. Akhbarizadeh and M. Nourani, Efficient Prefix Cache For Network Processors, IEEE Symp. on High Performance Interconnects, 41-46, 2004.
21. V. Srinivasan and G. Varghese, Faster IP lookups using controlled prefix expansion, SIGMETRICS, 1998.
22. K. Zheng, C. Hu, H. Lu and B. Liu, An Ultra High Throughput and Power Efficient TCAM Based IP Lookup Engine, Proceedings of INFOCOM, 2004