会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 7. 发明授权
    • Look up mechanism and associated hash table for a network switch
    • 查找网络交换机的机制和关联的哈希表
    • US06266705B1
    • 2001-07-24
    • US09162730
    • 1998-09-29
    • Daniel UllumThomas J. EdsallSoei-Shin Hang
    • Daniel UllumThomas J. EdsallSoei-Shin Hang
    • G06F15173
    • H04L12/467H04L12/4675H04L45/00H04L45/745
    • An improved look up mechanism for accessing a RAM to obtain forwarding information for data frames being transported among ports of a high-performance switch is provided. The look up mechanism includes a multi-page look up table and associated hashing technique. A media access control (MAC) address and a virtual local area network (VLAN) identifier are transformed with a hash function to obtain a hash key. The hash key is an address pointing to a particular entry in the look up table. A virtual first page is also derived from the hash key, which selects a particular physical page of the look up table to be initially accessed each time that MAC address/VLAN pair is used. The look up mechanism may also be used to access a short cut table containing Layer 3 short cut information. In either case, ultimately, the likelihood is increased that a match will be found on the first RAM access, thus maintaining high-speed switch performance.
    • 提供了一种用于访问RAM以获得在高性能交换机的端口之间传输的数据帧的转发信息的改进的查找机制。 查找机制包括多页查找表和相关联的散列技术。 媒体访问控制(MAC)地址和虚拟局域网(VLAN)标识符通过散列函数进行变换以获得散列密钥。 哈希密钥是指向查找表中特定条目的地址。 还从散列密钥派生虚拟第一页,该密钥选择每次使用MAC地址/ VLAN对时最初访问的查找表的特定物理页。 查找机制也可用于访问包含第3层快捷方式信息的快捷表。 在这两种情况下,最终增加了在第一RAM访问中发现匹配的可能性,从而保持高速开关性能。
    • 8. 发明授权
    • Network switch with hash table look up
    • 网络交换机与哈希表查找
    • US06457058B1
    • 2002-09-24
    • US09904431
    • 2001-07-12
    • Daniel UllumThomas J. EdsallSoei-Shin Hang
    • Daniel UllumThomas J. EdsallSoei-Shin Hang
    • G06F15173
    • H04L12/467H04L12/4675H04L45/00H04L45/745
    • An improved look up mechanism for accessing a RAM to obtain forwarding information for data frames being transported among ports of a high-performance switch is provided. The look up mechanism includes a multi-page look up table and associated hashing technique. A media access control (MAC) address and a virtual local area network (VLAN) identifier are transformed with a hash function to obtain a hash key. The hash key is an address pointing to a particular entry in the look up table. A virtual first page is also derived from the hash key, which selects a particular physical page of the look up table to be initially accessed each time that MAC address/VLAN pair is used. The look up mechanism may also be used to access a short cut table containing Layer 3 short cut information. In either case, ultimately, the likelihood is increased that a match will be found on the first RAM access, thus maintaining high-speed switch performance.
    • 提供了一种用于访问RAM以获得在高性能交换机的端口之间传输的数据帧的转发信息的改进的查找机制。 查找机制包括多页查找表和相关联的散列技术。 媒体访问控制(MAC)地址和虚拟局域网(VLAN)标识符通过散列函数进行变换以获得散列密钥。 哈希密钥是指向查找表中特定条目的地址。 还从散列密钥派生虚拟第一页,该密钥选择每次使用MAC地址/ VLAN对时最初访问的查找表的特定物理页。 查找机制也可用于访问包含第3层快捷方式信息的快捷表。 在这两种情况下,最终增加了在第一RAM访问中发现匹配的可能性,从而保持高速开关性能。
    • 9. 发明授权
    • Multiple packet paths to improve reliability in an IP network
    • 多个分组路径,以提高IP网络的可靠性
    • US06831898B1
    • 2004-12-14
    • US09593566
    • 2000-08-16
    • Thomas J. EdsallSilvano GaiSoei-Shin Hang
    • Thomas J. EdsallSilvano GaiSoei-Shin Hang
    • H04L1228
    • H04L47/34H04L45/00H04L45/16H04L45/24H04L45/28H04L47/2416
    • The invention replicates a packet requiring high availability and transmits it from two or more ports of a switch, for example a wiring closet Layer 2 switch. The parent packet carries a unique sequence number. The copies of the packet each carry the parent packet's unique sequence number. Each copy of the packet then travels on separate pathways through routers (Layer 3 network devices). The pathways are maintained separate by assigning high costs in a LSP routing sense to links connecting the two paths, and by assigning low costs to links along the desired paths. The two identical packets converge on the destination station. The destination station accepts the first packet with a particular sequence number, and discards any later packets with the same sequence number. In the event that a link in one path has a catastrophic failure, then the packet travelling along the other path reaches the destination station and service remains operative without interruption. The lost path is then recomputed by the a router (if any) still receiving the lost packet. A new non-converging path may be selected if any are available, depending upon the topology. After the disruption is repaired, the original dual pathways may once again be established.
    • 本发明复制了需要高可用性的分组,并将其从交换机的两个或更多个端口(例如配线柜第2层交换机)发送。 父包携带唯一的序列号。 分组的副本每个携带父分组的唯一序列号。 然后,数据包的每个副本通过路由器(第3层网络设备)在不同的路径上传播。 通过将LSP路由意义中的高成本分配给连接两个路径的链路以及通过沿着期望路径为链路分配低成本来维持路径。 两个相同的数据包收敛在目的站。 目的站接收具有特定序列号的第一个分组,并丢弃具有相同序列号的任何后续分组。 在一条路径中的链路发生灾难性故障的情况下,沿着另一路径行进的分组到达目的站,并且服务保持无间断的运行。 丢失的路径然后被路由器(如果有的话)重新计算,仍然收到丢失的数据包。 根据拓扑结构,可以选择新的非会聚路径(如果有)。 破坏后修复,原来的双重路径可能再次成立。