共查询到16条相似文献,搜索用时 234 毫秒
1.
2.
传统二分算法完成一次IPv4最长前缀匹配需5步搜索,且因存在回溯问题难以硬件实现,而单步TCAM路由查找方案要求转发表的存储必须按前缀长度相对地址降序排列,影响表项的更新速度和路由查找流程的连续性。该文提出并以TCAM流水线硬件实现了一种独特对扩展前缀范围的四分搜索算法。仅用2步搜索完成一次IPv4路由查找、转发表不需排序、查找速率高、表项更新快、查表连续性好。满足IPv4核心路由器的双OC-768(40Gbps)端口、48B包的线速转发。 相似文献
3.
4.
现代核心路由器对查找速率、表项更新速度、查找表容量等提出越来越高的要求。目前工业厂商大多采用基于TCAM(三态内容关联存储器)的解决方案。TCAM最大特点是查找速度快,但其更新算法会浪费很大的存储空间。针对这个问题该文提出一种利用FPGA提供硬件支持的路由更新方法,增加新表项时,只需对新增表项进行一次预处理,转发表无需按前缀长度排序,消除了预留空闲表项造成的存储空间浪费。 相似文献
5.
通过对从IPv4网络到IPv6网络迁移技术的论述,介绍了迁移技术的三大分类:隧道技术、双协议栈技术和翻译转换技术,并着重探讨了IPv6主机/路由器间通信的配置型隧道 、自动型隧道、隧道代理、IPv6 over IPv4 GRE隧道、自动6 To 4隧道技术,以及实现IPv6主机/路由器和IPv4主机/路由器间通信的双协议栈、双协议栈转换、动态IP/ICCMP转换、网络地址和协议转换、SOCKS64网关等技术。 相似文献
6.
IPv6网络能够提供高质量服务的关键在于设计出能够进行快速查表的高性能的路由器。由于需要进行最长前缀匹配,路由表的查找与更新向来是高速路由器的瓶颈。在IPv6网络中,地址从IPv4的32位扩展到128位,进行最长前缀匹配变得更加困难。该文主要根据Nen-FuHuang等提出的IPv4算法提出一种基于IPv6地址分布的IPv6的路由查表算法。该算法每次查表最多只需要访问三次存储器,而且使用的存储器比较小,仅需要2M多字节。 相似文献
7.
8.
王燕 《计算机应用与软件》2005,22(10):28-30
TCAM被广泛用于执行快速路由查找,不管前缀的数量和长度,它能在极短时间内解决最佳前缀问题。与基于软件解决方法相比较,TCAM能提供持续吞吐量和简单系统体系,这对IPv6路由查找来说是很有吸引力的。然而,它也有一些缺点,例如入口数量有限,价格昂贵和能源消耗。因此,本文提出一种有效、能减少所需TCAM的算法,该算法通过增加微DRAM来消除98%的TCAM入口。实验证明,该算法效果良好,可以大大提高IPv6路由查找性能。 相似文献
9.
10.
11.
提出一种兼容IPv4和IPv6报文高速路由查找方案,方案基于TCAM技术,同时对TCAM路由表更新算法进行比较,最后采用松散前缀顺序约束算法实现TCAM路由表的更新,并在网络处理器原型设计中得到应用。方案可以满足10Gbps速率IP报文线速转发的要求。 相似文献
12.
Hyuntae ParkAuthor VitaeHyejeong HongAuthor Vitae Sungho KangAuthor Vitae 《Computer Networks》2012,56(1):231-243
Due to a tremendous increase in internet traffic, backbone routers must have the capability to forward massive incoming packets at several gigabits per second. IP address lookup is one of the most challenging tasks for high-speed packet forwarding. Some high-end routers have been implemented with hardware parallelism using ternary content addressable memory (TCAM). However, TCAM is much more expensive in terms of circuit complexity as well as power consumption. Therefore, efficient algorithmic solutions are essentially required to be implemented using network processors as low cost solutions.Among the state-of-the-art algorithms for IP address lookup, a binary search based on a balanced tree is effective in providing a low-cost solution. In order to construct a balanced search tree, the prefixes with the nesting relationship should be converted into completely disjointed prefixes. A leaf-pushing technique is very useful to eliminate the nesting relationship among prefixes [V. Srinivasan, G. Varghese, Fast address lookups using controlled prefix expansion, ACM Transactions on Computer Systems 17 (1) (1999) 1-40]. However, it creates duplicate prefixes, thus expanding the search tree.This paper proposes an efficient IP address lookup algorithm based on a small balanced tree using entry reduction. The leaf-pushing technique is used for creating the completely disjointed entries. In the leaf-pushed prefixes, there are numerous pairs of adjacent prefixes with similarities in prefix strings and output ports. The number of entries can be significantly reduced by the use of a new entry reduction method which merges pairs with these similar prefixes. After sorting the reduced disjointed entries, a small balanced tree is constructed with a very small node size. Based on this small balanced tree, a native binary search can be effectively used in address lookup issue. In addition, we propose a new multi-way search algorithm to improve a binary search for IPv4 address lookup. As a result, the proposed algorithms offer excellent lookup performance along with reduced memory requirements. Besides, these provide good scalability for large amounts of routing data and for the address migration toward IPv6. Using both various IPv4 and IPv6 routing data, the performance evaluation results demonstrate that the proposed algorithms have better performance in terms of lookup speed, memory requirement and scalability for the growth of entries and IPv6, as compared with other algorithms based on a binary search. 相似文献
13.
为了提高IPv6的路由查找效率,针对IPv6路由前缀分布不均匀的问题,提出了一种基于B-树和Bloom filter相结合的IPv6路由查找算法(BTBF)。BTBF分为B-树和Bloom filter查找两部分,利用B-树查找路由前缀的前16 bit值,然后通过B-树节点中位向量的映射,将下一步链接到Bloom filter,再利用Bloom filter位数组的值映射提取下一跳。实验结果表明,BTBF算法与其他树型和Bloom filter类算法相比有效减少了空间和时间占用,在路由表项数变化较大的情况下也能维持稳定的查找性能。 相似文献
14.
15.
16.
提出一种可硬件实现的快速IPv6查找算法,采用基于内容可寻址存储器CAM的分段查找机制,用流水线实现,每个周期可输出一次查找结果,所需存储开销较小。在Xilinx Virtex-6 FPGA开发板用150×1 024项IPv6前缀测试表明,查找速度可达597 Mp/s(Million packet/s),最坏需要2次存储器访问,更新最坏需要50 μs,仅需20.07 MB的RAM和258 KB的CAM存储开销。 相似文献