Zero-Knowledge Proofs and Smart Scheduling Tame Bursty Industrial Cloud–Edge Workloads

Modern factories no longer run on conveyor belts alone. They run on data streams that leap between sensors on the shop floor, edge servers bolted beside production lines, and distant cloud data centers. Every robotic arm adjustment, quality inspection, and predictive maintenance alert depends on tasks being dispatched to the right computing node at the right moment. A new study published in Cluster Computing by Jing Zhan, Xin Liu, Zhiqiang Zeng, and Xiang Le of Beijing University of Technology, together with Xiang Le’s affiliation at the Ningbo HollySys Information Security Research Institute, tackles two stubborn problems that have haunted this industrial cloud–edge collaboration: sensitive node information leaks during scheduling, and sudden traffic bursts that overwhelm limited computing capacity. Their proposed framework, called BWAS-DP, promises lower latency, stronger security, and more stable decision-making, and the numbers reported in their experiments are substantial.

The first problem the researchers identify is deceptively simple to state but hard to solve. In cloud–edge systems, computing nodes advertise their attributes—available memory, processing capacity, current load, and similar characteristics—to schedulers that must decide where each task should run. These attribute values travel across networks and pass through scheduling intermediaries, creating opportunities for eavesdropping, tampering, or forgery. A malicious actor who alters a node’s advertised capacity could divert tasks to compromised hardware, degrade system performance, or open doors to further attacks. Existing scheduling schemes, the authors argue, largely ignore this exposure, treating node metadata as trusted public information even in industrial settings where the stakes include production safety and proprietary process data.

To close this gap, the team developed ZKRRP-SDPA, a scheduling data protection algorithm built on zero-knowledge range proofs adapted for real-valued numbers. Zero-knowledge proofs are a cryptographic technique that lets one party convince another that a statement is true without revealing the underlying data. In this case, a node can prove that its attribute values fall within a legitimate range—say, that its available memory lies between specified bounds—without disclosing the actual values. The researchers enhanced the well-known Bulletproofs construction, originally designed for confidential blockchain transactions, to handle real-valued ranges by linearly mapping continuous attributes into an integer domain using a scaling factor and a zero-point shift, then adding offsets so that all mapped values remain positive and compatible with the proof system.

The mathematics behind the protection is rigorous. Each node generates cryptographic commitments of the form g raised to a secret value multiplied by h raised to a random blinding factor, alongside non-interactive Bulletproofs certificates. Because Bulletproofs possess a simulation-based zero-knowledge property, any adversary observing these commitments learns nothing about the underlying attribute values or even the range endpoints. The authors formally prove three security properties in the paper’s appendices. Confidentiality holds because an attacker cannot distinguish a node’s true attributes from random ones. Integrity holds because the simulation-sound extractability of Bulletproofs makes it computationally infeasible to forge a valid proof for an out-of-range value. Authenticity rests on BLS digital signatures, which are secure against adaptive chosen-message attacks, so no one can impersonate a node or replay its proofs.

Security alone, however, does not move tasks faster. The second half of BWAS-DP, an algorithm the authors call CPAS-TSOA, addresses the scheduling side. Industrial workloads are notoriously bursty: a production surge, a batch of inspection requests, or a machine fault can flood the system with tasks in seconds, while node capacities remain fixed. The researchers attack this problem with congestion prediction powered by LSTM neural networks—recurrent models well suited to learning temporal patterns in traffic. Crucially, they use Bayesian optimization to tune the LSTM’s hyperparameters, a technique that efficiently searches the configuration space rather than relying on manual trial and error. With congestion forecasts in hand, the system dynamically reserves resources before bottlenecks materialize, rather than reacting after queues have already formed.

