Graph partitioning strategy for the topology design of industrial network

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