期刊文献+

高端路由器CIDR表非关键字索引的B-Tree机制

A Kind of Non-Key Words Index B-Tree Mechanism in High-End Router CIDR List
下载PDF
导出
摘要 不分类的互联网协议(IP)地址方式无类别域间路由(CIDR)可以解决高端路由器中路由匹配延迟问题.通过对CIDR表深入分析,在参考数据库的非关键字索引方法和分割索引算法的基础上,提出了一种满足CIDR表要求的非关键字索引的B-Tree算法.该算法首先对CIDR表的全部前缀地址集合进行分割索引,分割后,CIDR表被改变成一种B-Tree索引结构;然后按照IP地址的非关键字对CIDR表进行快速查找.仿真结果表明,本文算法更好地满足了快速查找IP地址的需求. To solve the problem of route matching delay in the core routers,an unclassified Internet protocol(IP) address mode,classless inter-domain routing(CIDR),is introduced.By analyzing the CIDR list and referring to the non-Keyword index method and the partitioned indexing algorithm in databases,a novel B-Tree algorithm with non-keyword index which satisfies the requirements of the CIDR list is brought forward.This algorithm firstly makes a partitioned index on the set of all the prefix addresses in the CIDR list according to the non-keywords of the IP addresses. Simulation shows that the new algorithm meets the demand for the IP address fast lookup.
作者 杜慧军 杨宁
出处 《北京邮电大学学报》 EI CAS CSCD 北大核心 2009年第5期104-108,共5页 Journal of Beijing University of Posts and Telecommunications
基金 广东省自然科学基金项目(5006102)
关键词 高端路由器 无类别域间路由选择表 索引查找算法 high-end router classless inter domain routing list index lookup algorithm
  • 相关文献

参考文献10

  • 1Courses E, Surveys T. High-performance TCAM-based IP lookup engines [ C]//IEEE Conference on Computer Communications Workshops 2008. New York: IEEE Press, 2008: 1-6.
  • 2Lim H, Seo J, Jung Y. High speed IP address lookup architecture using hashing [ J ]. IEEE Communication Letters, 2003, 7(10) : 502-504.
  • 3He Bingsheng, Luo Qiong. Cache-oblivious query processing [ C ] // Conference on Innovative Data Systems Research. California. ISI Press, 2007: 44-55.
  • 4Soh S, Hiryanto L, Rai S. Efficient prefix updates for IP router using lexicographic ordering and updatable address set[J]. IEEE Transactions on Computers, 2008, 5(1): 110-125.
  • 5Majumder A, Rastogi R, Vanama S. Scalable regular expression matching on data streams[C]//Proceedings of the 2008 ACM SIGMOD International Conference. New York: ACM Press, 2008: 161-172.
  • 6刘尉悦,王永纲,张万生,王砚方.基于Hash和二叉树的路由表查找算法[J].中国科学技术大学学报,2006,36(3):293-296. 被引量:2
  • 7Luo Jin, Zu Xiaofang, Liu Shuliang, et al. Design and compressed storage of inverted index based on mixed word segmentation [ C ] // WKDD 2008. New York : IEEE Press, 2008:334-338.
  • 8Chang M, Poon C K. Efficient phrase querying with common phrase index [ J ]. Information Processing & Management, 2008, 44(2): 756-769.
  • 9Blanco R, Silvestri F. ECIR 2008 workshop on efficiency issues on information retrieval [ J ]. ACM SIGIR Forum, 2008, 42(1): 59-62.
  • 10Chen Su, Ooi B C, Tan K L, et al. ST2B-Tree: a selftunable spatio-temporal B+-Tree index for moving objects[C]//Proceedings of the 2008 ACM SIGMOD International Conference. New York: ACM Press, 2008 ; 29-42.

二级参考文献13

  • 1.数据来源[EB/OL].http://www.dgbas.gov.tw/dgbas03/bs3/ANALYSE/new92281.HTM,.
  • 2Lim H,Seo J,Jung Y.High speed IP address lookup architecture using hashing[J].IEEE Communications Letters,2003,7(10):502-504.
  • 3Ruiz-Sanchez M A,Biersack E W,et al.Survey and taxonomy of IP address lookup algorithms[J].IEEE Network,2001,15(2):8-23.
  • 4Pao D,Liu C,Wu A,Yeung L,et al.Efficient hardware architecture for fast IP address lookup[C]//IEEE INFOCOM 2002:The Conference on Computer Communications.IEEE Press,2002,21(1):555-561.
  • 5BGP Table Data[DB/OL].http://bgp.potaroo.net/index-bgp.html.
  • 6Chiueh T,Pradhan P.High-performance IP routing table lookup using CPU caching[C] // IEEE INFOCOM 1999:Eighteenth Annual Joint Conferenceof the IEEE Computer and Communications Societies.IEEE Press,1999,3:1 421-1 428.
  • 7Nilson S,Karlsson G.IP-address lookup using LC-tries[J].IEEE Journal on Selected Areas in Communications,1999,17 (6):1 083-1 092.
  • 8Waldvogel M.Multi-dimensional prefix matching using line search[C] // IEEE Conference on Local Computer Networks.IEEE Press,2000:200-207.
  • 9HUANG Nen-fu,ZHAO Shi-ming.A novel IP-routing lookup scheme and hardware architecture for multigigabit switching routers[J].IEEE Journal on Selected Areas in Communications,1999,17 (6):1 093-1 104.
  • 10Tzeng H H Y,Przygienda T.On fast address-lookup algorithms[J].IEEE Journal on Selected Areas in Communications,1999,17(6):1 067-1 082.

共引文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部