Graph partitioning strategy for the topology design of industrial network

IET Communications

Volumn 1, Issue 6, 2007, Pages 1104-1110

  Li, F ^a   Zhang, Q ^a   Zhang, W ^a  

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; OPTIMIZATION; PROBLEM SOLVING;

GRAPH PARTITIONING; INDUSTRIAL NETWORKS; NETWORK SIZE; NETWORK TOPOLOGY;

TELECOMMUNICATION NETWORKS;

EID: 37849052545     PISSN: 17518628     EISSN: None     Source Type: Journal    
DOI: 10.1049/iet-com:20060677     Document Type: Article

References (21)

1. Decotignie, J.-D.: ' Ethernet-based real-time and industrial communications ', Proc. IEEE Ind. Commun. Syst., 2005, 93, (6), p. 1102-1117
2. Felser, M.: ' Real-time ethernet-Industry prospective ', Proc. IEEE Ind. Commun. Syst., 2005, 93, (6), p. 1118-1129
3. Fan, X., Wang, Z., and Sun, Y.: ' How to guarantee factory communication with switched Ethernet: Survey of its emerging technology ', Proc. IECON (Industrial Electronics Conf.), 2002, Sevilla, p. 2525-2530
4. Jasperneite, J., and Neumann, P.: ' Switched Ethernet for factory communication ', Proc. IEEE Symp. on Emerging Technologies and Factory Automation, ETFA, Antibes-Juan les Pins, 2001, p. 205-212
5. Khuri, S., and Chiu, T.: ' Heuristic algorithms for the terminal assignment problem ', Proc. ACM Symp. on Applied Computing 1997, 1997, San Jose, CA, USA, p. 247-251
6. Li, J., Guan, Y.L., and Soong, B.H.: ' Effect of genetic algorithm parameters on PCS network planning ', Proc. Conf. on Local Computer Networks, 2000, Tampa, FL, USA, p. 400-404
7. Quintero, A., and Pierre, S.: ' Assigning cells to switches in cellular mobile networks: a comparative study ', Comput. Commun., 2003, 26, (9), p. 950-960 10.1016/S0140-3664(02)00224-4
8. Quintero, A., and Pierre, S.: ' Evolutionary approach to optimize the assignment of cells to switches in personal communication networks ', Comput. Commun., 2003, 26, (9), p. 927-938 10.1016/S0140-3664(02)00238-4
9. Salcedo-Sanz, S., and Yao, X.: ' A hybrid Hopfield network-genetic algorithm approach for the terminal assignment problem ', IEEE Transact. Syst. Man Cybern. B Cybern., 2004, 34, (6), p. 2343-2353
10. Youssef, H., Sait, S.M., and Khan, S.A.: ' Topology design of switched enterprise networks using a fuzzy simulated evolution algorithm ', Eng. Appl. Artif. Intel., 2002, 15, (3-4), p. 327-340
11. Rüping, S., Vonnahme, E., and Jasperneite, J.: ' Analysis of switched Ethernet networks with different topologies used in automation systems ', Proc. Fieldbus Technology Conf., 1999, Magdeburg, p. 351-358
12. Vonnahme, E., Rueping, S., and Rueckert, U.: ' Measurements in switched Ethernet networks used for automation systems ', Proc. IEEE Int. Workshop on Factory Communication Systems, 2000, Porto, Portugal, p. 231-238
13. Songerwala, M.: ' Efficient solutions to the network division problem ', 1994, PhD, Curtin University of Technology
14. ' Graph partitioning algorithms for distributing workloads of parallel computations ', Tech. Rep. TR-98-10-03, University of Washington, Computer Science and Engineering, 1998, http://www.cs.washington.edu/homes/brad/cv/pubs/ degree/generals.pdfaccessed 9 April 2007
15. Shi, J., and Malik, J.: ' Normalized cuts and image segmentation ', IEEE Trans. Pattern Anal. Mach. Intel., 2000, 22, (8), p. 888-905 10.1109/34.868688 0162-8828
16. Selvakkumaran, N.: ' Scalable partitioning-driven algorithms for solving complex and emerging problems in VLSI physical design automation ', 2005, PhD, University of Minnesota
17. ' Multilevel algorithms for multi-constraint graph partitioning ', Tech. Rep. TR-98-019, University of Minnesota, Department of Computer Science, 1998, http://glaros.dtc.umn.edu/gkhome/node/90, accessed 9 April 2007
18. Hendrickson, B., and Leland, R.: ' Multilevel algorithm for partitioning graphs ', Proc. ACM/IEEE Supercomputing Conf., 1995, San Diego, CA, USA, p. 626-657
19. Karypis, G., and Kumar, V.: ' Analysis of multilevel graph partitioning ', Proc. ACM/IEEE Conf. on Supercomputing 1995 (CDROM), 1995, San Diego, California, USA, p. 1-19
20. Karypis, G., and Kumar, V.: ' Multilevel k-way partitioning scheme for irregular graphs ', J. Parallel Distrib. Comput., 1998, 48, (1), p. 96-129 10.1006/jpdc.1997.1404 0743-7315
21. ' A Software package for partitioning unstructured graphs, partitioning meshes, and computing fill-reducing orderings of sparse matrices ', University of Minnesota, Department of Computer Science, 1998, http://glaros.dtc.umn.edu/ gkhome/fetch/sw/metis/manual.pdf, adaccessed 9 April 2007