公开(公告)号：US06907466B2

公开(公告)日：2005-06-14

申请号：US10008513

申请日：2001-11-08

Applicant: Cedell A. Alexander, Jr. ,  Hood L. Richardson, Jr. ,  Edward J. Rovner

Inventor： Cedell A. Alexander, Jr. ,  Hood L. Richardson, Jr. ,  Edward J. Rovner

IPC: H04L12/861 ,  H04L29/06 ,  H04L29/08 ,  G06F15/177 ,  H04L12/28

CPC classification number: H04L67/06 ,  H04L29/06 ,  H04L49/90 ,  H04L69/329

Abstract: Methods and systems for efficiently delivering data to multiple destinations in a computer network are disclosed. Data to be delivered to multiple destinations is stored in memory. The stored data is divided into blocks. Checksums are pre-calculated for each block. Pre-calculated checksums are used to calculate the data checksums for data to be inserted in each packet to be delivered to data destinations.

Abstract translation: 公开了用于有效地将数据传送到计算机网络中的多个目的地的方法和系统。 要传送到多个目的地的数据存储在存储器中。 存储的数据被分成块。 每个块预先校验和。 预先计算的校验和用于计算要传送到数据目的地的每个数据包中要插入的数据的数据校验和。

公开(公告)号：US08289853B2

公开(公告)日：2012-10-16

申请号：US12646462

申请日：2009-12-23

Applicant: Cedell A. Alexander, Jr.

Inventor： Cedell A. Alexander, Jr.

IPC: H04J1/16

CPC classification number: H04L45/742 ,  H04L45/12 ,  H04L45/122 ,  H04L45/46

Abstract: The solution to the shortest path between a source node and multiple destination nodes is accelerated using a grouping of nodes, where the nodes are grouped based on distance from the source node, and a corresponding set of memory locations that indicate when a group includes one or more nodes. The memory locations can be quickly searched to determine the group that represents the shortest distance from the source node and that includes one or more nodes. Nodes may be grouped into additional groupings that do not correspond to the set of memory locations, when the distance from the source node to the nodes exceeds the range of memory locations. Advantageously, the disclosed system and method provide the ability to reach asymptotically optimal performance.

Abstract translation: 使用一组节点来加速在源节点和多个目的地节点之间的最短路径的解决方案，其中根据与源节点的距离对节点进行分组，以及相应的一组存储器位置，其指示组何时包括一个或 更多的节点。 可以快速搜索存储器位置以确定代表距离源节点的最短距离并且包括一个或多个节点的组。 当从源节点到节点的距离超过存储器位置的范围时，节点可以被分组成不对应于该组存储器位置的附加分组。 有利地，所公开的系统和方法提供达到渐近最佳性能的能力。

公开(公告)号：US08031709B2

公开(公告)日：2011-10-04

申请号：US12371528

申请日：2009-02-13

Applicant: Cedell A. Alexander, Jr.

Inventor： Cedell A. Alexander, Jr.

IPC: H04L12/56

CPC classification number: H04L49/351 ,  H04L12/4645 ,  H04L47/10 ,  H04L49/3009 ,  H04L49/354 ,  Y10S707/99936

Abstract: An integrated circuit has a hardware decoder that parses a frame to identify a type of encapsulation. The integrated circuit also has a number of hardware parsers, each parser being coupled to the decoder by an enable line. During packet processing, one of the parsers is enabled by the decoder, based on the value which identifies the encapsulation type. The enabled parser retrieves one or more attributes from the frame, depending on the encapsulation. The integrated circuit also has a register, coupled to each parser. The register holds the attributes retrieved by the parser. The integrated circuit also has a key generation hardware which creates a key, by concatenating from the attributes register, certain attributes that are pre-selected by a user for forming the key. The integrated circuit supplies the key to a memory to look up a set of user-specified actions to be performed on data in the frame.

Abstract translation: 集成电路具有解析帧以识别封装类型的硬件解码器。 集成电路还具有多个硬件解析器，每个解析器通过使能线耦合到解码器。 在分组处理期间，解码器之一基于识别封装类型的值，由解码器使能。 启用的解析器取决于封装，从帧中检索一个或多个属性。 集成电路还具有一个寄存器，耦合到每个解析器。 寄存器保存解析器检索的属性。 集成电路还具有密钥生成硬件，其通过从属性寄存器连接由用户预先选择的用于形成密钥的某些属性来创建密钥。 集成电路将密钥提供给存储器以查找要针对帧中的数据执行的一组用户指定的动作。

公开(公告)号：US07457286B2

公开(公告)日：2008-11-25

申请号：US10404970

申请日：2003-03-31

Applicant: Cedell A. Alexander, Jr.

Inventor： Cedell A. Alexander, Jr.

IPC: H04Q12/00

CPC classification number: H04L45/742 ,  H04L45/12 ,  H04L45/122 ,  H04L45/46

Abstract: The solution to the shortest path between a source node and multiple destination nodes is accelerated using a grouping of nodes, where the nodes are grouped based on distance from the source node, and a corresponding set of memory locations that indicate when a group includes one or more nodes. The memory locations can be quickly searched to determine the group that represents the shortest distance from the source node and that includes one or more nodes. Nodes may be grouped into additional groupings that do not correspond to the set of memory locations, when the distance from the source node to the nodes exceeds the range of memory locations. Advantageously, the disclosed system and method provide the ability to reach asymptotically optimal performance.

