From cloud to edge: dynamic placement optimization of business processes in IIoT networks

Breakthroughs in edge computing offer new prospects for businesses to extend Industrial Internet of Things (IIoT) networks beyond analytics to actionable processing. In particular, cloud-based business processes, which provide administrative actions and rules through workflow-sequenced activities, can be streamlined on the edge for low-latency access in physical spaces. Although this advances business controls, particularly for critical events of industrial applications, it faces operational barriers. Edge devices, which support high volume and competing demands from a large number of sensors, vary in capacity, reliability, and proximity to sensors and cloud gateways. This warrants a highly efficient placement of process activities, from cloud to edge, given a variety of constraints, including resource demand, capacity, and compatibility, to satisfy timeliness constraints. In contrast to the related IIoT optimization research underway, including those of singleton service placements, business processes pose new challenges. Not only do sets of dependent activities have to be considered for co-deployment, but the meaning of timing constraints needs to be respected, given alternative, parallel, and iterative control-flow paths in processes. In addition, instantiation (replication) to scale activities for increasing data volumes poses further deployment constraints, i.e., on sets of nodes supporting dynamic instantiation of order-dependent activities. Here we present an optimization strategy for business processes that addresses these challenges. We first conceptualize processes in coherent fragments to precisely derive both responsiveness and throughput execution time heuristics and formulate a multi-objective process placement problem. Next, we develop a genetic algorithm-based process placement procedure. To adapt to fluctuating event frequencies, we support an interplay between scaling algorithms for service instances and process placement optimization. Validation through an industrial safety monitoring use case drawn from the construction industry shows that our approach improves timeliness responses by almost one-third and more than doubles execution throughput compared to existing methods.

Authors

Institutions

Publication Details

Journal
Journal of Network and Computer Applications
Published
2025-09-02
DOI
https://doi.org/10.1016/j.jnca.2025.104317
Primary Topic
Business Process Modeling and Analysis
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

From cloud to edge: dynamic placement optimization of business processes in IIoT networks

Alistair Barros, Md. Razon Hossain, Colin Fidge
Journal of Network and Computer Applications
Business Process Modeling and Analysis
article

From cloud to edge: dynamic placement optimization of business processes in IIoT networks

Alistair Barros, Md. Razon Hossain, Colin Fidge
article en

Abstract

Breakthroughs in edge computing offer new prospects for businesses to extend Industrial Internet of Things (IIoT) networks beyond analytics to actionable processing. In particular, cloud-based business processes, which provide administrative actions and rules through workflow-sequenced activities, can be streamlined on the edge for low-latency access in physical spaces. Although this advances business controls, particularly for critical events of industrial applications, it faces operational barriers. Edge devices, which support high volume and competing demands from a large number of sensors, vary in capacity, reliability, and proximity to sensors and cloud gateways. This warrants a highly efficient placement of process activities, from cloud to edge, given a variety of constraints, including resource demand, capacity, and compatibility, to satisfy timeliness constraints. In contrast to the related IIoT optimization research underway, including those of singleton service placements, business processes pose new challenges. Not only do sets of dependent activities have to be considered for co-deployment, but the meaning of timing constraints needs to be respected, given alternative, parallel, and iterative control-flow paths in processes. In addition, instantiation (replication) to scale activities for increasing data volumes poses further deployment constraints, i.e., on sets of nodes supporting dynamic instantiation of order-dependent activities. Here we present an optimization strategy for business processes that addresses these challenges. We first conceptualize processes in coherent fragments to precisely derive both responsiveness and throughput execution time heuristics and formulate a multi-objective process placement problem. Next, we develop a genetic algorithm-based process placement procedure. To adapt to fluctuating event frequencies, we support an interplay between scaling algorithms for service instances and process placement optimization. Validation through an industrial safety monitoring use case drawn from the construction industry shows that our approach improves timeliness responses by almost one-third and more than doubles execution throughput compared to existing methods.

Journal of Network and Computer ApplicationsVol. 243
Queensland University of Technology (AU)
Australian Research Council
Openalex Percentile: Top 61%
Business Process Modeling and Analysis
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.