Self-adjusting binary search trees
Journal of the ACM (JACM)
Internetworking with TCP/IP: principles, protocols, and architecture
Internetworking with TCP/IP: principles, protocols, and architecture
On the balance property of Patricia tries: external path length viewpoint
Theoretical Computer Science
Skip lists: a probabilistic alternative to balanced trees
Communications of the ACM
Handbook of algorithms and data structures: in Pascal and C (2nd ed.)
Handbook of algorithms and data structures: in Pascal and C (2nd ed.)
Implementing dynamic minimal-prefix tries
Software—Practice & Experience
Interconnections: bridges and routers
Interconnections: bridges and routers
An efficient implementation of trie structures
Software—Practice & Experience
Comments on “On the balance property of Patricia tries: external path length viewpoint”
Theoretical Computer Science
Forwarding database overhead for inter-domain routing
ACM SIGCOMM Computer Communication Review
PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric
Journal of the ACM (JACM)
Do We Really Need to Balance Patricia Trees? (Extended Abstract)
ICALP '88 Proceedings of the 15th International Colloquium on Automata, Languages and Programming
Small forwarding tables for fast routing lookups
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
A simulation study of IP switching
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Corrections to “Routing on longest-matching prefixes”
IEEE/ACM Transactions on Networking (TON)
Cache Memory Design for Internet Processors
IEEE Micro
Neural Network Based Algorithms for IP Lookup and Packet Classification
EurAsia-ICT '02 Proceedings of the First EurAsian Conference on Information and Communication Technology
Performing IP Lookup on Very High Line Speed
EurAsia-ICT '02 Proceedings of the First EurAsian Conference on Information and Communication Technology
Dynamic Algorithms with Worst-Case Performance for Packet Classification
NETWORKING '00 Proceedings of the IFIP-TC6 / European Commission International Conference on Broadband Communications, High Performance Networking, and Performance of Communication Networks
Improving route lookup performance using network processor cache
Proceedings of the 2002 ACM/IEEE conference on Supercomputing
A Scalable and Small Forwarding Table for Fast IP Address Lookups
ICCNMC '01 Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01)
Simultaneous Multithreading-Based Routers
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
Efficient construction of multibit tries for IP lookup
IEEE/ACM Transactions on Networking (TON)
An O(log n) Dynamic Router-Table Design
IEEE Transactions on Computers
Fast prefix matching of bounded strings
Journal of Experimental Algorithmics (JEA)
O(\log n) Dynamic Router-Tables for Prefixes and Ranges
IEEE Transactions on Computers
Enhanced Interval Trees for Dynamic IP Router-Tables
IEEE Transactions on Computers
Prefix and Interval-Partitioned Dynamic IP Router-Tables
IEEE Transactions on Computers
A B-Tree Dynamic Router-Table Design
IEEE Transactions on Computers
Hardware-based IP routing using partitioned lookup table
IEEE/ACM Transactions on Networking (TON)
Routing Table Partitioning for Speedy Packet Lookups in Scalable Routers
IEEE Transactions on Parallel and Distributed Systems
An IP packet forwarding technique based on a new structure of lookup table
International Journal of Computers and Applications
Efficient Construction of Pipelined Multibit-Trie Router-Tables
IEEE Transactions on Computers
Aligned prefix caching based on singleton information
Computer Networks and ISDN Systems
Build shape-shifting tries for fast IP lookup in O(n) time
Computer Communications
A fast and scalable IPv4 and 6 address lookup algorithm
Computer Communications
Aligned prefix caching based on singleton information
Computer Networks: The International Journal of Computer and Telecommunications Networking
Compress the route table stored in TCAM by using memory filter
HPSR'09 Proceedings of the 15th international conference on High Performance Switching and Routing
Hardware implementation of an efficient internet protocol routing filter design
International Journal of Computers and Applications
A fast update scheme for TCAM-based IPv6 routing lookup architecture
APCC'09 Proceedings of the 15th Asia-Pacific conference on Communications
SUSE: superior storage-efficiency for routing tables through prefix transformation and aggregation
IEEE/ACM Transactions on Networking (TON)
DMP-tree: A dynamic M-way prefix tree data structure for strings matching
Computers and Electrical Engineering
Frequency-aware reconstruction of forwarding tables in name-based routing
Proceedings of the 5th International Conference on Future Internet Technologies
Routing with the clue (RC) over IP networks
CIMMACS'05 Proceedings of the 4th WSEAS international conference on Computational intelligence, man-machine systems and cybernetics
A distributed architecture of the indirect IP lookup scheme for high-speed routers
PDCAT'04 Proceedings of the 5th international conference on Parallel and Distributed Computing: applications and Technologies
TrieC: a high-speed IPv6 lookup with fast updates using network processor
ICESS'05 Proceedings of the Second international conference on Embedded Software and Systems
Exploiting a computation reuse cache to reduce energy in network processors
HiPEAC'05 Proceedings of the First international conference on High Performance Embedded Architectures and Compilers
Fast IP routing lookups for high performance routers
Computer Communications
Concise lookup tables for IPv4 and IPv6 longest prefix matching in scalable routers
IEEE/ACM Transactions on Networking (TON)
A high-throughput and high-capacity IPv6 routing lookup system
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.02 |