Multi-constrained Network Occupancy Optimization

Amar Halilovic1, Nedim Zaimovic2, Tiberiu Seceleanu3 and Hamid Feyzmahdavian4

  1. Ulm University, Ulm, Germany
    {amar.halilovic}@uni-ulm.de
  2. ALTEN AB, Västerås, Sweden
    nedim.zaimovic@alten.se
  3. Mälardalen University, Västerås, Sweden
    tiberiu.seceleanu@mdh.se
  4. ABB AB, Västerås, Sweden
    hamid.feyzmahdavian@se.abb.com

Abstract

The greater the number of devices on a network, the higher load in the network, the more chance of a collision occurring, and the longer it takes to transmit a message. The size of load can be identified by measuring the network occupancy, hence it is desirable to minimize the latter. In this paper, we present an approach for network occupancy minimization by optimizing the packing process while satisfying multiple constraints. We formulate the minimization problem as a bin packing problem and we implement a modification of the Best-Fit Decreasing algorithm to find the optimal solution. The approach considers grouping signals that are sent to different destinations in the same package. The analysis is done on a medium-sized plant model, and different topologies are tested. The results show that the proposed solution lowers the network occupancy compared to a reference case.

Key words

industrial control networking, packing algorithms, network performance

Digital Object Identifier (DOI)

https://doi.org/10.2298/CSIS211001008H

How to cite

Halilovic, A., Zaimovic, N., Seceleanu, T., Feyzmahdavian, H.: Multi-constrained Network Occupancy Optimization. Computer Science and Information Systems, https://doi.org/10.2298/CSIS211001008H