.png){kind=icon}
返回
On fast address-lookup algorithms
.png){kind=icon}
PRE
AI
DOI：10.1109/49.772436.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The growth of the Internet and its acceptance has sparkled keen interest in the research community in respect to many apparent scaling problems for a large infrastructure based on IP technology. A self-contained problem of considerable practical and theoretical interest is the longest-prefix lookup operation, perceived as one of the decisive bottlenecks, Several novel approaches have been proposed to speed up this operation that promise to scale forwarding technology into gigabit speeds, This paper surveys these new lookup algorithms and classifies them based on applied techniques, accompanied by a set of practical requirements that are critical to the design of high-speed routing devices. We also propose several new algorithms to provide lookup capability at gigabit speeds. In particular, we show the theoretical limitations of routing table size and show that one of our new algorithms is almost optimal, while requiring only a small number of memory accesses to perform each address lookup.
Keyword:
communication system routing
communication systems
Internet
routing
tree data structures
tree searching
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
17.2
论文数:
6.4K
被引数:
3.1W
机构
暂无机构信息
引用论文
Reliability and construct validity of the Automated Neuropsychological Assessment Metrics (ANAM) mood scale自动神经心理学评估指标 (ANAM) 情绪量表的信度和结构效度
OAAI
OAAI分享收藏Recognition of hemi-methylated DNA by the SRA protein UHRF1 by a base-flipping mechanism.png)
Nature
NatureIF0
PREAI
分享收藏Beyond best effort: Router architectures for the differentiated services of tomorrow's Internet
PREAI
分享收藏
查看更多内容