会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • LINK INFERENCE IN LARGE NETWORKS BASED ON INCOMPLETE DATA
    • 基于不完整数据的大型网络中的链接干扰
    • US20080031156A1
    • 2008-02-07
    • US11829925
    • 2007-07-29
    • Rajesh BalasubramaniamJames Mark Shaw
    • Rajesh BalasubramaniamJames Mark Shaw
    • H04L12/24
    • H04L41/12H04L12/66
    • 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.
    • 将网络划分为一组独立分区,确定每个分区的拓扑,然后合并形成整个网络的拓扑。 优选地,分区是分级的,其中网络被分割以形成单独的VLAN分区,并且基于简单地连接到VLAN分区内的一个或多个所选根交换机的每个端口的节点来进一步分割每个VLAN分区。 基于与每个节点相关联的聚合地址转发表,有效地确定到每个端口的简单连接。 诸如生成树或CDP数据的辅助信息可以用于促进有效分割和/或验证由不完整信息进行的推理。
    • 2. 发明授权
    • Link inference in large networks based on incomplete data
    • 基于不完整数据的大型网络中的链路推断
    • US08089904B2
    • 2012-01-03
    • US11829925
    • 2007-07-29
    • Rajesh BalasubramaniamJames Mark Shaw
    • Rajesh BalasubramaniamJames Mark Shaw
    • H04L12/28
    • H04L41/12H04L12/66
    • 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.
    • 将网络划分为一组独立分区,确定每个分区的拓扑,然后合并形成整个网络的拓扑。 优选地,分区是分级的,其中网络被分割以形成单独的VLAN分区,并且基于简单地连接到VLAN分区内的一个或多个所选根交换机的每个端口的节点来进一步分割每个VLAN分区。 基于与每个节点相关联的聚合地址转发表,有效地确定到每个端口的简单连接。 诸如生成树或CDP数据的辅助信息可以用于促进有效分割和/或验证由不完整信息进行的推理。
    • 3. 发明授权
    • Link inference in large networks based on incomplete data
    • 基于不完整数据的大型网络中的链路推理
    • US08670352B2
    • 2014-03-11
    • US13301688
    • 2011-11-21
    • Raghavendra UppalliRajesh BalasubramaniamJames Mark Shaw
    • Raghavendra UppalliRajesh BalasubramaniamJames Mark Shaw
    • H04L12/28
    • H04L41/12H04L12/4625H04L12/66
    • 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.
    • 将网络划分为一组独立分区,确定每个分区的拓扑,然后合并形成整个网络的拓扑。 优选地,分区是分级的,其中网络被分割以形成单独的VLAN分区,并且基于简单地连接到VLAN分区内的一个或多个所选根交换机的每个端口的节点来进一步分割每个VLAN分区。 基于与每个节点相关联的聚合地址转发表,有效地确定到每个端口的简单连接。 诸如生成树或CDP数据的辅助信息可以用于促进有效分割和/或验证由不完整信息进行的推理。
    • 7. 发明授权
    • Network multi-path discovery
    • 网络多路径发现
    • US08724494B2
    • 2014-05-13
    • US13210351
    • 2011-08-15
    • Raghavendra UppalliJames Mark ShawPradeep NatarajanAlain Cohen
    • Raghavendra UppalliJames Mark ShawPradeep NatarajanAlain Cohen
    • H04L12/26
    • H04L45/26H04L41/0213H04L41/12
    • 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.
    • 基于跟踪路由信息来识别网络的源和目的地之间的潜在路径,然后被过滤以消除与网络相关联的辅助信息不支持的路径或链路,以便识别源和目的地之间的可行/实际路径 。 辅助信息包括例如路由表和ARP表。 如果不能基于辅助信息识别可行路径,则评估关于沿着潜在路径进一步的节点的补充信息,以提供推断可能提供可行路径的节点的基础。 确定的可行路径被显示以供审查,并提供用作后续路径分析工具的过滤器。
    • 8. 发明申请
    • INFERRING CONNECTIVITY IN THE PRESENCE OF CONFLICTING NETWORK DATA
    • 影响网络数据冲突的连接
    • US20120182903A1
    • 2012-07-19
    • US13430541
    • 2012-03-26
    • Raghavendra B. UppalliJames Mark Shaw
    • Raghavendra B. UppalliJames Mark Shaw
    • H04L12/28
    • G06N5/04H04L41/12H04Q3/0062Y02D30/30
    • 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.
    • 由各种推理机提供的连接信息被集成以在网络内提供一组推断的链接。 推理引擎之间进行合并,这些推理引擎在基础级别的连接细节下运行,以在该基础级别创建网络模型。 然后在每个后续更高级别的连接抽象时由推理引擎提供的连接信息覆盖在基本级别的连接性上。 通过在每个抽象级别单独合并连接信息,可以简化和/或更好地集中解决冲突的规则来解决冲突。 通过假设更详细的较低级别信息可能更准确,可以开发规则来修改由较高级别技术产生的连接性模型,以符合较低级别的连接细节,同时仍保持较高级别连接模型的完整性 。
    • 9. 发明授权
    • Method and systems for determining path of a virtual connection through a network
    • 用于确定通过网络的虚拟连接的路径的方法和系统
    • US08948049B2
    • 2015-02-03
    • US13454034
    • 2012-04-23
    • James Mark ShawRaghavendra B. Uppalli
    • James Mark ShawRaghavendra B. Uppalli
    • H04L12/28H04L12/46H04L12/715H04L12/751
    • H04L12/4633H04L45/04H04L45/10
    • 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.
    • 网络和设备可以使用虚拟连接相互通信。 在一个实施例中,生成计算机实现的模型并且包括虚拟连接的路径的表示。 诸如IP隧道之类的虚拟连接的路径在源和目的地之间进行跟踪。 通过在网络中的路由器上的设备配置和路由表进行跟踪来查找对应于此类IP隧道的物理连接。 跟踪源设备和目标设备之间的路径,直到路径终止于目标设备,或在外部网络的接口处。 如果路径在外部网络中结束,路径将从目标设备追溯到源设备,直到到达外部网络的相应接口。