Abstract translation: 使用一组节点来加速在源节点和多个目的地节点之间的最短路径的解决方案，其中根据与源节点的距离对节点进行分组，以及相应的一组存储器位置，其指示组何时包括一个或 更多的节点。 可以快速搜索存储器位置以确定代表距离源节点的最短距离并且包括一个或多个节点的组。 当从源节点到节点的距离超过存储器位置的范围时，节点可以被分组成不对应于该组存储器位置的附加分组。 有利地，所公开的系统和方法提供达到渐近最佳性能的能力。

公开(公告)号：US07664040B2

公开(公告)日：2010-02-16

申请号：US11670873

申请日：2007-02-02

Applicant: Cedell A. Alexander, Jr.

Inventor： Cedell A. Alexander, Jr.

IPC: H04L12/28

CPC classification number: H04L45/742 ,  H04L45/12 ,  H04L45/122 ,  H04L45/46

Abstract: The solution to the shortest path between a source node and multiple destination nodes is accelerated using a grouping of nodes, where the nodes are grouped based on distance from the source node, and a corresponding set of memory locations that indicate when a group includes one or more nodes. The memory locations can be quickly searched to determine the group that represents the shortest distance from the source node and that includes one or more nodes. Nodes may be grouped into additional groupings that do not correspond to the set of memory locations, when the distance from the source node to the nodes exceeds the range of memory locations. Advantageously, the disclosed system and method provide the ability to reach asymptotically optimal performance.

Abstract translation: 使用一组节点来加速在源节点和多个目的地节点之间的最短路径的解决方案，其中根据与源节点的距离对节点进行分组，以及相应的一组存储器位置，其指示组何时包括一个或 更多的节点。 可以快速搜索存储器位置以确定代表距离源节点的最短距离并且包括一个或多个节点的组。 当从源节点到节点的距离超过存储器位置的范围时，节点可以被分组成不对应于该组存储器位置的附加分组。 有利地，所公开的系统和方法提供达到渐近最佳性能的能力。

公开(公告)号：US07492763B1

公开(公告)日：2009-02-17

申请号：US10893117

申请日：2004-07-16

Applicant: Cedell A. Alexander, Jr.

Inventor： Cedell A. Alexander, Jr.

IPC: H04L12/56

CPC classification number: H04L49/351 ,  H04L12/4645 ,  H04L47/10 ,  H04L49/3009 ,  H04L49/354 ,  Y10S707/99936

Abstract: An integrated circuit has a hardware decoder that parses a frame to identify a type of encapsulation. The integrated circuit also has a number of hardware parsers, each parser being coupled to the decoder by an enable line. During packet processing, one of the parsers is enabled by the decoder, based on the value which identifies the encapsulation type. The enabled parser retrieves one or more attributes from the frame, depending on the encapsulation. The integrated circuit also has a register, coupled to each parser, to hold the attributes. The integrated circuit also has a key generation hardware which creates a key, by concatenating from the attributes register, certain attributes that are pre-selected by a user for forming the key. The integrated circuit uses the key to look up in memory a set of user-specified actions that are then performed on data in the frame.

Abstract translation: 集成电路具有解析帧以识别封装类型的硬件解码器。 集成电路还具有多个硬件解析器，每个解析器通过使能线耦合到解码器。 在分组处理期间，解码器之一基于识别封装类型的值，由解码器使能。 启用的解析器取决于封装，从帧中检索一个或多个属性。 集成电路还具有耦合到每个解析器的寄存器，以保持属性。 集成电路还具有密钥生成硬件，其通过从属性寄存器连接由用户预先选择的用于形成密钥的某些属性来创建密钥。 集成电路使用密钥在内存中查找一组用户指定的动作，然后对帧中的数据执行。

公开(公告)号：US07269135B2

公开(公告)日：2007-09-11

申请号：US10115705

申请日：2002-04-04

Applicant: John Kevin Frick ,  Cedell A. Alexander, Jr. ,  Olen Lee Stokes, Jr. ,  Charles Frederick Burton, III ,  Donald Bruce Grosser, Jr.

Inventor： John Kevin Frick ,  Cedell A. Alexander, Jr. ,  Olen Lee Stokes, Jr. ,  Charles Frederick Burton, III ,  Donald Bruce Grosser, Jr.

IPC: H04L12/56

CPC classification number: H04L45/28 ,  H04L43/0811 ,  H04L45/00 ,  H04L45/22 ,  H04L45/50

Abstract: Methods and systems for providing redundant network connectivity across a network using a tunneling protocol by dynamically moving a TLS tunnel between master and slave switches based on relative connectivity provided by the switches are disclosed. A standby routing protocol executes on the master and slave switches to monitor the relative connectivity. In response to detecting that the relative connectivity of the slave switch exceeds that of the master switch, the standby routing protocol reverses the roles of the master and slave switches, thus moving the TLS tunnel to the new master switch.

Abstract translation: 公开了基于由交换机提供的相对连接来通过使用隧道协议通过动态地移动主交换机和从交换机之间的TLS隧道来提供跨网络的冗余网络连接的方法和系统。 备用路由协议在主交换机和从交换机上执行，以监视相对连接。 响应检测到从交换机的相对连接性超过主交换机的相对连通性，备用路由协议反转主交换机和从交换机的角色，从而将TLS隧道移动到新的主交换机。