公开(公告)号：US07855980B2

公开(公告)日：2010-12-21

申请号：US12367611

申请日：2009-02-09

申请人： LeRoy R. Lundin ,  Casandra H. Qiu ,  Aruna V. Ramanan

发明人： LeRoy R. Lundin ,  Casandra H. Qiu ,  Aruna V. Ramanan

IPC分类号： H04L12/28

CPC分类号： H04L49/15

摘要： An exemplary method of identifying configuration topology, existing switches, and miswires in a given network is provided. Given a number of switches, which may be less than the maximum possible for the actual configuration and some ports of which may be miswired, generate a hypothesis for the supported topology of which the existing configuration is a subset. A best fit of the existing switches to the supported number switches of the maximal topology is performed, using formulae for the connections of the maximal supported topology. If supported switches are found missing in the assumed topology, the switch count is increased accordingly, and started over with a new hypothesis. When satisfied with identification, all switch ports are revisited and the connection formulae is used to identify all miswires.

摘要翻译： 提供了在给定网络中识别配置拓扑，现有交换机和误接线的示例性方法。 给定多个交换机，其可能小于实际配置的最大可能性，并且其某些端口可能被误接线，为支持的拓扑生成假设，其中现有配置是子集。 使用最大支持拓扑的连接公式，实现现有交换机对最大拓扑支持的数字交换机的最佳拟合。 如果在假定的拓扑中发现缺少支持的交换机，则交换机计数相应增加，并以新的假设开始。 当识别满足时，重新访问所有交换机端口，并使用连接公式来识别所有的误接线。

公开(公告)号：US07623473B2

公开(公告)日：2009-11-24

申请号：US11421186

申请日：2006-05-31

申请人： Aruna V. Ramanan ,  Alison B. White

发明人： Aruna V. Ramanan ,  Alison B. White

IPC分类号： H04L12/28

CPC分类号： H04L41/12 ,  H04L41/22 ,  H04L49/15 ,  H04L49/1523 ,  H04Q3/0083 ,  H04Q3/68

摘要： Topology discovery and identification of switches enables a user to determine the topology of a three-stage switch network. The method includes ascertaining an intended topology of the three-stage switch network, creating a list of switch boards that are present in the three-stage switch network, and determining a switch board connection pattern by obtaining information indicating how each switch board is connected to neighboring switch boards. The method further includes classifying each of the switch boards on the list of switch boards as a node switch board, an intermediate switch board, or a jump switch board, and creating a list for each type of switch board. The method further includes grouping the intermediate and node switch boards into sectors, and numbering each type of switch board, thereby obtaining a determined topology, and validating the determined topology by comparing it to the intended topology.

摘要翻译： 交换机的拓扑发现和识别使得用户能够确定三级交换机网络的拓扑。 该方法包括确定三级交换网络的预期拓扑结构，创建出现在三级交换网络中的交换板列表，以及通过获取指示每个交换机板如何连接的信息来确定交换板连接模式 相邻开关板。 该方法还包括将交换板列表中的每个交换板分类为节点交换板，中间交换板或跳转交换板，并为每种类型的交换板创建列表。 该方法还包括将中间和节点交换板分组为扇区，并对每种类型的交换板进行编号，从而获得确定的拓扑，并通过将其与预期拓扑进行比较来验证所确定的拓扑。

公开(公告)号：US20100275071A1

公开(公告)日：2010-10-28

申请号：US12428857

申请日：2009-04-23

申请人： Casimer M. DeCusatis ,  Aruna V. Ramanan ,  Edward J. Seminaro ,  Alison B. White ,  Daniel G. Young

发明人： Casimer M. DeCusatis ,  Aruna V. Ramanan ,  Edward J. Seminaro ,  Alison B. White ,  Daniel G. Young

IPC分类号： G06F11/07

CPC分类号： G06F11/0751 ,  G06F11/0724 ,  G06F15/177 ,  H04L12/40013

摘要： A method of validating multi-cluster computer interconnects includes calculating a cable interconnect table associated with the multi-cluster computer, and distributing the cable interconnect table to a first transceiver in the first computer cluster and a second transceiver in the second computer cluster. The method also includes connecting a first end of a cable to the first transceiver and a second end of the cable to the second transceiver, transmitting a first neighbor identification from the first cluster to the second cluster, and a second neighbor identification from the second cluster to the first cluster, comparing the first neighbor identification with a desired first neighbor identification from the cable interconnect table to establish a first comparison result and the second neighbor identification with a desired second identification from the cable interconnect table to establish a second comparison result, and generating an alert based on the first and second comparison results.

