公开(公告)号：US20120207058A1

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

申请号：US13454034

申请日：2012-04-23

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: Networks and devices may communicate with each other using virtual connections. In one embodiment, a computer-implemented model is generated and includes a representation of the path of a virtual connection. The path of a virtual connection, such as an IP tunnel, is traced between its source and destination. The physical connection corresponding to such IP tunnels are found by tracing through the device configuration and routing tables at routers in the network. The path between the source and destination devices is traced 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隧道之类的虚拟连接的路径在源和目的地之间进行跟踪。 通过在网络中的路由器上的设备配置和路由表进行跟踪来查找对应于此类IP隧道的物理连接。 跟踪源设备和目标设备之间的路径，直到路径终止于目标设备，或在外部网络的接口处。 如果路径在外部网络中结束，路径将从目标设备追溯到源设备，直到到达外部网络的相应接口。

公开(公告)号：US20110085450A1

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

申请号：US12900357

申请日：2010-10-07

Applicant: Vinod JEYACHANDRAN ,  Pradeep Natarajan ,  James Mark Shaw ,  Raghavendra Uppalli ,  Pradeep Singh ,  Nitin Gupta ,  Jerrold Stiffler

Inventor： Vinod JEYACHANDRAN ,  Pradeep Natarajan ,  James Mark Shaw ,  Raghavendra Uppalli ,  Pradeep Singh ,  Nitin Gupta ,  Jerrold Stiffler

IPC: H04L12/26

CPC classification number: H04L41/12 ,  H04L41/0213

Abstract: A network analysis system invokes an application specific, or source-destination specific, path discovery process. The application specific path discovery process determines the path(s) used by the application, collects performance data from the nodes along the path, and communicates this performance data to the network analysis system for subsequent performance analysis. The system may also maintain a database of prior network configurations to facilitate the identification of nodes that are off the path that may affect the current performance of the application. The system may also be specifically controlled so as to identify the path between any pair of specified nodes, and to optionally collect performance data associated with the path.

Abstract translation: 网络分析系统调用特定于应用程序或源特定路径的路径发现过程。 应用程序特定路径发现过程确定应用程序使用的路径，从沿着路径的节点收集性能数据，并将该性能数据传达到网络分析系统以进行后续性能分析。 系统还可以维护先前网络配置的数据库，以便于识别可能影响应用的当前性能的路径之外的节点。 还可以特别地控制系统，以便识别任何一对指定节点之间的路径，并且可选地收集与该路径相关联的性能数据。

公开(公告)号：US08724494B2

公开(公告)日：2014-05-13

申请号：US13210351

申请日：2011-08-15

Applicant: Raghavendra Uppalli ,  James Mark Shaw ,  Pradeep Natarajan ,  Alain Cohen

Inventor： Raghavendra Uppalli ,  James Mark Shaw ,  Pradeep Natarajan ,  Alain Cohen

IPC: H04L12/26

CPC classification number: H04L45/26 ,  H04L41/0213 ,  H04L41/12

Abstract: Potential paths between a source and destination of a network are identified based on trace-route information, then filtered to eliminate paths or links that are not supported by ancillary information associated with the network so as to identify feasible/actual paths between the source and destination. The ancillary information includes, for example, routing tables and ARP tables. If a feasible path cannot be identified based on the ancillary information, supplemental information regarding nodes further along the potential path is assessed to provide a basis for inferring the nodes that may provide a feasible path. The determined feasible paths are displayed for review, and provided to serve as filters for subsequent path-analysis tools.

Abstract translation: 基于跟踪路由信息来识别网络的源和目的地之间的潜在路径，然后被过滤以消除与网络相关联的辅助信息不支持的路径或链路，以便识别源和目的地之间的可行/实际路径 。 辅助信息包括例如路由表和ARP表。 如果不能基于辅助信息识别可行路径，则评估关于沿着潜在路径进一步的节点的补充信息，以提供推断可能提供可行路径的节点的基础。 确定的可行路径被显示以供审查，并提供用作后续路径分析工具的过滤器。

公开(公告)号：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数据的辅助信息可以用于促进有效分割和/或验证由不完整信息进行的推理。

公开(公告)号：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层路径信息的路径信息，并呈现给用户。 在一个实施例中，一旦解决了路径信息就以迭代（或逐渐）的方式提供给用户。 这允许用户快速访问路径信息，这两者都减少了故障排除时间并增强了用户体验。 此外，在一个实施例中，可以提供路径信息而不与网络中的任何设备进行任何实时交互。

