Analysis and simulation of a fair queueing algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Introduction to algorithms
Interconnections: bridges and routers
Interconnections: bridges and routers
TCP/IP illustrated (vol. 1): the protocols
TCP/IP illustrated (vol. 1): the protocols
Alpha AXP architecture reference manual (2nd ed.)
Alpha AXP architecture reference manual (2nd ed.)
aItPm: a strategy for integrating IP with ATM
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Trading packet headers for packet processing
IEEE/ACM Transactions on Networking (TON)
Efficient fair queueing using deficit round-robin
IEEE/ACM Transactions on Networking (TON)
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
Scalable high speed IP routing lookups
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Tiny Tera: A Packet Switch Core
IEEE Micro
Fast address look-up for internet routers
BC '98 Proceedings of the IFIP TC6/WG6.2 Fourth International Conference on Broadband Communications: The future of telecommunications
Design of a Gigabit ATM Switch
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
IP switching and gigabit routers
IEEE Communications Magazine
IP lookups using multiway and multicolumn search
IEEE/ACM Transactions on Networking (TON)
IP multicast channels: EXPRESS support for large-scale single-source applications
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Memory-efficient state lookups with fast updates
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Performance modeling for fast IP lookups
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Building a robust software-based router using network processors
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Scalable high-speed prefix matching
ACM Transactions on Computer Systems (TOCS)
Fast Updating Algorithms for TCAMs
IEEE Micro
Routing Table Compaction in Ternary CAM
IEEE Micro
A Fast Packet Classification by Using Enhanced Tuple Pruning
PIHSN '02 Proceedings of the 7th IFIP/IEEE International Workshop on Protocols for High Speed Networks
A Fast and Updatable IP Address Lookup Scheme
ICCNMC '01 Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01)
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)
A pipelined memory architecture for high throughput network processors
Proceedings of the 30th annual international symposium on Computer architecture
Efficient construction of multibit tries for IP lookup
IEEE/ACM Transactions on Networking (TON)
IPStash: a Power-Efficient Memory Architecture for IP-lookup
Proceedings of the 36th annual IEEE/ACM International Symposium on Microarchitecture
A simple and scalable algorithm for the IP address lookup problem
Fundamenta Informaticae - Special issue on computing patterns in strings
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
EaseCAM: An Energy and Storage Efficient TCAM-Based Router Architecture for IP Lookup
IEEE Transactions on Computers
Prefix and Interval-Partitioned Dynamic IP Router-Tables
IEEE Transactions on Computers
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
Fast incremental updates for pipelined forwarding engines
IEEE/ACM Transactions on Networking (TON)
Fast hash table lookup using extended bloom filter: an aid to network processing
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Algorithms for advanced packet classification with ternary CAMs
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Dynamic pipelining: making IP-lookup truly scalable
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Building extensible routers using network processors: Research Articles
Software—Practice & Experience
Hardware-based IP routing using partitioned lookup table
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
Profiling over Adaptive Ranges
Proceedings of the International Symposium on Code Generation and Optimization
Bit-split string-matching engines for intrusion detection and prevention
ACM Transactions on Architecture and Code Optimization (TACO)
Packet classification using diagonal-based tuple space search
Computer Networks: The International Journal of Computer and Telecommunications Networking
An IP packet forwarding technique based on a new structure of lookup table
International Journal of Computers and Applications
Packet classification using coarse-grained tuple spaces
Proceedings of the 2006 ACM/IEEE symposium on Architecture for networking and communications systems
CAMP: fast and efficient IP lookup architecture
Proceedings of the 2006 ACM/IEEE symposium on Architecture for networking and communications systems
Efficient Construction of Pipelined Multibit-Trie Router-Tables
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
A lookup algorithm based on multiple tables for high-speed routers
Journal of High Speed Networks
Dynamic Segment Trees for Ranges and Prefixes
IEEE Transactions on Computers
Efficient IP table lookup via adaptive stratified trees with selective reconstructions
Journal of Experimental Algorithmics (JEA)
O(logW) multidimensional packet classification
IEEE/ACM Transactions on Networking (TON)
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)
Build shape-shifting tries for fast IP lookup in O(n) time
Computer Communications
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)
A scalable, commodity data center network architecture
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
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 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 fast and scalable IPv4 and 6 address lookup algorithm
Computer Communications
Simple and fast IP lookups using binomial spanning trees
Computer Communications
Packet classification using diagonal-based tuple space search
Computer Networks: The International Journal of Computer and Telecommunications Networking
Aligned prefix caching based on singleton information
Computer Networks: The International Journal of Computer and Telecommunications Networking
Implementation of a parallel-search trie-based scheme for fast IP lookup
CSNA '07 Proceedings of the IASTED International Conference on Communication Systems, Networks, and Applications
Scalable packet classification for network intrusion detection
CSS '07 Proceedings of the Fifth IASTED International Conference on Circuits, Signals and Systems
A perfect-hashing scheme for fast IP lookup
ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 1
Flashlook: 100-Gbps hash-tuned route lookup architecture
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
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
A study on optimal fast handover scheme in fast handover for mobile IPv6 (FMIPv6) networks
ICUCT'06 Proceedings of the 1st international conference on Ubiquitous convergence technology
Experimental evaluations of algorithms for IP table minimization
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
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)
Leaping multiple headers in a single bound: wire-speed parsing using the kangaroo system
INFOCOM'10 Proceedings of the 29th conference on Information communications
Range Tries for scalable address lookup
Proceedings of the 5th ACM/IEEE Symposium on Architectures for Networking and Communications Systems
Progressive hashing for packet processing using set associative memory
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
Memory-efficient and scalable virtual routers using FPGA
Proceedings of the 19th ACM/SIGDA international symposium on Field programmable gate arrays
The power of one move: hashing schemes for hardware
IEEE/ACM Transactions on Networking (TON)
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
Two-level cache architecture to reduce memory accesses for IP lookups
Proceedings of the 23rd International Teletraffic Congress
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
High-performance IP forwarding with efficient routing-table update
Computer Communications
Concise lookup tables for IPv4 and IPv6 longest prefix matching in scalable routers
IEEE/ACM Transactions on Networking (TON)
FlashTrie: beyond 100-Gb/s IP route lookup using hash-based prefix-compressed trie
IEEE/ACM Transactions on Networking (TON)
A Simple and Scalable Algorithm for the IP Address Lookup Problem
Fundamenta Informaticae - Computing Patterns in Strings
Managing hybrid packet filter's specifications
International Journal of Security and Networks
LOUP: the principles and practice of intra-domain route dissemination
nsdi'13 Proceedings of the 10th USENIX conference on Networked Systems Design and Implementation
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 |
Internet (IP) address lookup is a major bottleneck in high-performance routers. IP address lookup is challenging because it requires a longest matching prefix lookup. It is compounded by increasing routing table sizes, increased traffic, higher-speed links, and the migration to 128-bit IPv6 addresses. We describe how IP lookups and updates can be made faster using a set of of transformation techniques. Our main technique, controlled prefix expansion, transforms a set of prefixes into an equivalent set with fewer prefix lengths. In addition, we use optimization techniques based on dynamic programming, and local transformations of data structures to improve cache behavior. When applied to trie search, our techniques provide a range of algorithms (Expanded Tries) whose performance can be tuned. For example, using a processor with 1MB of L2 cache, search of the MaeEast database containing 38000 prefixes can be done in 3 L2 cache accesses. On a 300MHz Pentium II which takes 4 cycles for accessing the first word of the L2 cacheline, this algorithm has a worst-case search time of 180 nsec., a worst-case insert/delete time of 2.5 msec., and an average insert/delete time of 4 usec. Expanded tries provide faster search and faster insert/delete times than earlier lookup algirthms. When applied to Binary Search on Levels, our techniques improve worst-case search times by nearly a factor of 2 (using twice as much storage) for the MaeEast database. Our approach to algorithm design is based on measurements using the VTune tool on a Pentium to obtain dynamic clock cycle counts. Our techniques also apply to similar address lookup problems in other network protocols.