摘要翻译： 验证多集群计算机互连的方法包括计算与多群集计算机相关联的电缆互连表，并将电缆互连表分配到第一计算机集群中的第一收发器和第二计算机集群中的第二收发器。 该方法还包括将电缆的第一端连接到第一收发器，将电缆的第二端连接到第二收发器，将第一邻居标识从第一集群发送到第二集群，以及从第二集群发送第二邻居标识 将所述第一邻居标识与来自所述电缆互连表的期望的第一邻居标识进行比较，以从所述电缆互连表建立第一比较结果和所述第二邻居标识，以建立第二比较结果，以及 基于第一和第二比较结果生成警报。

公开(公告)号：US20090141643A1

公开(公告)日：2009-06-04

申请号：US12367611

申请日：2009-02-09

申请人： LeRoy R. Lundin ,  Casandra H. Qiu ,  Aruna V. Ramanan

发明人： LeRoy R. Lundin ,  Casandra H. Qiu ,  Aruna V. Ramanan

IPC分类号： H04J3/14 ,  H04L12/28

CPC分类号： H04L49/15

摘要： An exemplary method of identifying configuration topology, existing switches, and miswires in a given network is provided. Given a number of switches, which may be less than the maximum possible for the actual configuration and some ports of which may be miswired, generate a hypothesis for the supported topology of which the existing configuration is a subset. A best fit of the existing switches to the supported number switches of the maximal topology is performed, using formulae for the connections of the maximal supported topology. If supported switches are found missing in the assumed topology, the switch count is increased accordingly, and started over with a new hypothesis. When satisfied with identification, all switch ports are revisited and the connection formulae is used to identify all miswires.

摘要翻译： 提供了在给定网络中识别配置拓扑，现有交换机和误接线的示例性方法。 给定多个交换机，其可能小于实际配置的最大可能性，并且其某些端口可能被误接线，为支持的拓扑生成假设，其中现有配置是子集。 使用最大支持拓扑的连接公式，实现现有交换机对最大拓扑支持的数字交换机的最佳拟合。 如果在假定的拓扑中发现缺少支持的交换机，则交换机计数相应增加，并以新的假设开始。 当识别满足时，重新访问所有交换机端口，并使用连接公式来识别所有的误接线。

公开(公告)号：US08108731B2

公开(公告)日：2012-01-31

申请号：US12428767

申请日：2009-04-23

申请人： Casimer M. DeCusatis ,  Aruna V. Ramanan ,  Edward J. Seminaro ,  Alison B. White ,  Daniel G. Young

发明人： Casimer M. DeCusatis ,  Aruna V. Ramanan ,  Edward J. Seminaro ,  Alison B. White ,  Daniel G. Young

IPC分类号： G06F11/00

CPC分类号： G06F11/0751 ,  G06F11/0724 ,  G06F15/177 ,  H04L12/40013

摘要： A method of validating a configuration of a computer clusters includes transmitting a first neighbor identification to a first flexible service processor (FSP) arranged in the first computer cluster and a second neighbor identification to a second FSP arranged in the second computer cluster, connecting a first end of a cable to a first transceiver arranged in the first cluster and connecting a second end of the cable to a second transceiver arranged in the second cluster. The first neighbor identification is passed from the first transceiver to the second computer cluster and the second neighbor identification is passed from the second transceiver toward the first computer cluster. The first neighbor identification is compared with a desired first neighbor identification to establish a first comparison result, and the second neighbor identification is compared with a desired second neighbor identification to establish a second comparison result and a notice is generated.

摘要翻译： 验证计算机集群的配置的方法包括：向布置在第一计算机集群中的第一灵活服务处理器（FSP）发送第一邻居标识，并将第二邻居标识发送到布置在第二计算机集群中的第二FSP， 将电缆的一端连接到布置在第一集群中的第一收发器，并将电缆的第二端连接到布置在第二集群中的第二收发器。 第一邻居标识从第一收发器传递到第二计算机集群，并且第二邻居标识从第二收发器传送到第一计算机集群。 将第一邻居识别与期望的第一邻居标识进行比较以建立第一比较结果，并将第二邻居标识与期望的第二邻居标识进行比较，以建立第二比较结果并生成通知。