公开(公告)号：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数据的辅助信息可以用于促进有效分割和/或验证由不完整信息进行的推理。

公开(公告)号：US20120182903A1

公开(公告)日：2012-07-19

申请号：US13430541

申请日：2012-03-26

Applicant: Raghavendra B. Uppalli ,  James Mark Shaw

Inventor： Raghavendra B. Uppalli ,  James Mark Shaw

IPC: H04L12/28

CPC classification number: G06N5/04 ,  H04L41/12 ,  H04Q3/0062 ,  Y02D30/30

Abstract: The connectivity information provided by a variety of inference engines is integrated to provide a set of inferred links within a network. A consolidation is performed among inference engines that operate at a base level of connectivity detail to create a model of the network at this base level. The connectivity information provided by inference engines at each subsequent higher level of connectivity abstraction is then overlaid on the base level connectivity. By separately consolidating the connectivity information at each level of abstraction, the rules for dealing with conflicts can be simplified and/or better focused to resolve the conflict. By assuming that the more detailed lower level information is likely to be more accurate, rules can be developed to modify the connectivity models produced by the higher level techniques to conform to the lower level connectivity details while still maintaining the integrity of the higher level connectivity models.

Abstract translation: 由各种推理机提供的连接信息被集成以在网络内提供一组推断的链接。 推理引擎之间进行合并，这些推理引擎在基础级别的连接细节下运行，以在该基础级别创建网络模型。 然后在每个后续更高级别的连接抽象时由推理引擎提供的连接信息覆盖在基本级别的连接性上。 通过在每个抽象级别单独合并连接信息，可以简化和/或更好地集中解决冲突的规则来解决冲突。 通过假设更详细的较低级别信息可能更准确，可以开发规则来修改由较高级别技术产生的连接性模型，以符合较低级别的连接细节，同时仍保持较高级别连接模型的完整性 。

公开(公告)号：US20080031156A1

公开(公告)日：2008-02-07

申请号：US11829925

申请日：2007-07-29

Applicant: Rajesh Balasubramaniam ,  James Mark Shaw

Inventor： Rajesh Balasubramaniam ,  James Mark Shaw

IPC: H04L12/24

CPC classification number: H04L41/12 ,  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数据的辅助信息可以用于促进有效分割和/或验证由不完整信息进行的推理。

公开(公告)号：US08743736B2

公开(公告)日：2014-06-03

申请号：US13430541

申请日：2012-03-26

Applicant: Raghavendra B. Uppalli ,  James Mark Shaw

Inventor： Raghavendra B. Uppalli ,  James Mark Shaw

IPC: H04L12/28

CPC classification number: G06N5/04 ,  H04L41/12 ,  H04Q3/0062 ,  Y02D30/30

Abstract: The connectivity information provided by a variety of inference engines is integrated to provide a set of inferred links within a network. A consolidation is performed among inference engines that operate at a base level of connectivity detail to create a model of the network at this base level. The connectivity information provided by inference engines at each subsequent higher level of connectivity abstraction is then overlaid on the base level connectivity. By separately consolidating the connectivity information at each level of abstraction, the rules for dealing with conflicts can be simplified and/or better focused to resolve the conflict. By assuming that the more detailed lower level information is likely to be more accurate, rules can be developed to modify the connectivity models produced by the higher level techniques to conform to the lower level connectivity details while still maintaining the integrity of the higher level connectivity models.

Abstract translation: 由各种推理机提供的连接信息被集成以在网络内提供一组推断的链接。 推理引擎之间进行合并，这些推理引擎在基础级别的连接细节下运行，以在该基础级别创建网络模型。 然后在每个后续更高级别的连接抽象时由推理引擎提供的连接信息覆盖在基本级别的连接性上。 通过在每个抽象级别单独合并连接信息，可以简化和/或更好地集中解决冲突的规则来解决冲突。 通过假设更详细的较低级别信息可能更准确，可以开发规则来修改由较高级别技术产生的连接性模型，以符合较低级别的连接细节，同时仍保持较高级别连接模型的完整性 。

公开(公告)号：US08670352B2

公开(公告)日：2014-03-11

申请号：US13301688

申请日：2011-11-21

Applicant: Raghavendra Uppalli ,  Rajesh Balasubramaniam ,  James Mark Shaw

Inventor： Raghavendra Uppalli ,  Rajesh Balasubramaniam ,  James Mark Shaw

IPC: H04L12/28

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数据的辅助信息可以用于促进有效分割和/或验证由不完整信息进行的推理。