公开(公告)号：US20140056180A1

公开(公告)日：2014-02-27

申请号：US14070475

申请日：2013-11-01

Applicant: Rajesh BALASUBRAMANIAM ,  James Mark SHAW

Inventor： Rajesh BALASUBRAMANIAM ,  James Mark SHAW

IPC: H04L12/24

CPC classification number: H04L41/12 ,  H04L12/4625 ,  H04L12/66

Abstract: A network is partitioned into a set of independent partitions, and the topology of each partition is determined, then merged to form a topology of the entire network. Preferably, the partitioning is hierarchical, wherein the network is partitioned to form individual VLAN partitions, and each of the VLAN partitions is further partitioned based on the nodes that are simply connected to each port of one or more selected root switches within the VLAN partition. Simple connections to each port are efficiently determined based on an aggregate address forwarding table associated with each node. Ancillary information, such as spanning tree or CDP data, may be used to facilitate efficient partitioning and/or to validate inferences that are made with incomplete information.

Abstract translation: 将网络划分为一组独立分区，确定每个分区的拓扑，然后合并形成整个网络的拓扑。 优选地，分区是分级的，其中网络被分割以形成单独的VLAN分区，并且基于简单地连接到VLAN分区内的一个或多个所选根交换机的每个端口的节点来进一步分割每个VLAN分区。 基于与每个节点相关联的聚合地址转发表，有效地确定到每个端口的简单连接。 诸如生成树或CDP数据的辅助信息可以用于促进有效分割和/或验证由不完整信息进行的推理。

公开(公告)号：US20120300675A1

公开(公告)日：2012-11-29

申请号：US13301688

申请日：2011-11-21

Applicant: Raghavendra Uppalli ,  Rajesh BALASUBRAMANIAM ,  James Mark SHAW

Inventor： Raghavendra Uppalli ,  Rajesh BALASUBRAMANIAM ,  James Mark SHAW

IPC: H04L12/44

CPC classification number: H04L41/12 ,  H04L12/4625 ,  H04L12/66

Abstract: A network is partitioned into a set of independent partitions, and the topology of each partition is determined, then merged to form a topology of the entire network. Preferably, the partitioning is hierarchical, wherein the network is partitioned to form individual VLAN partitions, and each of the VLAN partitions is further partitioned based on the nodes that are simply connected to each port of one or more selected root switches within the VLAN partition. Simple connections to each port are efficiently determined based on an aggregate address forwarding table associated with each node. Ancillary information, such as spanning tree or CDP data, may be used to facilitate efficient partitioning and/or to validate inferences that are made with incomplete information.

Abstract translation: 将网络划分为一组独立分区，确定每个分区的拓扑，然后合并形成整个网络的拓扑。 优选地，分区是分级的，其中网络被分割以形成单独的VLAN分区，并且基于简单地连接到VLAN分区内的一个或多个所选根交换机的每个端口的节点来进一步分割每个VLAN分区。 基于与每个节点相关联的聚合地址转发表，有效地确定到每个端口的简单连接。 诸如生成树或CDP数据的辅助信息可以用于促进有效分割和/或验证由不完整信息进行的推理。

公开(公告)号：US20080310326A1

公开(公告)日：2008-12-18

申请号：US12192103

申请日：2008-08-14

Applicant: James Mark SHAW ,  Raghavendra B. Uppalli

Inventor： James Mark SHAW ,  Raghavendra B. Uppalli

IPC: H04L12/28

CPC classification number: H04L12/4633 ,  H04L45/04 ,  H04L45/10

Abstract: The physical connection corresponding to IP tunnels in a network are found by tracing through the device configuration and routing tables at the routers in the network to determine the outbound interface associated with each tunnel endpoint, and then inferring a likely return interface associated with the opposite tunnel endpoint. Having determined the physical devices at the source and destination of each tunnel, the physical path between these source and destination devices is traced from the source toward the destination until the path is terminated at the destination device, or at an interface to an external network. If the path ends at an external network, the path is traced from the destination device toward the source device until a corresponding interface to the external network is reached.

Abstract translation: 通过在网络中的路由器上跟踪设备配置和路由表来确定与网络中IP隧道对应的物理连接，以确定与每个隧道端点相关联的出站接口，然后推断与相对隧道相关联的可能的返回接口 端点。 在确定每个隧道的源和目的地的物理设备之后，这些源设备和目的设备之间的物理路径从源向目的地追踪，直到路径终止于目标设备，或在外部网络的接口处。 如果路径在外部网络中结束，路径将从目标设备追溯到源设备，直到到达外部网络的相应接口。

