Boosting FIB Caching Performance with Aggregation
Garegin Grigoryan, Yaoqing Liu, Minseok Kwon
摘要
In the era of high-performance cloud computations, networks need to ensure fast packet forwarding. This task is carried by TCAM forwarding chips that perform line-rate Longest Prefix Matches in a Forwarding Information Base (FIB). However, with the increasing number of prefixes in IPv4 and IPv6 routing tables the price of TCAM increases as well. In this work, we present a novel FIB compression technique by adding an aggregation layer into a FIB caching architecture. In Combined FIB Caching and Aggregation (CFCA), cache-hit ratio is maximized up to 99.94% with only 2.50% entries of the FIB, while the churn in TCAM is reduced by more than 40% compared to low-churn FIB aggregation techniques.
问问这篇 Paper
问问你的智能体。
Lune 读过与它相关的顶会 Paper,每个回答都会注明依据哪几篇。
相关 Paper
- Trie-Structure-Guided Compression, Allocation, and Mapping for Storage-Efficient IPv6 Lookup PipelinesDonghong Jiang, Zhenhao Yuan, Yanbiao Li, Shi Meng 等SIGCOMM 2026
- PtCAM: Scalable High-Speed Name Prefix Lookup using TCAMTian Song, Tianlong Li, Yating YangSIGCOMM 2025 · 被引用 3 次
- T-cache: Dependency-free Ternary Rule Cache for Policy-based ForwardingYing Wan, Haoyu Song, Yang Xu, Yilun Wang 等INFOCOM 2020 · 被引用 23 次
- PlanB: Efficient Software IPv6 Lookup with Linearized B+-TreeZhihao Zhang, Lanzheng Liu, Chen Chen, Huiba Li 等NSDI 2026 · 被引用 1 次
- SkipTrie: Fast IPv6 Lookup with Sub-Trie SkippingDonghong Jiang, Yanbiao Li, Shi Meng, Yuxuan Chen 等INFOCOM 2026
