%0 Journal Article
%T Survey on Routing Lookup Algorithms<br>路由查找算法研究综述
%A XU Ke
%A XU Ming-wei
%A WU Jian-ping
%A WU Jian
%A <br>徐恪
%A 徐明伟
%A 吴建平
%A 吴剑
%J 软件学报
%D 2002
%I 
%X 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.
%K route lookup
%K longest matching prefix
%K Trie-tree
%K Hash
%K CAM<br>路由查找
%K 最长前缀匹配
%K Trie树
%K 哈希
%K CAM
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=D24CB1FC33382B93&yid=C3ACC247184A22C1&vid=FC0714F8D2EB605D&iid=CA4FD0336C81A37A&sid=ECE8E54D6034F642&eid=771152D1ADC1C0EB&journal_id=1000-9825&journal_name=软件学报&referenced_num=23&reference_num=31