发表机构
University of Tehran（德黑兰大学）
机构由 AI 辅助整理，请以论文原文为准。AI 中文总结
针对NDN转发查找与硬件快速路径不匹配的问题，提出经认证的快速路径覆盖方法，通过证书感知放置和组合策略，将覆盖率从46.48%提升至64.06%。
AI 中文摘要
命名数据网络（NDN）用对可变长度层次名称的最长前缀查找取代了基于地址的转发，这使其难以适配有界硬件快速路径。我们将此问题表述为经认证的快速路径覆盖。一个离线映射器在共享预算下选择一个前缀封闭的解析器可见三元组节点集合，以及一个独立的动作等价证书集合。证书将选定的浅层FIB前缀与具有相同转发动作的更深真实LPM类别关联起来；应用捷径需要健全的类别守卫，而不确定的流量则回退到精确路径。我们提出了BPC-Greedy，一种证书感知的放置启发式算法，以及BPC-Portfolio，一种涵盖精确密集型、修复型和浅层捷径构造的多策略包装器。该表述揭示了用于前缀放置的树闭包背包结构，在统一证书成本下对固定选定集合的精确top-k证书选择，以及一个独立的银行可行性层。在合成解析器深度扫描和对公共NDN测试平台名称的50k重放（在可复现的合成转发动作快照下）中，建模的经认证覆盖率从最佳仅精确前缀的银行感知基线的46.48%提高到总预算M=48时的64.06%。这些结果刻画了所述模型下的放置机会：评估器使用已知真实LPM作为预言机式守卫，证书表银行流量未被建模，且未对合成的延迟、面积或吞吐量做出任何声明。
英文摘要
Named Data Networking (NDN) replaces address-based forwarding with longest-prefix lookup over variable-length hierarchical names, creating a difficult fit with bounded hardware fast paths. We formulate this problem as certified fast-path coverage. An offline mapper selects a prefix-closed set of parser-visible trie nodes and a separate set of action-equivalence certificates under a shared budget. A certificate relates a selected shallow FIB prefix to a deeper true-LPM class with the same forwarding action; applying the shortcut requires a sound class guard, while uncertain traffic falls back to an exact path. We present BPC-Greedy, a certificate-aware placement heuristic, and BPC-Portfolio, a multi-strategy wrapper spanning exact-heavy, repair-based, and shallow-shortcut constructions. The formulation exposes a tree-closure knapsack structure for prefix placement, exact top-k certificate selection for a fixed selected set under uniform certificate cost, and a separate bank-feasibility layer. On a synthetic parser-depth sweep and a 50k replay of public NDN testbed names under a reproducible synthetic forwarding-action snapshot, modeled certified coverage increases from 46.48% for the best exact-prefix-only bank-aware baseline to 64.06% at total budget M=48. These results characterize placement opportunity under the stated model: the evaluator uses the known true LPM as an oracle-style guard, certificate-table bank traffic is not modeled, and no claim is made about synthesized latency, area, or throughput.
Comments19 pages, 7 figures. Extended preprint
