Performance modeling for fast IP lookups
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Scalable high-speed prefix matching
ACM Transactions on Computer Systems (TOCS)
Pop-level and access-link-level traffic dynamics in a tier-1 POP
IMW '01 Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement
Burst tries: a fast, efficient data structure for string keys
ACM Transactions on Information Systems (TOIS)
Content management on server farm with layer-7 routing
Proceedings of the 2002 ACM symposium on Applied computing
Fast Updating Algorithms for TCAMs
IEEE Micro
Routing Table Compaction in Ternary CAM
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
A TCAM based routing lookup system
ICCC '02 Proceedings of the 15th international conference on Computer communication
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
IPStash: a Power-Efficient Memory Architecture for IP-lookup
Proceedings of the 36th annual IEEE/ACM International Symposium on Microarchitecture
Fast prefix matching of bounded strings
Journal of Experimental Algorithmics (JEA)
Profiling and mapping of parallel workloads on network processors
Proceedings of the 2005 ACM symposium on Applied computing
An On-Chip IP Address Lookup Algorithm
IEEE Transactions on Computers
Fast incremental updates for pipelined forwarding engines
IEEE/ACM Transactions on Networking (TON)
A heterogeneously segmented cache architecture for a packet forwarding engine
Proceedings of the 19th annual international conference on Supercomputing
Hardware-based IP routing using partitioned lookup table
IEEE/ACM Transactions on Networking (TON)
Load balancing for parallel forwarding
IEEE/ACM Transactions on Networking (TON)
Scalable, memory efficient, high-speed IP lookup algorithms
IEEE/ACM Transactions on Networking (TON)
A novel reconfigurable hardware architecture for IP address lookup
Proceedings of the 2005 ACM symposium on Architecture for networking and communications systems
On the average depth of asymmetric LC-tries
Information Processing Letters
Level compressed DAGs for lookup tables
Computer Networks: The International Journal of Computer and Telecommunications Networking
Routing Table Partitioning for Speedy Packet Lookups in Scalable Routers
IEEE Transactions on Parallel and Distributed Systems
Two-level mapping based cache index selection for packet forwarding engines
Proceedings of the 15th international conference on Parallel architectures and compilation techniques
An IP packet forwarding technique based on a new structure of lookup table
International Journal of Computers and Applications
A TCAM-based distributed parallel IP lookup scheme and performance analysis
IEEE/ACM Transactions on Networking (TON)
Fast binary and multiway prefix searches for packet forwarding
Computer Networks: The International Journal of Computer and Telecommunications Networking
System support for web hosting services on server clusters
Computers and Electrical Engineering
Dynamic Segment Trees for Ranges and Prefixes
IEEE Transactions on Computers
A longest prefix first search tree for IP lookup
Computer Networks: The International Journal of Computer and Telecommunications Networking
Efficient IP table lookup via adaptive stratified trees with selective reconstructions
Journal of Experimental Algorithmics (JEA)
Partial fillup and search time in LC tries
ACM Transactions on Algorithms (TALG)
Efficient IP forwarding engine with incremental update
Journal of High Speed Networks
Performance improvement of two-dimensional packet classification by filter rephrasing
IEEE/ACM Transactions on Networking (TON)
Scalable packet classification by TCAM entry encryption algorithm
Journal of High Speed Networks
Microprocessors & Microsystems
Information filtering and query indexing for an information retrieval model
ACM Transactions on Information Systems (TOIS)
IP Routing table compaction and sampling schemes to enhance TCAM cache performance
Journal of Systems Architecture: the EUROMICRO Journal
Analytic modeling of network processors for parallel workload mapping
ACM Transactions on Embedded Computing Systems (TECS)
Efficient IP-address lookup with a shared forwarding table for multiple virtual routers
CoNEXT '08 Proceedings of the 2008 ACM CoNEXT Conference
A fast and secure method for anonymizing packet traffic and call traces
ICCOM'08 Proceedings of the 12th WSEAS international conference on Communications
A Hybrid IP Forwarding Engine with High Performance and Low Power
ICCSA '09 Proceedings of the International Conference on Computational Science and Its Applications: Part II
A Pipelined IP Address Lookup Module for 100 Gbps Line Rates and beyond
EUNICE '09 Proceedings of the 15th Open European Summer School and IFIP TC6.6 Workshop on The Internet of the Future
High-speed IP address lookup using balanced multi-way trees
Computer Communications
A fast and scalable IPv4 and 6 address lookup algorithm
Computer Communications
Simple and fast IP lookups using binomial spanning trees
Computer Communications
Level compressed DAGs for lookup tables
Computer Networks: The International Journal of Computer and Telecommunications Networking
Analysis of network processing workloads
Journal of Systems Architecture: the EUROMICRO Journal
Trie Partitioning in distributed PC based routers
COMSNETS'09 Proceedings of the First international conference on COMmunication Systems And NETworks
On the average depth of asymmetric LC-tries
Information Processing Letters
Frugal IP lookup based on a parallel search
HPSR'09 Proceedings of the 15th international conference on High Performance Switching and Routing
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
On designing fast nonuniformly distributed IP address lookup hashing algorithms
IEEE/ACM Transactions on Networking (TON)
Binary search on prefix covered levels for IP address lookup
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Architecture for internal communication in multi-gigabit IP routers
ICCS'03 Proceedings of the 2003 international conference on Computational science: PartIII
Experimental evaluations of algorithms for IP table minimization
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Using bit selection to do routing table lookup
FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
Compressed dynamic tries with applications to LZ-compression in sublinear time and space
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
The CPBT: a method for searching the prefixes using coded prefixes in B-tree
NETWORKING'08 Proceedings of the 7th international IFIP-TC6 networking conference on AdHoc and sensor networks, wireless networks, next generation internet
SUSE: superior storage-efficiency for routing tables through prefix transformation and aggregation
IEEE/ACM Transactions on Networking (TON)
New methods for compression of MP double array by compact management of suffixes
Information Processing and Management: an International Journal
Building scalable virtual routers with trie braiding
INFOCOM'10 Proceedings of the 29th conference on Information communications
A new IP lookup cache for high performance IP routers
Proceedings of the 47th Design Automation Conference
Range Tries for scalable address lookup
Proceedings of the 5th ACM/IEEE Symposium on Architectures for Networking and Communications Systems
Advanced hashing schemes for packet forwarding using set associative memory architectures
Journal of Parallel and Distributed Computing
Don't-care gating (DCG) TCAM design used in network routing table
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Indexing methods for approximate dictionary searching: Comparative analysis
Journal of Experimental Algorithmics (JEA)
ICCC'11 Proceedings of the 2011 international conference on Computers and computing
A novel scalable IPv6 lookup scheme using compressed pipelined tries
NETWORKING'11 Proceedings of the 10th international IFIP TC 6 conference on Networking - Volume Part I
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
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
An in-order SMT architecture with static resource partitioning for consumer applications
PDCAT'04 Proceedings of the 5th international conference on Parallel and Distributed Computing: applications and Technologies
An efficient IP address lookup algorithm based on a small balanced tree using entry reduction
Computer Networks: The International Journal of Computer and Telecommunications Networking
Power-Efficient TCAM partitioning for IP lookups with incremental updates
ICOIN'05 Proceedings of the 2005 international conference on Information Networking: convergence in broadband and mobile networking
Analysis of a class of tries with adaptive multi-digit branching
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Dynamic routing tables using simple balanced search trees
ICOIN'06 Proceedings of the 2006 international conference on Information Networking: advances in Data Communications and Wireless Networks
High-performance IP forwarding with efficient routing-table update
Computer Communications
A fast string search algorithm for deep packet classification
Computer Communications
A comparative review of scalable lookup algorithms for IPv6
Computer Networks: The International Journal of Computer and Telecommunications Networking
Concise lookup tables for IPv4 and IPv6 longest prefix matching in scalable routers
IEEE/ACM Transactions on Networking (TON)
DXR: towards a billion routing lookups per second in software
ACM SIGCOMM Computer Communication Review
Compressing IP forwarding tables for fun and profit
Proceedings of the 11th ACM Workshop on Hot Topics in Networks
On pending interest table in named data networking
Proceedings of the eighth ACM/IEEE symposium on Architectures for networking and communications systems
Efficient trie braiding in scalable virtual routers
IEEE/ACM Transactions on Networking (TON)
Compressing IP forwarding tables: towards entropy bounds and beyond
Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM
Hi-index | 0.08 |
There has been a notable interest in the organization of routing information to enable fast lookup of IP addresses. The interest is primarily motivated by the goal of building multigigabit routers for the Internet, without having to rely on multilayer switching techniques. We address this problem by using an LC-trie, a trie structure with combined path and level compression. This data structure enables us to build efficient, compact, and easily searchable implementations of an IP-routing table. The structure can store both unicast and multicast addresses with the same average search times. The search depth increases as Θ(log log n) with the number of entries in the table for a large class of distributions, and it is independent of the length of the addresses. A node in the trie can be coded with four bytes. Only the size of the base vector, which contains the search strings, grows linearly with the length of the addresses when extended from 4 to 16 bytes, as mandated by the shift from IP version 4 to IP version 6. We present the basic structure as well as an adaptive version that roughly doubles the number of lookups/s. More general classifications of packets that are needed for link sharing, quality-of-service provisioning, and multicast and multipath routing are also discussed. Our experimental results compare favorably with those reported previously in the research literature