Scalable high-speed prefix matching
ACM Transactions on Computer Systems (TOCS)
Efficient Group Coordination in Multicast Trees
The Journal of Supercomputing
Performance Prediction Methods for Address Lookup Algorithms of IP Routers
ICOIN '02 Revised Papers from the International Conference on Information Networking, Wireless Communications Technologies and Network Applications-Part I
NETWORKING '02 Proceedings of the Second International IFIP-TC6 Networking Conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; and Mobile and Wireless Communications
Rationalizing key design decisions in the ATM user plane
ACM SIGCOMM Computer Communication Review
A TCAM based routing lookup system
ICCC '02 Proceedings of the 15th international conference on Computer communication
A pipelined memory architecture for high throughput network processors
Proceedings of the 30th annual international symposium on Computer architecture
The impact of address allocation and routing on the structure and implementation of routing tables
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Utilizing Formal Assertions for System Design of Network Processors
Proceedings of the conference on Design, automation and test in Europe - Volume 3
A hybrid architecture for cost-effective on-demand media streaming
Computer Networks: The International Journal of Computer and Telecommunications Networking
Parallelism versus memory allocation in pipelined router forwarding engines
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
O(\log n) Dynamic Router-Tables for Prefixes and Ranges
IEEE Transactions on Computers
Computer Networks: The International Journal of Computer and Telecommunications Networking
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 Tree Based Router Search Engine Architecture with Single Port Memories
Proceedings of the 32nd annual international symposium on Computer Architecture
A High Throughput String Matching Architecture for Intrusion Detection and Prevention
Proceedings of the 32nd annual international symposium on Computer Architecture
A B-Tree Dynamic Router-Table Design
IEEE Transactions on Computers
An On-Chip IP Address Lookup Algorithm
IEEE Transactions on Computers
An automated exploration framework for FPGA-based soft multiprocessor systems
CODES+ISSS '05 Proceedings of the 3rd IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis
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)
Scalable, memory efficient, high-speed IP lookup algorithms
IEEE/ACM Transactions on Networking (TON)
Overcoming the memory wall in packet processing: hammers or ladders?
Proceedings of the 2005 ACM symposium on Architecture for networking and communications systems
A novel reconfigurable hardware architecture for IP address lookup
Proceedings of the 2005 ACM symposium on Architecture for networking and communications systems
Conflict detection and resolution in two-dimensional prefix router tables
IEEE/ACM Transactions on Networking (TON)
High-performance IPv6 forwarding algorithm for multi-core and multithreaded network processor
Proceedings of the eleventh ACM SIGPLAN symposium on Principles and practice of parallel programming
Routing Table Partitioning for Speedy Packet Lookups in Scalable Routers
IEEE Transactions on Parallel and Distributed Systems
Bit-split string-matching engines for intrusion detection and prevention
ACM Transactions on Architecture and Code Optimization (TACO)
A nonredundant ternary CAM circuit for network search engines
IEEE Transactions on Very Large Scale Integration (VLSI) 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
High speed routers design using reconfigurable technology
MS'06 Proceedings of the 17th IASTED international conference on Modelling and simulation
Efficient Construction of Pipelined Multibit-Trie Router-Tables
IEEE Transactions on Computers
A TCAM-Based Parallel Architecture for High-Speed Packet Forwarding
IEEE Transactions on Computers
Aligned prefix caching based on singleton information
Computer Networks and ISDN Systems
Fast binary and multiway prefix searches for packet forwarding
Computer Networks: The International Journal of Computer and Telecommunications Networking
Parallel tree search: An algorithmic approach for multi-field packet classification
Computer Communications
High-speed routers design using data stream distributor unit
Journal of Network and Computer Applications - Special issue: Network and information security: A computational intelligence approach
A lookup algorithm based on multiple tables for high-speed routers
Journal of High Speed Networks
Optimizing software cache performance of packet processing applications
Proceedings of the 2007 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systems
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
O(logW) multidimensional packet classification
IEEE/ACM Transactions on Networking (TON)
Connecting IPvX Networks Over IPvY with a P2P Method
Journal of Network and Systems Management
Build shape-shifting tries for fast IP lookup in O(n) time
Computer Communications
A cache-based internet protocol address lookup architecture
Computer Networks: The International Journal of Computer and Telecommunications Networking
Efficient Prefix Updates for IP Router Using Lexicographic Ordering and Updatable Address Set
IEEE Transactions on Computers
Multi-terabit ip lookup using parallel bidirectional pipelines
Proceedings of the 5th conference on Computing frontiers
Formulating and implementing profiling over adaptive ranges
ACM Transactions on Architecture and Code Optimization (TACO)
An efficient approach to on-chip logic minimization
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Microprocessors & Microsystems
Scheduling of Updates in an IP Forwarding Engine with Partitioned Prefix Tables
ICCSA '08 Proceedings of the international conference on Computational Science and Its Applications, Part II
Scalable packet classification with controlled cross-producting
Computer Networks: The International Journal of Computer and Telecommunications Networking
Efficient IP-address lookup with a shared forwarding table for multiple virtual routers
CoNEXT '08 Proceedings of the 2008 ACM CoNEXT Conference
Succinct representation of static packet classifiers
IEEE/ACM Transactions on Networking (TON)
Sequence-preserving parallel IP lookup using multiple SRAM-based pipelines
Journal of Parallel and Distributed Computing
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
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
Aligned prefix caching based on singleton information
Computer Networks: The International Journal of Computer and Telecommunications Networking
Frugal IP lookup based on a parallel search
HPSR'09 Proceedings of the 15th international conference on High Performance Switching and Routing
Range trees with variable length comparisons
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
Update-aware controlled prefix expansion for fast IP lookups
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
Using bit selection to do routing table lookup
FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
An efficient IP lookup architecture with fast update using single-match TCAMs
WWIC'08 Proceedings of the 6th international conference on Wired/wireless internet communications
Reducing dynamic power dissipation in pipelined forwarding engines
ICCD'09 Proceedings of the 2009 IEEE international conference on Computer design
SUSE: superior storage-efficiency for routing tables through prefix transformation and aggregation
IEEE/ACM Transactions on Networking (TON)
Range Tries for scalable address lookup
Proceedings of the 5th ACM/IEEE Symposium on Architectures for Networking and Communications Systems
Low-power TCAMs for very large forwarding tables
IEEE/ACM Transactions on Networking (TON)
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
ERID: edge router identification for fast forwarding packet in BGP domain
ICHIT'11 Proceedings of the 5th international conference on Convergence and hybrid information technology
Design of embedded TCAM based longest prefix match search engine
Microprocessors & Microsystems
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 efficient IP address lookup algorithm based on a small balanced tree using entry reduction
Computer Networks: The International Journal of Computer and Telecommunications Networking
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
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
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
Providing reliable IPv6 access service based on overlay network
OTM'06 Proceedings of the 2006 international conference on On the Move to Meaningful Internet Systems: AWeSOMe, CAMS, COMINF, IS, KSinBIT, MIOS-CIAO, MONET - Volume Part II
You can get there from here: routing in the internet
CAAN'04 Proceedings of the First international conference on Combinatorial and Algorithmic Aspects of Networking
Reorder density (RD): a formal, comprehensive metric for packet reordering
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
Network of shortcuts: an adaptive data structure for tree-based search methods
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
A multizone pipelined cache for IP routing
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
Distilling router data analysis for faster and simpler dynamic IP lookup algorithms
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
SYN flooding attack detection by TCP handshake anomalies
Security and Communication Networks
Next hop of strict partial order for NSFIB construction & aggregation
Proceedings of the 2012 IEEE 20th International Workshop on Quality of Service
A comparative review of scalable lookup algorithms for IPv6
Computer Networks: The International Journal of Computer and Telecommunications Networking
DXR: towards a billion routing lookups per second in software
ACM SIGCOMM Computer Communication Review
Managing hybrid packet filter's specifications
International Journal of Security and Networks
On the use of anonymized trace data for performance evaluation in IP routers
APNOMS'07 Proceedings of the 10th Asia-Pacific conference on Network Operations and Management Symposium: managing next generation networks and services
Towards TCAM-based scalable virtual routers
Proceedings of the 8th international conference on Emerging networking experiments and technologies
Detecting spammers via aggregated historical data set
NSS'12 Proceedings of the 6th international conference on Network and System Security
GAMT: a fast and scalable IP lookup engine for GPU-based software routers
ANCS '13 Proceedings of the ninth ACM/IEEE symposium on Architectures for networking and communications systems
A memory-efficient parallel routing lookup model with fast updates
Computer Communications
| Hi-index | 0.03 |
Due to the rapid growth of traffic in the Internet, backbone links of several gigabits per second are commonly deployed. To handle gigabit-per-second traffic rates, the backbone routers must be able to forward millions of packets per second on each of their ports. Fast IP address lookup in the routers, which uses the packet's destination address to determine for each packet the next hop, is therefore crucial to achieve the packet forwarding rates required. IP address lookup is difficult because it requires a longest matching prefix search. In the last couple of years, various algorithms for high-performance IP address lookup have been proposed. We present a survey of state-of-the-art IP address lookup algorithms and compare their performance in terms of lookup speed, scalability, and update overhead