Graph partitioning strategy for the topology design of industrial network

摘要: Network topology design problem in industrial network is formulated, which shown to be equivalent a multi-constraint optimisation problem: the should minimise amount of inter-network communication, and simultaneously balance communication load size evenly over resultant sub-networks. To solve this problem, graph partitioning strategy proposed, can give good by graph-based representation problem. Then, procedures using are detailed two experimental, examples studied. In experiments, designs obtained compared with those random method. The experimental results demonstrate significantly better than