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

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

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

公开(公告)号：US20080071840A1

公开(公告)日：2008-03-20

申请号：US11531722

申请日：2006-09-14

Applicant: Viswanath Srikanth ,  Rajesh Balasubramaniam ,  Marcelo Perazolo ,  Carlos Hoyos

Inventor： Viswanath Srikanth ,  Rajesh Balasubramaniam ,  Marcelo Perazolo ,  Carlos Hoyos

IPC: G06F17/30

CPC classification number: G06F16/2255

Abstract: A representation of static and dynamic nested kits in an existing e-commerce ordering system to facilitate migration of existing e-commerce systems to support nested kits. Physical components of a nested kit remain in an order item table of a database, but non-physical components are placed in a separate database table, and the in-memory representation of the nested kit is represented as a hash-map of nodes, where each node is aware of its parent and child relationship.

Abstract translation: 在现有电子商务订购系统中呈现静态和动态嵌套套件，以便于现有电子商务系统迁移以支持嵌套工具包。 嵌套套件的物理组件保留在数据库的订单项表中，但非物理组件放置在单独的数据库表中，嵌套套件的内存中表示形式表示为节点的散列映射，其中 每个节点都知道其父和子关系。

公开(公告)号：US08089904B2

公开(公告)日：2012-01-03

申请号：US11829925

申请日：2007-07-29

Applicant: Rajesh Balasubramaniam ,  James Mark Shaw

Inventor： Rajesh Balasubramaniam ,  James Mark Shaw

IPC: H04L12/28

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