公开(公告)号：US20100046395A1

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

申请号：US12544317

申请日：2009-08-20

Applicant: Krishnan SIVARAMAKRISHNA IYER ,  James Mark SHAW ,  Jerrold A. STIFFLER

Inventor： Krishnan SIVARAMAKRISHNA IYER ,  James Mark SHAW ,  Jerrold A. STIFFLER

IPC: H04L12/28

CPC classification number: H04L41/12

Abstract: A method and/or system is configured to improve the results of an auto-detection of network devices based on the causes of detection failures in preceding runs of the auto-detection process. As each device that is believed to be in the network is found to be undiscovered, the identification of the device and information regarding the cause(s) of non-discovery are stored. Prior to the next auto-detection run, one or more of the discovery parameters are modified, based on the causes associated with the undiscovered devices. The extent to which the discovery parameters are modified is preferably based on the apparent stability of the network, or upon the detection of changes to the network.

Abstract translation: 一种方法和/或系统被配置为基于自动检测过程的先前运行中的检测失败的原因来改进网络设备的自动检测结果。 被认为在网络中的每个设备被发现是未被发现的，存储设备的识别和关于非发现的原因的信息。 在下一次自动检测运行之前，将根据与未发现的设备相关联的原因修改一个或多个发现参数。 发现参数被修改的程度优选地基于网络的表观稳定性，或者基于检测到网络的改变。

公开(公告)号：US20140201359A1

公开(公告)日：2014-07-17

申请号：US14151782

申请日：2014-01-09

Applicant: Raghavendra B. UPPALLI ,  James Mark SHAW

Inventor： Raghavendra B. UPPALLI ,  James Mark SHAW

IPC: H04L12/751

CPC classification number: H04L45/02 ,  H04L41/12 ,  H04L45/42

Abstract: A method and system that takes advantage of processes that are efficient for determining the topology of small to medium size networks to determine individual network topologies for such networks, and then merges these individual topologies into a consolidated topology for the entire network. Each of the processes that determines the topology of the smaller networks provides the determined network topology, as well as a list of factors that may be relevant in the determination of how the given topology might be attached to any other given topology, such as the identification of a node that is not included in the given topology, or other indications of external connections. The merging process is configured to substantially restrict its analysis to these factors, thereby limiting the extent, and therefore the time consumed, by this stitching and merging process.

Abstract translation: 利用有效确定中小型网络拓扑以确定这种网络的单独网络拓扑的过程的方法和系统，然后将这些单独的拓扑结合到整个网络的整合拓扑中。 确定较小网络的拓扑的每个过程提供确定的网络拓扑，以及可能与确定给定拓扑如何附加到任何其他给定拓扑有关的因素的列表，例如识别 不包括在给定拓扑中的节点，或外部连接的其他指示。 合并过程被配置为将其分析基本上限制在这些因素上，从而限制了该缝合和合并过程的程度，并因此限制了消耗的时间。

公开(公告)号：US20130042020A1

公开(公告)日：2013-02-14

申请号：US13568988

申请日：2012-08-07

Applicant: Jerrold STIFFLER ,  Raghavendra UPPALLI ,  James Mark SHAW

Inventor： Jerrold STIFFLER ,  Raghavendra UPPALLI ,  James Mark SHAW

IPC: G06F15/173

CPC classification number: H04L45/12

Abstract: Embodiments for quick network path discovery are provided. Embodiments may be used by a user (e.g., network administrator) in troubleshooting a performance/communication problem in the network. M an embodiment, path information, including Layer-3 and/or Layer-2 path information, can be requested between any pair of devices in the network and presented to the user. In an embodiment, path information is provided to the user in an iterative (or gradual) manner as soon as resolved. This allows the user quick access to path information, which both reduces troubleshooting time and enhances the user experience. In addition, in an embodiment, the path information may be provided without any live interaction with any device in the network.

Abstract translation: 提供了快速网路发现的实施例。 用户（例如，网络管理员）可以使用实施例来对网络中的性能/通信问题进行故障排除。 在实施例中，可以在网络中的任何一对设备之间请求包括第3层和/或第2层路径信息的路径信息，并呈现给用户。 在一个实施例中，一旦解决了路径信息就以迭代（或逐渐）的方式提供给用户。 这允许用户快速访问路径信息，这两者都减少了故障排除时间并增强了用户体验。 此外，在一个实施例中，可以提供路径信息而不与网络中的任何设备进行任何实时交互。