Tree Bitma1.docVIP

Tree Bitmap : Hardware/Software IP Lookups with Incremental Updates 树形位图位映像Abstract 摘要 IP address lookup is challenging for high performance routers because it requires a longest matching prefix at speeds of up to 10 Gbps (OC-192). IP地址寻找对高性能的路由器是一个挑战，因为它要求最长的匹配前缀在速度最高到10GB. Existing solutions have poor update times or require large amounts of expensive high speed memory, 现存的解决方案有贫乏的更新时间或者要求大量的昂贵的高速的存储器。 and do not take into account the flexibility of ASICs or the structure of modern high speed memory technologies such as SDRAM and RAMBUS. 不能考虑ASIC的灵活性和现代高速存储器结构技术就像同步动态存储器和著名高速存储器生产商兰巴斯公司 In this paper, we present a family of IP lookup schemes using a data structure that compactly encodes large prefix tables. 在报纸上，我们提出家族的IP查找方案应用一个数据结构有紧密的编码大型的前缀表。 For example, one of our reference implementations requires only 110 Kbytes of memory for the 41,000 entry Mae East database). 例如，我们的其中一个参照实现要求只有110bt的存储器为41000进入东方数据库。 The schemes can be instantiated to require a maximum of 4-7memory references which, together with a small amount of pipelining, allows wire speed forwarding at OC-192 (10 Gbps) rates. 这个方案可以实例化去要求最大4-7的存储参量，附加一个小量的流水线，允许网速转发在10gb We also present a series of optimizations to the core algorithm that allows the memory access width of the algorithm to reduced at the cost of memory references or allocated memory. 我们也提出一系列的最优化直至核心的算法，它允许存储访问宽度算法以减少存储器参量或分配的存储器为代价。 1 Introduction介绍 Recently IP destination address lookups have received a great deal of attention 近来查找IP目的地址已经引起到了大量的关注。 [3][4][12][18][20][21][22]. Because of increased traffic in the Internet, faster links are being deployed;因为互联网上交易的增加，更快的链接将被展开。 2.48 Gbit/sec backbone links are being deployed, and the time is not far off when 10 Gigabit/sec (OC-192c) links will be deployed. 2.48G/S的主干网链接将被展开，离10G/S链接展开的时间也并不会遥远。 Faster links in turn require faster forwarding by routers. Since a large number of Internet packets are minimum sized packets (e.g., TCP acks), a number of vendors advertise wire speed