发明名称 Method for automatic partitioning of node-weighted, edge-constrained graphs
摘要 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.
申请公布号 US6437804(B1) 申请公布日期 2002.08.20
申请号 US19970956831 申请日期 1997.10.23
申请人 APRISMA MANAGEMENT TECHNOLOGIES, INC 发明人 IBE OLIVER;VAISHNAVI VICK;DEV ROGER
分类号 G06F17/50;(IPC1-7):G09G5/00 主分类号 G06F17/50
代理机构 代理人
主权项
地址