Optimal algorithms for tree partitioning
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Optimal folding of standard and custom cells
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Trading packet headers for packet processing
IEEE/ACM Transactions on Networking (TON)
Routing on longest-matching prefixes
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 lookups using controlled prefix expansion
ACM Transactions on Computer Systems (TOCS)
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Fundamentals of Data Structures in C++
Fundamentals of Data Structures in C++
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
O(log n) Dynamic Router-Tables For Ranges
ISCC '03 Proceedings of the Eighth IEEE International Symposium on Computers and Communications
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
IP switching and gigabit routers
IEEE Communications Magazine
Survey and taxonomy of IP address lookup algorithms
IEEE Network: The Magazine of Global Internetworking
Multi-terabit ip lookup using parallel bidirectional pipelines
Proceedings of the 5th conference on Computing frontiers
New Data Structures for IP Lookup and Conflict Detection
Algorithmics of Large and Complex Networks
Sequence-preserving parallel IP lookup using multiple SRAM-based pipelines
Journal of Parallel and Distributed Computing
Advanced hashing schemes for packet forwarding using set associative memory architectures
Journal of Parallel and Distributed 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
| Hi-index | 14.98 |
Efficient algorithms to construct multibit tries suitable for pipelined router-table applications are developed. We first enhance the 1-phase algorithm of Basu and Narlikar [1], obtaining a 1-phase algorithm that is 2.5 to 3 times as fast. Next, we develop 2--phase algorithms that not only guarantee to minimize the maximum per-stage memory but also guarantee to use the least total memory subject to the former constraint. Our 2-phase algorithms not only generate better pipelined trees than those generated by the 1--phase algorithm, but they also take much less time. A node pull-up scheme that guarantees no increase in maximum per-stage memory as well as a partitioning heuristic that generates pipelined multibit tries requiring less maximum per-stage memory than required by the tries obtained using the 1-phase and 2-phase algorithms are also proposed.