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
aItPm: a strategy for integrating IP with ATM
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Efficient fair queueing using deficit round robin
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)
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
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
IP switching and gigabit routers
IEEE Communications Magazine
Fast and scalable layer four switching
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Router plugins: a software architecture for next generation routers
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Packet classification on multiple fields
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Router plugins: a software architecture for next-generation routers
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Cache Memory Design for Internet Processors
IEEE Micro
Performing IP Lookup on Very High Line Speed
EurAsia-ICT '02 Proceedings of the First EurAsian Conference on Information and Communication Technology
Adaptive Algorithms for Cache-Efficient Trie Search
ALENEX '99 Selected papers from the International Workshop on Algorithm Engineering and Experimentation
Layered Modeling of Hardware and Software, with Application to a LAN Extension Router
TOOLS '00 Proceedings of the 11th International Conference on Computer Performance Evaluation: Modelling Techniques and Tools
IP Address Lookup Made Fast and Simple
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Improving route lookup performance using network processor cache
Proceedings of the 2002 ACM/IEEE conference on Supercomputing
Longest prefix matching using bloom filters
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
A new hardware algorithm for fast IP routing targeting programmable routers
Network control and engineering for Qos, security and mobility II
Multiway range trees: scalable IP lookup with fast updates
Computer Networks: The International Journal of Computer and Telecommunications Networking
Tree bitmap: hardware/software IP lookups with incremental updates
ACM SIGCOMM Computer Communication Review
NPSE: A High Performance Network Packet Search Engine
DATE '03 Proceedings of the conference on Design, Automation and Test in Europe: Designers' Forum - Volume 2
On the number of full levels in tries
Random Structures & Algorithms
Efficient packet classification for network intrusion detection using FPGA
Proceedings of the 2005 ACM/SIGDA 13th international symposium on Field-programmable gate arrays
Packet classification in large ISPs: design and evaluation of decision tree classifiers
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Adaptive data structures for IP lookups
Journal of Experimental Algorithmics (JEA)
Towards a complete characterization of tries
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Scalable, memory efficient, high-speed IP lookup algorithms
IEEE/ACM Transactions on Networking (TON)
Cellular universal IP: a low delay mobility scheme based on universal IP addressing
MSWiM '05 Proceedings of the 8th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems
SSA: a power and memory efficient scheme to multi-match packet classification
Proceedings of the 2005 ACM symposium on Architecture for networking and communications systems
Level compressed DAGs for lookup tables
Computer Networks: The International Journal of Computer and Telecommunications Networking
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
Chisel: A Storage-efficient, Collision-free Hash-based Network Processing Architecture
Proceedings of the 33rd annual international symposium on Computer Architecture
An IP packet forwarding technique based on a new structure of lookup table
International Journal of Computers and Applications
Longest prefix matching using bloom filters
IEEE/ACM Transactions on Networking (TON)
Partial fillup and search time in LC tries
ACM Transactions on Algorithms (TALG)
Adaptive rate control (ARC) with erlangian traffics over resilient packet ring (RPR) network
EHAC'06 Proceedings of the 5th WSEAS International Conference on Electronics, Hardware, Wireless and Optical Communications
IP Routing table compaction and sampling schemes to enhance TCAM cache performance
Journal of Systems Architecture: the EUROMICRO Journal
New Data Structures for IP Lookup and Conflict Detection
Algorithmics of Large and Complex Networks
High-speed IP address lookup using balanced multi-way trees
Computer Communications
Level compressed DAGs for lookup tables
Computer Networks: The International Journal of Computer and Telecommunications Networking
Trie Partitioning in distributed PC based routers
COMSNETS'09 Proceedings of the First international conference on COMmunication Systems And NETworks
Frugal IP lookup based on a parallel search
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)
XOR-based schemes for fast parallel IP lookups
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
The bitmap Trie for fast prefix lookup
HSI'03 Proceedings of the 2nd international conference on Human.society@internet
Using bit selection to do routing table lookup
FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
A prefix-distribution adaptive scheme for routing lookup acceleration
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Building scalable virtual routers with trie braiding
INFOCOM'10 Proceedings of the 29th conference on Information communications
DMP-tree: A dynamic M-way prefix tree data structure for strings matching
Computers and Electrical Engineering
AM-Trie: a high-speed parallel packet classification algorithm for network processor
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part IV
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
Fast IP routing lookups for high performance routers
Computer Communications
Approaching optimal compression with fast update for large scale routing tables
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
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
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
Efficient Two Dimensional-IP routing: An incremental deployment design
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
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 can be made faster using a new technique called controlled prefix expansion. Controlled prefix expansion, together with optimization techniques based on dynamic programming, can be used to improve the speed of the best known IP lookup algorithms by at least a factor of two. When applied to trie search, our techniques provide a range of algorithms whose performance can be tuned. For example, with 1 MB of L2 cache, trie search of the MaeEast database with 38,000 prefixes can be done in a worst case search time of 181 nsec, a worst case insert/delete time of 2.5 msec, and an average insert/delete time of 4 usec. Our actual experiments used 512 KB L2 cache to obtain a worst-case search time of 226 nsec, a worst-case worst case insert/delete time of 2.5 msec and an average insert/delete time of 4 usec. We also describe how our techniques can be used to improve the speed of binary search on prefix lengths to provide a scalable solution for IPv6. Our approach to algorithm design is based on measurements using the VTune tool on a Pentium to obtain dynamic clock cycle counts.