Research Article
Graph Partition Based Traffic Balance in Industrial Network
@INPROCEEDINGS{10.1109/CHINACOM.2007.4469422, author={Feng Li and Yanjun Xiao and Qizhi Zhang}, title={Graph Partition Based Traffic Balance in Industrial Network}, proceedings={2nd International ICST Conference on Communications and Networking in China}, publisher={IEEE}, proceedings_a={CHINACOM}, year={2008}, month={3}, keywords={graph partition industrial network}, doi={10.1109/CHINACOM.2007.4469422} }- Feng Li
Yanjun Xiao
Qizhi Zhang
Year: 2008
Graph Partition Based Traffic Balance in Industrial Network
CHINACOM
IEEE
DOI: 10.1109/CHINACOM.2007.4469422
Abstract
The traffic load balancing problem in switched industrial Ethernet is a key component of QoS performance, which is shown to be equivalent to a multi-constraint optimization problem: the network design should minimize the amount of inter-network communication time, and simultaneously balance the communication time and network size evenly over the resultant sub-networks. To solve this optimization problem, a graph partitioning strategy is proposed, which can give a good network solution by partitioning a graphbased representation of industrial network. In the experiments the network partitions obtained by graph partitioning strategy are compared with those obtained by a random partitioning method. The experimental results show the graph partitioning strategy is significantly better than those obtained by random partitioning method.