会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明授权
    • Method for automatic partitioning of node-weighted, edge-constrained graphs
    • 自动划分节点加权边缘约束图的方法
    • US06437804B1
    • 2002-08-20
    • US08956831
    • 1997-10-23
    • Oliver IbeVick VaishnaviRoger Dev
    • Oliver IbeVick VaishnaviRoger Dev
    • G09G500
    • G06F17/509G06F2217/06G06F2217/74
    • According to an embodiment of the present invention, a method is provided for partitioning a network, comprising modeling the network as a graph comprising nodes which represent network devices, and edges which represent links between the devices, and automatically partitioning the graph into domains. One embodiment of the method includes identifying a number of anchor nodes in the graph and partitioning the domains around the anchor nodes such that each domain contains only one anchor node. Another embodiment of the method includes partitioning a graph without anchor nodes into a number of domains, and assigning controllers to each of the domains. Preferably, the method further includes assigning a weight to each node in the graph, and balancing the partitions as a function of the weight of each node in a respective partition.
    • 根据本发明的实施例,提供了一种用于划分网络的方法,包括将网络建模为包括表示网络设备的节点的图,以及表示设备之间的链路的边缘,以及将该图自动划分为域。 该方法的一个实施例包括识别图中的多个锚节点并且分割锚节点周围的域,使得每个域仅包含一个锚节点。 该方法的另一实施例包括将没有锚节点的图划分成多个域,并将控制器分配给每个域。 优选地,该方法还包括向图中的每个节点分配权重,以及根据相应分区中的每个节点的权重来平衡分区。