会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明申请
    • LINK INFERENCE IN LARGE NETWORKS BASED ON INCOMPLETE DATA
    • 基于不完整数据的大型网络中的链接干扰
    • WO2008016861A2
    • 2008-02-07
    • PCT/US2007/074679
    • 2007-07-29
    • BALASUBRAMANIAM, RajeshSHAW, James Mark
    • BALASUBRAMANIAM, RajeshSHAW, James Mark
    • H04L45/14H04L12/4641H04L45/02H04L45/48
    • 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数据的辅助信息可以用于促进有效分割和/或验证由不完整信息进行的推断。