公开(公告)号：US08020050B2

公开(公告)日：2011-09-13

申请号：US12428857

申请日：2009-04-23

申请人： Casimer M. DeCusatis ,  Aruna V. Ramanan ,  Edward J. Seminaro ,  Alison B. White ,  Daniel G. Young

发明人： Casimer M. DeCusatis ,  Aruna V. Ramanan ,  Edward J. Seminaro ,  Alison B. White ,  Daniel G. Young

IPC分类号： G06F11/00

CPC分类号： G06F11/0751 ,  G06F11/0724 ,  G06F15/177 ,  H04L12/40013

摘要： A method of validating multi-cluster computer interconnects includes calculating a cable interconnect table associated with the multi-cluster computer, and distributing the cable interconnect table to a first transceiver in the first computer cluster and a second transceiver in the second computer cluster. The method also includes connecting a first end of a cable to the first transceiver and a second end of the cable to the second transceiver, transmitting a first neighbor identification from the first cluster to the second cluster, and a second neighbor identification from the second cluster to the first cluster, comparing the first neighbor identification with a desired first neighbor identification from the cable interconnect table to establish a first comparison result and the second neighbor identification with a desired second identification from the cable interconnect table to establish a second comparison result, and generating an alert based on the first and second comparison results.

摘要翻译： 验证多集群计算机互连的方法包括计算与多群集计算机相关联的电缆互连表，并将电缆互连表分配到第一计算机集群中的第一收发器和第二计算机集群中的第二收发器。 该方法还包括将电缆的第一端连接到第一收发器，将电缆的第二端连接到第二收发器，将第一邻居标识从第一集群发送到第二集群，以及从第二集群发送第二邻居标识 将所述第一邻居标识与来自所述电缆互连表的期望的第一邻居标识进行比较，以从所述电缆互连表建立第一比较结果和所述第二邻居标识，以建立第二比较结果，以及 基于第一和第二比较结果生成警报。

公开(公告)号：US08018844B2

公开(公告)日：2011-09-13

申请号：US11210980

申请日：2005-08-24

申请人： Carl A. Bender ,  Aruna V. Ramanan ,  Nicholas P. Rash ,  Karen F. Rash, legal representative

发明人： Carl A. Bender ,  Aruna V. Ramanan ,  Nicholas P. Rash

IPC分类号： H04J1/16

CPC分类号： H04L45/24 ,  H04L41/06 ,  H04L43/0817 ,  H04L45/02 ,  H04L45/28 ,  H04L45/54

摘要： In a communications network having a plurality of nodes adapted to communicate with each other, and more than one path available between most source-destination node-pairs, a network interface is associated with each node. Each network interface has a plurality of route tables for defining a plurality of routes for transferring each packet from a source node to a destination node. Each network interface further includes a path status table of path status indicators, e.g., bits, for indicating whether each route in the route tables is usable or is unusable as being associated with a fault. The network manager monitors the network to identify faults and provides the path status indicators to the respective network interfaces. Failed routes in the network are avoided based on the path status indicators. When a failed route is restored, such that the route is usable again, the path status table indicates that the usable state is restored. A balance of route usage in the network is maintained, without modifying routes or establishing different routes, enabling reliable and high-performance message transfer.

摘要翻译： 在具有适于彼此通信的多个节点以及多个源 - 目的地节点对之间可用的多于一个路径的通信网络中，网络接口与每个节点相关联。 每个网络接口具有多个路由表，用于定义用于将每个分组从源节点传送到目的地节点的多个路由。 每个网络接口还包括路径状态指示符（例如位）的路径状态表，用于指示路由表中的每个路由是否可用或不能用于与故障相关联。 网络管理器监视网络以识别故障，并将路径状态指示器提供给各个网络接口。 基于路径状态指示灯可以避免网络中的路由失败。 当路由恢复失败时，路由可以再次使用，路径状态表指示恢复可用状态。 保持网络中路由使用的平衡，不修改路由或建立不同的路由，实现可靠，高性能的消息传递。

公开(公告)号：US20100275064A1

公开(公告)日：2010-10-28

