会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明授权
    • Fast convergence with topology switching
    • 与拓扑切换快速收敛
    • US07428237B1
    • 2008-09-23
    • US10752341
    • 2004-01-06
    • Silvano GaiKeith McCloghrieMerwyn B. Andrade
    • Silvano GaiKeith McCloghrieMerwyn B. Andrade
    • H04L12/28H04L12/56H04L12/26G06F15/16G06F15/173
    • H04L12/462H04L12/4641H04L12/465H04L41/06H04L41/0663
    • A system for rapidly switching at least one virtual local area network (VLAN) from a first loop-free topology to a second loop-free topology in response to a failure within the first loop-free topology. Each VLAN has one “logical” VLAN which represents the network entities organized into the VLAN and a set of “physical” VLANs each having its own VLAN designation. For each physical VLAN, a different loop-free topology is defined, although only one physical VLAN is “active” at any given time. Messages associated with the logical VLAN are tagged with the designation of the currently active physical VLAN, and forwarded along its loop-free topology. Upon detecting a failure in the loop-free topology, the logical VLAN is rapidly switched to the loop-free topology defined by a second, back-up physical VLAN. Following the switch, messages associated with the logical VLAN are tagged with the designation of this back-up VLAN and are forwarded along its loop-free topology.
    • 用于响应于第一无环路拓扑中的故障,将至少一个虚拟局域网(VLAN)从第一环无拓扑拓扑快速切换到第二无环路拓扑的系统。 每个VLAN都有一个“逻辑”VLAN,它表示组织在VLAN中的网络实体和一组“物理”VLAN,每个VLAN都有自己的VLAN名称。 对于每个物理VLAN,定义了不同的无环路拓扑,尽管在任何给定时间只有一个物理VLAN“活动”。 与逻辑VLAN相关联的消息被标记为当前活动的物理VLAN的指定,并沿其无环路拓扑转发。 检测到无环路拓扑故障时,逻辑VLAN将迅速切换到第二个备份物理VLAN所定义的无环路拓扑。 切换后,与逻辑VLAN相关联的消息将被标记为该备份VLAN的指定,并沿其无环路拓扑转发。
    • 3. 发明授权
    • Method and apparatus for uninterrupted packet transfer using replication over disjoint paths
    • 用于通过不相交路径进行复制的不间断数据包传输的方法和装置
    • US07373543B1
    • 2008-05-13
    • US10820257
    • 2004-04-08
    • Bijendra N. JainKeith McCloghrie
    • Bijendra N. JainKeith McCloghrie
    • G06F11/00
    • H04L45/28H04L45/00H04L45/24
    • A method of operating a fault tolerant connection in a network is described. The network includes a number of network elements and a number of links. Each of the network elements is coupled to at least one other of the network elements by at least one of the links. The method identifies a first path and a second path. The first path is between a first one of the network elements and a second one of the network elements, as is the second path. Moreover, the first path and the second path are disjoint. This disjointedness can be any difference between the two paths (e.g., any combination of different network elements or links). A packet is sent from the first one of the network elements via the first path, while a duplicate packet is sent from the first one of the network elements via the second path. The duplicate packet is a duplicate of the packet. Once these packets have been sent, at least one of the packet and the duplicate packet are received at the second one of the network elements. If both the packet and the duplicate packet are received at the second one of the network elements, one of the two is discarded (e.g., by simply ignoring the last one received).
    • 描述了在网络中操作容错连接的方法。 该网络包括多个网络元件和多个链路。 每个网络元件通过链路中的至少一个耦合到网络元件中的至少另一个。 该方法识别第一路径和第二路径。 第一路径在网络元件中的第一路径和网络元件中的第二路径之间,和第二路径一样。 此外,第一路径和第二路径是不相交的。 这种不相容性可以是两个路径之间的任何差异(例如,不同网络元件或链路的任何组合)。 经由第一路径从第一网络元件发送分组,同时经由第二路径从第一网络单元发送重复分组。 重复的数据包是数据包的副本。 一旦这些分组被发送,则在第二个网络单元中接收到分组和重复分组中的至少一个。 如果在第二个网络元件处接收到分组和重复分组,则丢弃两个分组中的一个(例如,通过简单地忽略所接收的最后一个)。
    • 6. 发明授权
    • Method and apparatus for rapidly reconfiguring bridged networks using a spanning tree algorithm
    • 使用生成树算法快速重新配置桥接网络的方法和装置
    • US06976088B1
    • 2005-12-13
    • US10259959
    • 2002-09-27
    • Silvano GaiKeith McCloghrieDinesh G. Dutt
    • Silvano GaiKeith McCloghrieDinesh G. Dutt
    • G06F15/173H04L12/28H04L12/46
    • H04L12/4641
    • A method that rapidly reconfigures a computer network having a plurality of devices executing the spanning tree algorithm. First, one or more devices are configured and arranged so that one port, providing connectivity to the root, is in the forwarding state and the remaining ports, providing connectivity to the root, are in the blocked state. Next, one or more of the blocked ports are designated as back-up ports. Upon detection of a failure at the active forwarding port, one of the back-up ports immediately transitions from blocked to forwarding, thereby becoming the new active port for the device. Following the transition to a new active port, dummy multicast messages are transmitted, each containing the source address of an entity directly coupled to the affected device or downstream thereof. By examining the dummy multicast messages, other devices in the network learn to use to the new forwarding port of the affected device. Rapid reconfiguration of the network is also provided upon detection of a new or repaired link or device representing a better path toward the root. The method is also compatible with networks supporting virtual local area network (VLAN) designations and allows load balancing among different VLANs.
    • 一种快速重新配置具有执行生成树算法的多个设备的计算机网络的方法。 首先,配置和布置一个或多个设备,使得提供与根的连接的一个端口处于转发状态,并且提供与根的连接的其余端口处于阻塞状态。 接下来,一个或多个阻塞端口被指定为备份端口。 在主动转发端口检测到故障后,其中一个备份端口立即从阻塞转发到转发,从而成为设备的新的活动端口。 在转换到新的活动端口之后,传输虚拟多播消息,每个消息包含直接耦合到受影响设备或其下游的实体的源地址。 通过检查虚拟组播消息,网络中的其他设备学习使用受影响设备的新转发端口。 在检测到新的或修复的链接或设备,表示朝向根的更好路径时,也提供网络的快速重新配置。 该方法还与支持虚拟局域网(VLAN)的网络兼容,并允许不同VLAN之间的负载平衡。
    • 7. 发明授权
    • Shared spanning tree protocol
    • 共享生成树协议
    • US06813250B1
    • 2004-11-02
    • US09748534
    • 2000-12-22
    • Michael FineSilvano GaiKeith McCloghrie
    • Michael FineSilvano GaiKeith McCloghrie
    • H04L1228
    • H04L45/48H04L12/4645H04L12/4695H04L45/023
    • A shared spanning tree protocol (SSTP) creates a plurality of spanning trees (i.e., loop-free paths) which are shared among one or more virtual local area network (VLAN) designations for data transmission within a computer network. Each shared spanning tree includes and is defined by a primary VLAN and may be associated with one or more secondary VLANs. In order to associate VLAN designation(s) with a single shared spanning tree, network devices exchange novel shared spanning tree protocol data units (SST-PDUs). Each SST-PDU corresponds to a given primary VLAN and preferably includes one or more fields which list the secondary VLAN designations associated with the given primary VLAN. The association of VLAN designations to shared spanning trees, moreover, preferably depends on which path traffic is to follow as well as the anticipated load characteristics of the various VLANs. The association of VLAN designations to shared spanning trees thus provides a degree of load balancing within the network. Data messages tagged with a particular VLAN designation are then distributed by the devices only along the shared spanning tree to which that VLAN has been associated by SSTP.
    • 共享生成树协议(SSTP)创建在一个或多个虚拟局域网(VLAN)指定之间共享的多个生成树(即,无环路径),用于计算机网络内的数据传输。 每个共享生成树包括并由主VLAN定义,并且可以与一个或多个辅助VLAN相关联。 为了将VLAN指定与单个共享生成树相关联,网络设备交换新的共享生成树协议数据单元(SST-PDU)。 每个SST-PDU对应于给定的主VLAN,并且优选地包括一个或多个列出与给定主VLAN相关联的辅助VLAN名称的字段。 此外,VLAN标识与共享生成树的关联优选地取决于哪个路径业务将遵循,以及各种VLAN的预期负载特性。 因此,VLAN名称与共享生成树的关联在网络中提供了一定程度的负载平衡。 标有特定VLAN标识的数据消息随后由SSTP与该VLAN关联的共享生成树分配。
    • 8. 发明授权
    • Cascading associative memory arrangement
    • 级联关联记忆布置
    • US06658458B1
    • 2003-12-02
    • US09599311
    • 2000-06-22
    • Silvano GaiKeith McCloghrie
    • Silvano GaiKeith McCloghrie
    • G06F1200
    • G06F17/30982G11C15/00H04L29/06H04L69/16H04L69/161Y10S707/99933
    • A system for efficiently organizing data or information into an associative memory device, such as a ternary content addressable memory (TCAM), for subsequent searching divides the TCAM is divided into a plurality of individual stages that are interconnected in a cascading fashion. The data or information that is to be stored into the TCAM for subsequent searching is initially translated into a first Boolean representation, such as a binary decision diagram (BDD), that is partitioned into a plurality of segments. Each segment defines one or more outputs, and the outputs from one segment define the inputs to the next segment. After partitioning the BDD and identifying the resulting outputs, each BDD segment along with its corresponding outputs is mapped into a particular stage of the TCAM.
    • 用于将数据或信息有效地组织到诸如三元内容可寻址存储器(TCAM)的关联存储器设备中用于后续搜索划分TCAM的系统被分成以级联方式互连的多个单独级。 要存储到TCAM中用于后续搜索的数据或信息最初被转换成被划分成多个段的第一布尔表示,例如二进制判定图(BDD)。 每个段定义一个或多个输出,并且来自一个段的输出定义到下一段的输入。 在分割BDD并识别结果输出之后,每个BDD段及其相应的输出被映射到TCAM的特定阶段。