Invention Application
- Patent Title: LINK INFERENCE IN LARGE NETWORKS BASED ON INCOMPLETE DATA
- Patent Title (中): 基于不完整数据的大型网络中的链接干扰
-
Application No.: US13301688Application Date: 2011-11-21
-
Publication No.: US20120300675A1Publication Date: 2012-11-29
- Inventor: Raghavendra Uppalli , Rajesh BALASUBRAMANIAM , James Mark SHAW
- Applicant: Raghavendra Uppalli , Rajesh BALASUBRAMANIAM , James Mark SHAW
- Main IPC: H04L12/44
- IPC: H04L12/44

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.
Public/Granted literature
- US08670352B2 Link inference in large networks based on incomplete data Public/Granted day:2014-03-11
Information query