On top of prediction sits a multi-objective scheduling optimizer that adapts its strategy to both the task and the node. When workloads are light, the scheduler can afford thorough searches for optimal placements; when bursts arrive, it switches to faster, task- and node-adaptive strategies that trade a small amount of optimality for large gains in decision speed. This dual-mode design reflects a practical insight about edge computing: the best scheduling policy depends on conditions, and rigid algorithms tuned for average traffic crumble under extremes. The adaptive layer also improves decision-making efficiency itself, which matters because a scheduler that deliberates too long adds its own latency to every task it dispatches.

The team did not stop at theory. They built a prototype system and ran extensive experiments on both customized and public industrial datasets, comparing BWAS-DP against existing approaches under both anticipated and bursty workload conditions. The results are consistent across metrics. Under anticipated workloads, average latency dropped by 12.3 percent. Under bursty workloads—the scenario that stresses industrial systems most—the latency reduction grew to 18.8 percent, showing that the congestion prediction and adaptive reservation mechanisms pay off precisely when they are needed most. The security metric improved by approximately 11.1 percent, reflecting the cryptographic protections layered into the scheduling pipeline, and decision-making efficiency rose by roughly 7.2 percent, confirming that the adaptive strategies dispatch tasks faster without sacrificing quality.

These gains arrive at a moment when industrial Internet of Things deployments are expanding rapidly, and the research literature reflects that urgency. The paper situates itself within a rich body of prior work: task offloading strategies for railway IoT, parallel scheduling for large-scale cloud–edge collaboration, deep reinforcement learning approaches to resource interleaving, blockchain-assisted secure data sharing, and privacy-preserving storage schemes. What distinguishes BWAS-DP is the combination of cryptographic rigor with workload adaptivity in a single framework. Previous secure scheduling efforts often treated privacy as an add-on that degraded performance, while adaptive schedulers frequently assumed honest participants. By proving that nodes can participate in scheduling without exposing their attributes—and that the system still schedules efficiently under stress—the study challenges the assumption that security and performance are inevitably in tension.

The zero-knowledge component also connects the paper to a broader cryptographic movement. Bulletproofs, introduced at the 2018 IEEE Symposium on Security and Privacy, earned attention for producing short proofs without requiring a trusted setup, making them attractive for decentralized systems. Extending such proofs to real-valued industrial attributes is a meaningful technical step, because physical measurements—temperatures, loads, bandwidth fractions—are continuous quantities that do not map naturally onto the integer arithmetic of standard proofs. The linear mapping and quantization preprocessing described in the paper, together with formal proofs of confidentiality, integrity, and authenticity, offers a template other researchers could apply to any system where continuous node or device characteristics must be verified without disclosure.

For industrial operators, the practical implications are straightforward. Factories considering cloud–edge architectures for latency-sensitive applications—machine vision, real-time control, collaborative robotics—now have evidence that they need not choose between responsive scheduling and protecting node metadata. The reported latency reductions under bursty conditions suggest particular value in environments with unpredictable demand, which describes most real production floors. As edge computing matures and industrial networks grow more distributed, frameworks like BWAS-DP point toward infrastructure where cryptographic guarantees are woven into the scheduling fabric rather than bolted on afterward, and where the system anticipates the next traffic storm instead of merely surviving it.

Subject of Research: Secure and adaptive task scheduling for industrial cloud–edge collaborative computing using zero-knowledge range proofs and LSTM-based congestion prediction

Article Title: Bursty workload-adaptive scheduling with data protections for industrial cloud–edge collaboration

Article References: Zhan, J., Liu, X., Zeng, Z., & Le, X. (2026). Bursty workload-adaptive scheduling with data protections for industrial cloud–edge collaboration. Cluster Computing, 29(12), Article 716. https://doi.org/10.1007/s10586-026-06532-9

Image Credits: AI Generated

DOI: 10.1007/s10586-026-06532-9

Keywords: cloud-edge collaboration, zero-knowledge range proofs, Bulletproofs, bursty workloads, adaptive scheduling, industrial Internet of Things, LSTM networks, Bayesian optimization, data protection, latency reduction, BLS signatures, congestion prediction