Oct 2026· Future Internet· Vol 18, pp. 545· 0 citations
TL;DR
This paper proposes MDP-BWO, a Markov decision process (MDP)-guided Black Widow Optimization (BWO) framework that integrates state forecasting, dependency-aware binding and runtime adaptation and is matched or slightly exceeded only by an exact mixed-integer search with 14–43 times longer mean planning time.
Abstract
Internet of Things (IoT) service choreographies integrate services across devices, edge servers and the cloud without a central orchestrator. Existing quality-of-service (QoS)-aware composition methods use single-value QoS, separable objectives and one-shot binding, overlooking evolving service conditions, peer-link dependencies and rebinding costs. This paper proposes MDP-BWO, a Markov decision process (MDP)-guided Black Widow Optimization (BWO) framework that integrates state forecasting, dependency-aware binding and runtime adaptation. A three-state Markov chain learned from monitoring traces forecasts each service’s state occupancy and guides BWO over constrained, non-separable bindings; each participant rebinds locally by table lookup of a finite-horizon MDP policy over a value-selected shortlist. In simulations on synthetic and WS-DREAM-based instances (measured QoS, synthetic state dynamics; 14 configurations × 30 held-out seeds), MDP-BWO outperforms six baselines with reactive fail-over in every configuration, raising executed utility by 0.086–0.139 and the solved-request rate by 0.087–0.130 (Holm-corrected p < 0.05); latency on WS-DREAM and cost on synthetic instances do not improve over three of the population baselines. Most of the gain comes from MDP rebinding; with the same forecast and policy, MDP-BWO still outperforms five population-based searches in 11–14 configurations and is matched or slightly exceeded only by an exact mixed-integer search with 14–43 times longer mean planning time.
5G edge network slicing must reconcile two coupled requirements: understanding high-level operator intent and reallocating scarce computing and bandwidth resources under dynamic contention. Centralized optimization can face computational and responsiveness challenges under rapidly changing edge contention, and Multi-Ag...
Nathan R. Prediger, Rodrigo Moreira, Juliano Araújo Wickboldt et al.· 0 citations
The rapid growth of Internet of Things (IoT) applications has increased the need for task-offloading mechanisms that can operate efficiently under heterogeneous Fog resources, dynamic workloads, and stringent latency requirements. A recurring limitation in existing allocation and matching approaches is that the choice...
Experiments show that CoSIPR improves service-category matching, request satisfaction, and the average number of accepted requests per instance, and reduces aggregate state-transfer cost and limits hotspot exposure while maintaining a controlled trade-off between end-to-end delay and state-transfer cost.
Meng-Xuan Dai, Xuan Chen, Ling Yang et al.· Symmetry· 0 citations
Ensuring reliable and timely consensus among Internet of Vehicles (IoV) nodes is critical for safety and operational efficiency, particularly under high mobility and dynamic network conditions. Traditional consensus protocols, however, do not explicitly incorporate service-level objectives (SLOs) such as commit latency...
Awais Bilal, Kashif Sharif, Lie-Huang Zhu et al.· IEEE Transactions on Network...· 0 citations
Simulation results show that MRSAR remains close to the Gurobi-MILP reference in service success, outperforms arrival-order and delay-myopic greedy baselines, controls REJECT and DROP failures, and achieves a favorable quality-complexity tradeoff for rolling online orchestration.
Common-Trace Factorized Constrained Proximal Policy Optimization (CT-PPO), a constrained Markov decision process that retains a return advantage at low, nominal, and high arrival loads, with the strongest gain under clustered arrivals.
D. Vu· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.