全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...
软件学报  2002 

Survey on Routing Lookup Algorithms
路由查找算法研究综述

Keywords: route lookup,longest matching prefix,Trie-tree,Hash,CAM
路由查找
,最长前缀匹配,Trie树,哈希,CAM

Full-Text   Cite this paper   Add to My Lib

Abstract:

With rapid development of Internet,the line speed of core router has reached 2.5Gbps and even 10Gbps beyond.This speed orders core router to be able to forward ten millions of packets per second.Route lookup is an important step of packet forwarding,so high speed IP address lookup algorithm is the key component of high speed packet forwarding.IP address lookup requires a longest matching prefix search.In the last couple of years,various algorithms for high-performance IP address lookup have been proposed.In this paper,the difficulty of route lookup is analyzed,and a survey of all kinds of lookup algorithms,which are compared indetail,is also presented.At last,some challenging open problems are identified.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133