会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 78. 发明授权
    • Forwarding tree having multiple bit and intermediate bit pattern comparisons
    • 具有多位和中间位模式比较的转发树
    • US07512080B1
    • 2009-03-31
    • US11305847
    • 2005-12-16
    • Kireeti KompellaJean Marc FrailongPradeep Sindhu
    • Kireeti KompellaJean Marc FrailongPradeep Sindhu
    • H04L12/28H04L12/56
    • H04L45/00H04L45/7457
    • Principles of the invention are directed to techniques for allowing a router forwarding packets within a computer network to perform two or more forwarding tree decisions per memory access. The router may implement forwarding information in the form of a radix tree having a number of nodes, and received packets may contain keys identifying a packet destination. The router may traverse the tree by testing two or more path control bits within the key per each of the traversed nodes. The values of the path control bits in the key determine the path traversed along the tree. The router also stores intermediate bit patterns at each node and tests intermediate bits in the key to determine whether a particular node is the best match to the routing prefix contained in the key, thereby eliminating a need to backtrack up the tree.
    • 本发明的原理涉及允许路由器在计算机网络内转发分组以对每个存储器访问执行两个或多个转发树决策的技术。 路由器可以以具有多个节点的小树形式实现转发信息,并且接收的分组可以包含标识分组目的地的密钥。 路由器可以通过测试每个遍历节点内的密钥内的两个或多个路径控制位来遍历树。 密钥中的路径控制位的值确定沿着树路径。 路由器还在每个节点处存储中间位模式,并测试密钥中的中间位,以确定特定节点是否与密钥中包含的路由前缀最匹配,从而无需追溯树。