申请号：US12428767

申请日：2009-04-23

申请人： Casimer M. DeCusatis ,  Aruna V. Ramanan ,  Edward J. Seminaro ,  Alison B. White ,  Daniel G. Young

发明人： Casimer M. DeCusatis ,  Aruna V. Ramanan ,  Edward J. Seminaro ,  Alison B. White ,  Daniel G. Young

IPC分类号： G06F11/28 ,  G06F11/07

CPC分类号： G06F11/0751 ,  G06F11/0724 ,  G06F15/177 ,  H04L12/40013

摘要： A method of validating a configuration of a computer clusters includes transmitting a first neighbor identification to a first flexible service processor (FSP) arranged in the first computer cluster and a second neighbor identification to a second FSP arranged in the second computer cluster, connecting a first end of a cable to a first transceiver arranged in the first cluster and connecting a second end of the cable to a second transceiver arranged in the second cluster. The first neighbor identification is passed from the first transceiver to the second computer cluster and the second neighbor identification is passed from the second transceiver toward the first computer cluster. The first neighbor identification is compared with a desired first neighbor identification to establish a first comparison result, and the second neighbor identification is compared with a desired second neighbor identification to establish a second comparison result and a notice is generated.

摘要翻译： 验证计算机集群的配置的方法包括：向布置在第一计算机集群中的第一灵活服务处理器（FSP）发送第一邻居标识，并将第二邻居标识发送到布置在第二计算机集群中的第二FSP， 将电缆的一端连接到布置在第一集群中的第一收发器，并将电缆的第二端连接到布置在第二集群中的第二收发器。 第一邻居标识从第一收发器传递到第二计算机集群，并且第二邻居标识从第二收发器传送到第一计算机集群。 将第一邻居识别与期望的第一邻居标识进行比较以建立第一比较结果，并将第二邻居标识与期望的第二邻居标识进行比较，以建立第二比较结果并生成通知。

公开(公告)号：US07573810B2

公开(公告)日：2009-08-11

申请号：US11302786

申请日：2005-12-14

申请人： Jay R. Herring ,  Aruna V. Ramanan ,  Karen F. Rash, legal representative

发明人： Nicholas P. Rash

IPC分类号： H04J1/16

CPC分类号： H04Q3/0079 ,  H04L69/40

摘要： Deadlocks are avoided in performing failovers in communications environments that include partnered interfaces. An ordered set of steps are performed to failover from one interface of a partnered interface to another interface of the partnered interface such that deadlocks are avoided.

摘要翻译： 在包括合作接口的通信环境中执行故障切换时，可以避免死锁。 执行一组有序的步骤以从合作接口的一个接口故障转移到合作接口的另一个接口，从而避免死锁。

公开(公告)号：US07522541B2

公开(公告)日：2009-04-21

申请号：US10962635

申请日：2004-10-11

申请人： LeRoy R. Lundin ,  Casandra H. Qiu ,  Aruna V. Ramanan

发明人： LeRoy R. Lundin ,  Casandra H. Qiu ,  Aruna V. Ramanan

IPC分类号： H04L12/28

CPC分类号： H04L49/15

摘要： An exemplary method of identifying configuration topology, existing switches, and miswires in a given network is provided. Given a number of switches, which may be less than the maximum possible for the actual configuration and some ports of which may be miswired, generate a hypothesis for the supported topology of which the existing configuration is a subset. Perform a best fit of the existing switches to the supported number switches of the maximal topology, using formulae for the connections of the maximal supported topology. If supported switches are found missing in the assumed topology, increase the switch count accordingly, and start over with a new hypothesis. When satisfied with identification, revisit all switch ports and use the connection formulae to identify all miswires.

摘要翻译： 提供了在给定网络中识别配置拓扑，现有交换机和误接线的示例性方法。 给定多个交换机，其可能小于实际配置的最大可能性，并且其某些端口可能被误接线，为支持的拓扑生成假设，其中现有配置是子集。 使用最大支持拓扑的连接公式，将现有交换机的最佳配置与最大拓扑支持的数字交换机配合使用。 如果在假定的拓扑中发现支持的交换机丢失，则相应地增加交换机数量，并重新开始一个新的假设。 当满足识别时，重新访问所有交换机端口，并使用连接公式来识别所有的误接线。