Scalable IP lookups using shape graphs

Proceedings - International Conference on Network Protocols, ICNP

Volumn , Issue , 2009, Pages 73-82

  Song, Haoyu ^a   Kodialam, Murali ^a   Hao, Fang ^a   Lakshman, T V ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BLOOM FILTERS; COMPACT DATA STRUCTURE; FORWARDING TABLES; GRAPH DATA; GRAPH-BASED; HIGH-SPEED MEMORY; IP LOOKUP; LOOKUPS; MEMORY FOOTPRINT; MEMORY USAGE; MULTI-BITS; MULTI-CORE PROCESSOR; MULTI-THREADING; NETWORK VIRTUALIZATION; ON CHIP MEMORY; ON-CHIP CACHE; PACKET PROCESSING; PACKET PROCESSING FUNCTIONS; SHAPE GRAPH; SOFTWARE ROUTERS; STRUCTURAL SIMILARITY; VIRTUALIZATIONS;

DATA STRUCTURES; PACKET NETWORKS; POWDERS; ROUTERS; ROUTING ALGORITHMS; SURFACE CHEMISTRY;

INTERNET PROTOCOLS;

EID: 71949096075     PISSN: 10921648     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICNP.2009.5339697     Document Type: Conference Paper

References (25)

1. F. Baboescu, D. M. Tullsen, G. Rosu, and S. Singh. A Tree Based Router Search Engine Architecture with Single Port. In ISCA, 2005.
2. B. Bloom. Space/Time Trade-offs in Hash Coding With Allowable Errors. Communications of the ACM, July 1970.
3. A. Broder and M. Mitzenmacher. Using Multiple Hash Functions to Improve IP Lookups. In IEEE INFOCOM, 2001.
4. F. Chang, K. Li, and W. chang Feng. Approximate caches for packet classification. In IEEE INFOCOM, 2004.
5. B. Chazelle, J. Kilian, R. Rubinfeld, and A. Tal. The bloomier filter: an efficient data structure for static support lookup tables. In ACM-SIAM Symposium on Discrete Algorithms (SODA), 2004.
6. M. Degermark, A. Brodnik, S. Carlsson, and S. Pink. Small Forwarding Tables for Fast Routing Lookups. In ACM SIGCOMM, 1997.
7. S. Dharmapurikar, P. Krishnamurthy, and D. Taylor. Longest Prefix Matching using Bloom Filters. In ACM SIGCOMM, 2003.
8. W. Eatherton, G. Varghese, and Z. Dittia. Tree Bitmap: hardware/software IP Lookups with Incremental Updates. ACM SIGCOMM Computer Communication Review, 2004.
9. J. Fu and J. Rexford. Efficient IP Address Lookup with a Shared Forwarding Table for Multiple Virtual Routers. In ACM CoNEXT, 2008.
10. F. Hao, M. Kodialam, T. V. Lakshman, and H. Song. Fast Multiset Membership Testing Using Combinatorial Bloom Filters. In IEEE INFOCOM, 2009.
11. J. Hasan and T. N. Vijaykumar. Dynamic Pipelining: Making IP Lookup Truly Scalable. In ACM SIGCOMM, 2005.
12. W. Jiang and V. K. Prasanna. Beyond TCAMs: An SRAM-based Multi-Pipeline Architecture for Terabit IP Lookup. In IEEE INFOCOM, 2008.
13. S. Kumar, M. Becchi, P. Crowley, and J. S. Turner. CAMP: Fast and Efficient IP Lookup Architecture. In ACM/IEEE ANCS, 2006.
14. S. Kumar, S. Dharmapurikar, F. Yu, P. Crowley, and J. Turner. Algorithms to Accelerate Multiple Regular Expressions Matching for Deep Packet Inspection. In ACM SIGCOMM, 2006.
15. S. Kumar, J. Turner, and P. Crowley. Peacock Hash: Fast and Updatable Hashing for High Performance Packet Processing Algorithms. In IEEE INFOCOM, 2008.
16. Y. Lu, B. Prabhakar, and F. Bonomi. Bloom filters: Design innovations and novel applications. Allerton Conference, 2005.
17. J. V. Lunteren. Searching Very Large Routing Tables in Wide Embedded Memory. In IEEE Globecom, 2001.
18. S. Nilsson and G. Karlsson. IP Address Lookup using LC-Tries. IEEE Journal on Selected Areas in Communications, June 1999.
19. H. Song, S. Dharmapurikar, J. S. Turner, and J. W. Lockwood. Fast Hash Table Lookup Using Extended Bloom Filter: an Aid to Network Processing. In ACM SIGCOMM, 2005.
20. H. Song, F. Hao, M. Kodialam, and T. Lakshman. IPv6 Lookups using Distributed and Load Balanced Bloom Filters for 100Gbps Core Router Line Cards. In IEEE INFOCOM, 2009.
21. H. Song, M. Kodialam, F. Hao, and T. Lakshman. Building Scalable Virtual Routers with Trie Braiding. In unpublished manuscript, 2009.
22. H. Song, J. Turner, and J. Lockwood. Shape Shifting Tries for Faster IP Lookup. In IEEE ICNP, 2005.
23. V. Srinivasan and G. Varghese. Faster IP Lookups Using Controlled Prefix Expansion. In ACM SIGMETRICS, 1998.
24. M. Waldvogel, G. Varghese, J. Turner, and B. Plattner. Scalable High Speed IP Routing Lookups. In ACM SIGCOMM, 1997.
25. M. Wang, S. Deering, T. Hain, and L. Dunn. Non-random Generator for IPv6 Tables. 12th IEEE HotInterconnects, 2004.