Trie-Structure-Guided Compression, Allocation, and Mapping for Storage-Efficient IPv6 Lookup Pipelines
Open Access
- 11 August 2026
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 1410-1426
Abstract
No abstract availableFunding Information
- Strategic Priority Research Program of the Chinese Academy of Sciences (XDA036)
This publication has 22 references indexed in Scilit:
- Fast Software IPv6 Lookup With NeurotrieIEEE/ACM Transactions on Networking, 2024
- CP-Trie: Cumulative PopCount based Trie for IPv6 Routing Table Lookup in Software and ASIC2021
- SHIP: A Scalable High-Performance IPv6 Lookup Algorithm That Exploits Prefix CharacteristicsIEEE/ACM Transactions on Networking, 2019
- Constant IP Lookup With FIB ExplosionIEEE/ACM Transactions on Networking, 2018
- FlashTrie: Hash-based Prefix-Compressed Trie for IP Route Lookup Beyond 100Gbps2010
- A SRAM-based Architecture for Trie-based IP Lookup Using FPGA2008
- A Memory-Balanced Linear Pipeline Architecture for Trie-based IP Lookup2007
- Efficient Construction of Pipelined Multibit-Trie Router-TablesIEEE Transactions on Computers, 2006
- A Tree Based Router Search Engine Architecture with Single Port Memories2005
- Fast incremental updates for pipelined forwarding enginesIEEE/ACM Transactions on Networking, 2005