Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

Graph partitioning strategy for the topology design of industrial network

Graph partitioning strategy for the topology design of industrial network

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Add to cart
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)
Add to cart

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IET Communications — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

© The Institution of Engineering and Technology
Published

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.

Inspec keywords: telecommunication network topology; resource allocation; internetworking; graph theory

Other keywords: network topology design; internetwork communication; industrial network; graph partitioning; load balancing; network optimisation

Subjects: Combinatorial mathematics; Combinatorial mathematics; Computer communications; Computer networks and techniques; Communication network design, planning and routing

References

    1. 1)
      • Karypis, G., Kumar, V.: `Multilevel algorithms for multi-constraint graph partitioning', Tech. Rep. TR-98-019, 1998, http://glaros.dtc.umn.edu/gkhome/node/90, accessed 9 April 2007.
    2. 2)
      • Karypis, G., Kumar, V.: `A Software package for partitioning unstructured graphs, partitioning meshes, and computing fill-reducing orderings of sparse matrices', 1998, http://glaros.dtc.umn.edu/gkhome/fetch/sw/metis/manual.pdf, adaccessed 9 April 2007.
    3. 3)
      • H. Youssef , S.M. Sait , S.A. Khan . Topology design of switched enterprise networks using a fuzzy simulated evolution algorithm. Eng. Appl. Artif. Intel. , 327 - 340
    4. 4)
      • Vonnahme, E., Rueping, S., 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.
    5. 5)
      • Li, J., Guan, Y.L., 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.
    6. 6)
      • J.-D. Decotignie . Ethernet-based real-time and industrial communications. Proc. IEEE Ind. Commun. Syst. , 6 , 1102 - 1117
    7. 7)
      • Chamberlain, B.: `Graph partitioning algorithms for distributing workloads of parallel computations', Tech. Rep. TR-98-10-03, 1998, http://www.cs.washington.edu/homes/brad/cv/pubs/degree/generals.pdfaccessed 9 April 2007.
    8. 8)
    9. 9)
      • S. Salcedo-Sanz , X. Yao . A hybrid Hopfield network-genetic algorithm approach for the terminal assignment problem. IEEE Transact. Syst. Man Cybern. B Cybern. , 6 , 2343 - 2353
    10. 10)
      • Jasperneite, J., 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.
    11. 11)
      • Fan, X., Wang, Z., 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, Spain.
    12. 12)
      • Rüping, S., Vonnahme, E., Jasperneite, J.: `Analysis of switched Ethernet networks with different topologies used in automation systems', Proc. Fieldbus Technology Conf., 1999, Magdeburg, p. 351–358.
    13. 13)
      • Songerwala, M.: `Efficient solutions to the network division problem', 1994, PhD, Curtin University of Technology.
    14. 14)
      • Karypis, G., Kumar, V.: `Analysis of multilevel graph partitioning', Proc. ACM/IEEE Conf. on Supercomputing 1995 (CDROM), 1995, San Diego, California, USA, p. 1–19.
    15. 15)
      • Khuri, S., Chiu, T.: `Heuristic algorithms for the terminal assignment problem', Proc. ACM Symp. on Applied Computing 1997, 1997, San Jose, CA, USA, p. 247–251.
    16. 16)
      • Selvakkumaran, N.: `Scalable partitioning-driven algorithms for solving complex and emerging problems in VLSI physical design automation', 2005, PhD, University of Minnesota.
    17. 17)
    18. 18)
    19. 19)
      • Hendrickson, B., Leland, R.: `Multilevel algorithm for partitioning graphs', Proc. ACM/IEEE Supercomputing Conf., 1995, San Diego, CA, USA, p. 626–657.
    20. 20)
    21. 21)
      • M. Felser . Real-time ethernet - Industry prospective. Proc. IEEE Ind. Commun. Syst. , 6 , 1118 - 1129
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-com_20060677
Loading

Related content

content/journals/10.1049/iet-com_20060677
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
Print this page
This is a required field
Please enter a valid email address