Search results for "address lookups"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
2	Kieran McLaughlin, Sakir Sezer	High-Speed IP Address Lookups Using Hardware Based Tree Structures.	AHS	2007	DBLP DOI BibTeX RDF
2	Patrick C. McGeer, Kenneth L. McMillan, Alexander Saldanha, Alberto L. Sangiovanni-Vincentelli, Patrick Scaglia	Fast discrete function evaluation using decision diagrams.	ICCAD	1995	DBLP DOI BibTeX RDF	address lookups, cycle-based logic simulation, decision-diagram based function evaluation, fast discrete function evaluation, latch ports, orders-of-magnitude potential speedup, output ports, logic design, memory hierarchy, logic CAD, decision theory, circuit analysis computing, memory bandwidth, table lookup, digital circuits, logic simulators, logic function, function evaluation, multi-valued decision diagrams
1	Rajendra Shinde, Ashish Goel, Pankaj Gupta, Debojyoti Dutta	Similarity search and locality sensitive hashing using ternary content addressable memories.	SIGMOD Conference	2010	DBLP DOI BibTeX RDF	tcam, similarity search, nearest neighbor search, locality sensitive hashing
1	Mahmoud Hasanloo, Ali Amiri 0002, Mahmood Fathy	A High Performance Parallel IP Lookup Technique Based on Multiprocessor Organization and CREW PRAM.	Asia International Conference on Modelling and Simulation	2008	DBLP DOI BibTeX RDF	Parallel Processing, IP lookup, Router Architecture
1	Deuk-hyoung Park, Dong-ho Cho	Parallel table-based IP address lookups.	IEEE Communications Letters	2006	DBLP DOI BibTeX RDF
1	Yeim-Kuan Chang, Yung-Chieh Lin	Dynamic Routing Tables Using Simple Balanced Search Trees.	ICOIN	2006	DBLP DOI BibTeX RDF
1	Kieran McLaughlin, Stephen O'Kane, Sakir Sezer	Implementing High Speed IP Address Lookups in Hardware.	AICT/SAPIR/ELETE	2005	DBLP DOI BibTeX RDF
1	Rama Sangireddy, Natsuhiko Futamura, Srinivas Aluru, Arun K. Somani	Scalable, memory efficient, high-speed IP lookup algorithms.	IEEE/ACM Trans. Netw.	2005	DBLP DOI BibTeX RDF	IP packet forwarding, address lookups, scalability, longest prefix matching, routing tables
1	K. Venkatesh, S. Aravind, R. Ganapath, T. Srinivasan	A High Performance Parallel IP Lookup Technique Using Distibuted Memory Organization.	ITCC	2004	DBLP DOI BibTeX RDF
1	Sartaj Sahni, Kun Suk Kim	Efficient construction of multibit tries for IP lookup.	IEEE/ACM Trans. Netw.	2003	DBLP DOI BibTeX RDF	multibit trie, dynamic programming, packet routing, longest matching prefix, controlled prefix expansion
1	Sartaj Sahni, Kun Suk Kim	Efficient Construction of Variable-Stride Multibit Tries for IP Lookup. (PDF / PS)	SAINT	2002	DBLP DOI BibTeX RDF	multibit trie, dynamic programming, Packet routing, longest matching prefix, controlled prefix expansion
1	Sartaj Sahni, Kun Suk Kim	Efficient Construction of Fixed-Stride Multibit Tries for IP Lookup.	FTDCS	2001	DBLP DOI BibTeX RDF	multibit trie, dynamic programming, Packet routing, longest matching prefix, controlled prefix expansion
1	Venkatachary Srinivasan, George Varghese	Fast Address Lookups Using Controlled Prefix Expansion.	ACM Trans. Comput. Syst.	1999	DBLP DOI BibTeX RDF	Internet address lookup, binary search on levels, expanded tries, multibit tries, router preformance, longest-prefix match, controlled prefix expansion
1	Gene Cheung, Steven McCanne	Optimal Routing Table Design for IP Address Lookups Under Memory Constraints.	INFOCOM	1999	DBLP BibTeX RDF