The N×On-Off/D/1 model describes a single server with deterministic service times, fed by N independent sources that each alternate between active ON periods, during which they emit packets, and silent OFF periods. This structure matters because real network traffic is nothing like the smooth, memoryless arrivals assumed in textbook models. Since the landmark measurements of Ethernet traffic by Leland and colleagues in the 1990s, engineers have known that packet streams are bursty and correlated, and that burstiness is precisely what inflates queues and delays. The On-Off source model captures this correlation in a tractable way, making it a workhorse for teletraffic engineering in broadband and wireless systems alike.

Before trusting any simulator, the researchers had to prove it reproduces known results. Their first validation stage used the M/D/1 queue, the classical model with Poisson arrivals and deterministic service, as a baseline. For this model, the asymptotic decay rate of the queue-length tail distribution is known in closed form, giving an exact mathematical benchmark. Across utilization levels rho ranging from 0.7 to 0.95, the simulator matched the theoretical decay rate to within one percent. That level of agreement is the kind of result that separates a credible simulation framework from a toy, and it established the foundation for everything that followed.

The second validation stage tackled the harder target: the Burst Scale Decay Rate, or BSDR, a closed-form approximation that predicts how quickly the probability of large queue buildups decays when many On-Off sources feed the buffer. Here the simulator tracked the approximation within 2.2 to 12.5 percent across the tested configurations. Crucially, the team did not treat that residual gap as an embarrassment. By running multiple independent replications and constructing confidence intervals, they showed that the discrepancy is a systematic property of the closed-form approximation itself, not random simulation noise. In other words, the simulator is more accurate than the approximation it was being tested against, a subtle but important inversion that gives engineers a clearer picture of how much to trust the analytical shortcut.

With the framework validated, the researchers turned to the central question: what does the distribution of per-packet queueing delay actually look like under bursty load? They examined three different ON/OFF configurations at utilization levels from 0.89 to 0.98, deep in the congested regime where wireless networks spend much of their operating life. Each operating point was simulated with five independent replications totaling roughly 700 million packets, an enormous dataset by any statistical standard. The scale matters because the question they were asking, whether a delay distribution follows a particular mathematical form, is exactly the kind of question where insufficient data produces misleading answers.

The verdict came from four independent distance measures: the Kolmogorov-Smirnov statistic, the Anderson-Darling statistic, the coefficient of determination between cumulative distribution functions, and the Bhattacharyya overlap coefficient. All four measures told the same story. As the load increases, the queueing delay distribution steadily approaches a lognormal shape. The Kolmogorov-Smirnov distance shrank to 0.051 at the highest loads, and the fixed-sample Anderson-Darling statistic, which is especially sensitive to the tails of a distribution, dropped by factors of three to seven. For network engineers, this is a genuinely useful regularity: the lognormal distribution, whose parameters can be estimated from a mean and a variance, offers a compact closed-form description of delay behavior that grows more accurate precisely where delays matter most, near saturation.

Yet the study is equally emphatic about the limits of that regularity. Bootstrap-corrected goodness-of-fit tests rejected exact lognormality at every single operating point, no matter how close the visual and distance-based agreement appeared. The authors therefore present the lognormal as an approximation with quantified accuracy rather than an exact law, a distinction that reflects a mature statistical philosophy. To test whether some other two-parameter distribution might do better, they systematically compared the lognormal against Weibull, gamma, log-logistic, and Lomax alternatives. The result was nuanced: at moderate loads the lognormal could lag behind the best competitor for a given configuration, but as load increased it became competitive with, and in some cases the best among, all the two-parameter candidates.

Configuration mattered too. The team’s sensitivity analysis showed that OFF-dominated or symmetric traffic patterns, where the silent period is at least as long as the active period, produced better lognormal agreement at moderate loads. Near saturation, however, this dependence weakened, suggesting that extreme congestion washes out the details of the source structure and drives the delay distribution toward a common heavy-tailed form regardless of how the bursts are shaped. This finding has practical implications for traffic engineering, because it tells operators when they can rely on a simple lognormal fit and when the specifics of their traffic mix demand a more careful analysis.

Perhaps the most consequential result concerns the tails, the extreme delays that determine whether a system meets the stringent latency budgets of 5G, the tactile internet, and ultra-reliable low-latency communications. Above a utilization of roughly 0.95, the fitted lognormal consistently overestimated the empirical 95th, 99th, and 99.9th percentile delays in every configuration tested, at P99.9 by factors ranging from 3.6 to 9.6 times the observed values. At moderate loads, by contrast, the sign of the tail error depended on the traffic configuration, sometimes underestimating the true risk. The authors frame the heavily loaded overestimation as a virtue: the lognormal acts as an empirically conservative closed-form tool for delay budgeting, erring on the safe side exactly in the regime where network dimensioning decisions are made.

The broader significance of the work lies in its marriage of large-scale simulation with rigorous uncertainty quantification. Rather than declaring a new universal law of network delay, the study delivers something more useful: a validated simulator, a calibrated understanding of when the BSDR approximation can be trusted, and a quantified recipe for using the lognormal as a delay-budgeting tool with known error bounds. As wireless networks absorb everything from factory robots to remote surgery, the difference between a guessed delay distribution and a statistically verified one translates directly into either wasted capacity or violated service guarantees. This research gives the engineers building that future a sharper instrument, and a candid account of its precision.

Subject of Research: Queueing-theoretic modeling and statistical validation of packet delay distributions in bursty wireless network traffic

Article Title: Validation of burst scale decay rate and analysis of lognormal delay distribution in NxOn-Off/D/1 queueing models for wireless network performance

Article References: Enisoglu, R., Inan, B. A., & Ugurlu, S. Y. (2026). Validation of burst scale decay rate and analysis of lognormal delay distribution in NxOn-Off/D/1 queueing models for wireless network performance. Cluster Computing, 29(13), Article 780. https://doi.org/10.1007/s10586-026-06591-y

Image Credits: AI Generated

DOI: 10.1007/s10586-026-06591-y

Keywords: queueing theory, N×On-Off/D/1 model, burst scale decay rate, lognormal distribution, packet delay, QoS provisioning, wireless networks, tail probability estimation, goodness-of-fit testing, network dimensioning, discrete-event simulation, 5G latency

The work, led by Senlin Li with Bo Tang and Xiaowu Deng of Huaihua University in Hunan, China, introduces MLFQ-Hybrid, a hybrid deep learning framework built around a Multi-Level Feedback Queue module. The multi-level feedback queue is a classic idea from computer science: operating systems use it to schedule processes by moving them between priority queues, demoting tasks that run too long and promoting those that need urgent attention. Li and colleagues realized that the same logic could describe how a forecasting network should treat temporal features. Some features capture rapid, short-lived dynamics that deserve immediate processing, while others encode slow seasonal rhythms that benefit from longer, more deliberate handling. Rather than forcing all features through a single uniform pipeline, the MLFQ module routes them through a hierarchy of levels, each tuned to a different time scale.

The architecture integrates this queue-inspired module with three established building blocks of modern sequence modeling. Convolutional layers perform the initial extraction of local patterns, sweeping across the input series to detect short bursts and local motifs. Bidirectional long short-term memory networks, or BiLSTMs, then read the sequence from both directions, capturing dependencies that unfold over longer horizons in either temporal direction. Finally, attention mechanisms weigh the contribution of different time steps, allowing the model to focus on the moments in the past that matter most for the prediction at hand. What distinguishes MLFQ-Hybrid is not any single component but the way the multi-level feedback queue orchestrates their interaction across scales.

At the core of the innovation is a gated hierarchical structure that selectively amplifies or suppresses features through cross-level feedback. In conventional feed-forward architectures, information flows in one direction, from raw input to prediction, with limited opportunity for lower-level features to be corrected by what higher levels have learned. MLFQ-Hybrid breaks with this convention. Features that prove useful at one level of the hierarchy can be boosted and passed upward, while noisy or redundant features are dampened. The gating mechanism acts as a dynamic traffic controller, continuously re-evaluating which features deserve priority as the model processes each new segment of the time series. This mirrors the way an operating system’s scheduler demotes a process that has consumed its time slice and promotes one that has been waiting too long, ensuring that no signal is starved of computational attention.

Training such a multi-level, multi-scale architecture poses its own challenge. When a network is asked to optimize several objectives simultaneously, for example accuracy at short horizons and stability at long ones, the gradients from different tasks can conflict, causing training to oscillate or collapse. The team addressed this with an adaptive loss-balancing mechanism, whose theoretical formulation was contributed by co-author Xiaowu Deng. The mechanism dynamically adjusts the weighting of different loss terms during optimization, ensuring that no single task dominates the learning process. This kind of adaptive weighting has become an increasingly important tool in multi-task learning, and here it serves as the stabilizing backbone that allows the queue-driven hierarchy to be trained end to end.

The researchers evaluated MLFQ-Hybrid on diverse real-world datasets spanning three domains: energy, weather, and traffic. These are exactly the settings where multi-scale temporal dependencies and non-stationary patterns cause conventional models the most trouble. Electricity demand, for instance, exhibits daily cycles layered on weekly rhythms, seasonal shifts, and abrupt events such as heat waves or holidays. Weather variables combine fast turbulence with slow frontal systems, and traffic flows mix minute-by-minute fluctuations with predictable rush-hour patterns. According to the study, MLFQ-Hybrid achieved competitive performance across these benchmarks, with clear advantages over baseline models in both accuracy and stability. The stability dimension is particularly noteworthy: a forecaster that performs well on average but fails catastrophically during regime changes is of limited practical value, and the feedback-driven architecture appears to smooth out such volatility.

The broader context explains why this contribution matters. Deep learning approaches to forecasting have proliferated rapidly, from attention-based LSTM models and temporal convolutional networks to transformer variants such as the Informer and Autoformer, which decompose long series and exploit auto-correlation for long-horizon prediction. Yet surveys of the field repeatedly identify the same weaknesses: models tend to specialize in a single temporal scale, and their performance degrades when the statistical properties of the data drift over time. Hierarchical attention networks and pyramidal recurrent units have attempted to address scale by stacking representations at multiple resolutions, and feedback-guided feature fusion has explored letting later layers inform earlier ones. MLFQ-Hybrid pushes this line of thinking further by making the prioritization of features explicit and dynamic, rather than implicit in the fixed wiring of the network.

The choice to import a concept from queueing theory is more than a metaphor. Queueing theory and stochastic learning have long shared mathematical ground, and the multi-level feedback queue is a well-studied scheduling technique with formal guarantees about fairness and responsiveness. By mapping its logic onto neural feature processing, the authors create a principled structure for a problem that is often handled ad hoc: deciding which temporal patterns a network should invest its capacity in. The gated cross-level feedback can be understood as a learned scheduling policy, one that is optimized jointly with the rest of the network rather than hand-designed. This suggests a fertile direction for future research, in which other classical scheduling and resource-allocation algorithms might inspire architectures that allocate neural computation more intelligently.

The study was supported by the Scientific Research Fund of the Hunan Provincial Education Department and by the Aid Program for Science and Technology Innovative Research Team in Higher Educational Institutions of Hunan Province. The work was received in January 2026, accepted at the end of August, and published in September 2026 as article number 460 in volume 17 of the journal. The authors report no competing financial interests, and the contribution statement details a clear division of labor: Li conceived the study and designed the architecture, Tang conducted the experiments including ablation studies and robustness analysis, and Deng developed the theory behind the adaptive loss weighting.

For practitioners, the appeal of MLFQ-Hybrid lies in its generality. The framework was not tailored to a single domain but demonstrated across energy, weather, and traffic data, suggesting that the queue-driven approach to multi-scale feature management could transfer to other forecasting problems, from air quality prediction to financial modeling. For the field at large, the study is a reminder that innovation in machine learning does not always require exotic new mathematics; sometimes it comes from reconnecting with older ideas in computer science and finding that they fit a modern problem remarkably well. As forecasting systems are asked to operate in ever more volatile environments, architectures that can dynamically re-prioritize what they learn from, and feed what they discover back into their own lower levels, may prove to be exactly what the moment demands.

Subject of Research: A hybrid deep learning architecture using multi-level feedback queue scheduling for time series prediction

Article Title: A multi-level feedback queue-driven deep learning architecture for enhanced time series prediction

Article References: Li, S., Tang, B., & Deng, X. (2026). A multi-level feedback queue-driven deep learning architecture for enhanced time series prediction. International Journal of Machine Learning and Cybernetics, 17(9), Article 460. https://doi.org/10.1007/s13042-026-03293-0

Image Credits: AI Generated

DOI: 10.1007/s13042-026-03293-0

Keywords: time series prediction, deep learning, multi-level feedback queue, hybrid neural networks, LSTM, attention mechanism, forecasting, queueing theory, multi-task learning, energy forecasting, weather prediction, traffic prediction

The problem the researchers set out to solve is deceptively simple to describe. In mMTC scenarios, individual messages are typically tiny, but the number of devices attempting to access the network simultaneously can surge dramatically within a very short window. All of these attempts funnel through a shared resource called the physical random access channel, or PRACH, and when too many devices try to transmit at once, collisions occur, devices retry, and the network can spiral into congestion. A fundamental difficulty, the authors note, is what they call partial observability: the base station cannot distinguish between newly arriving traffic and devices that are retrying after failed attempts, because collision feedback alone does not reveal which devices are behind the interference.

Traditional approaches to this problem have leaned on rule-based methods, such as static or adaptive access class barring schemes that throttle how many devices are allowed to attempt access in a given period. These methods rely on carefully tuned heuristics and mathematical models of traffic behavior, and they can work reasonably well when traffic patterns match the assumptions built into the rules. But real-world machine-type traffic is famously bursty and correlated. Devices often wake up in synchronized waves, triggered by external events or shared schedules, producing traffic patterns that defy neat analytical models. When reality diverges from the model, rule-based controllers can overshoot or undershoot, leaving the network either starved of access opportunities or overwhelmed by collisions.

Purely data-driven AI models represent the opposite extreme. Deep learning predictors, including models built on recurrent architectures and transformer-style attention mechanisms, can learn traffic patterns directly from observations and have shown impressive forecasting performance in related domains. Applied naively to random access control, however, such models face two serious problems. First, they require large amounts of representative training data, and network conditions can shift in ways the training data never captured. Second, and more fundamentally, they inherit the partial observability blind spot: a black-box predictor fed only collision feedback has no principled way to separate new arrivals from retries, so its estimates can drift badly during the very congestion episodes where accuracy matters most.

The new framework, developed by Zongxiao Li and Jianwei Liu of Beihang University together with Wei Lin, Jun-Ting Liu, Ngo Van Mao and Binbin Chen of the Singapore University of Technology and Design, resolves this tension by embedding AI components inside a theoretical structure rather than replacing the theory with learned models. The architecture has three cooperating parts. A statistical estimator performs backlog estimation, inferring how many devices are stuck retrying their access attempts based on the evolution of collision feedback over time. A deep learning predictor forecasts upcoming new traffic, learning the temporal patterns that generate fresh access attempts. Both of these signals feed into a constraint-aware optimizer that dynamically tunes grant-free medium access control parameters, adjusting how aggressively the network admits new devices into the contention process.

The division of labor is the key insight. Backlog estimation is a problem where queueing theory provides strong structural guarantees: the relationship between collision outcomes and the hidden number of retransmitting devices follows mathematical dynamics that can be inverted statistically, given the observed feedback sequence. Handing this subtask to a neural network would discard known structure for no gain. New traffic forecasting, by contrast, is a pattern recognition problem where the underlying generating process is complex, correlated and only partially understood, making it an ideal candidate for deep learning. By selectively applying AI only where data-driven methods hold a genuine advantage and relying on theory where theory is trustworthy, the framework avoids the failure modes of both extremes.

The constraint-aware optimizer completes the loop. It takes the estimated backlog and the forecast of new arrivals and computes access parameters subject to the network’s physical and operational constraints, ensuring that the adjustments made in each time step remain feasible and stable. This design means the learned components amplify the theoretical core rather than overriding it, and the entire controller degrades gracefully when the AI predictions are imperfect, because the theoretical machinery still bounds the system’s behavior.

In simulation studies, the authors demonstrate that this hybrid strategy significantly outperforms both traditional rule-based methods and purely data-driven AI models. The headline result is a halving of queue clearance time, the duration over which a surge of waiting devices is drained through the access channel. Average latency drops drastically, as does the collision rate on the shared channel, meaning fewer devices waste energy and airtime on failed attempts. For battery-powered IoT devices, lower collision rates translate directly into longer operating lifetimes, and for network operators, faster queue clearance means the same radio resources can support larger device populations, improving the scalability that mMTC deployments demand.

The significance of the work extends beyond a single performance benchmark. It offers a concrete demonstration of the theory-guided data science paradigm, an emerging school of thought arguing that the most reliable intelligent systems fuse scientific knowledge with machine learning rather than choosing between them. In wireless networking, where protocol behavior is governed by well-characterized stochastic processes but traffic demands are messy and data-rich, that fusion appears particularly natural. The framework also addresses a practical scalability concern: because the theoretical components carry much of the inference burden, the learned components can remain comparatively lightweight, easing deployment on real base station hardware and reducing vulnerability to distribution shift.

Looking forward, the researchers’ approach suggests a roadmap for 5G-Advanced and future 6G systems, where the density of connected machines is expected to grow by orders of magnitude and random access congestion will only intensify. The work was supported in part by Singapore’s National Research Foundation and Infocomm Media Development Authority, and by national research programs in China, with the first author conducting part of the research as a visiting doctoral student at the Singapore University of Technology and Design. As networks worldwide prepare to absorb billions more chattering sensors and actuators, the lesson of this study is clear: the smartest networks may be those that know exactly when to trust their mathematics and when to let the data speak.

Subject of Research: Theory-guided AI for scalable random access congestion control in massive machine-type communications

Article Title: Theory-guided AI for scalable random access in massive machine-type communications

Article References: Li, Z., Lin, W., Liu, J.-T., Mao, N. V., Chen, B., & Liu, J. (2026). Theory-guided AI for scalable random access in massive machine-type communications. International Journal of Machine Learning and Cybernetics, 17(10), Article 465. https://doi.org/10.1007/s13042-026-03304-0

Image Credits: AI Generated

DOI: 10.1007/s13042-026-03304-0

Keywords: theory-guided AI, random access, massive machine-type communications, 5G New Radio, PRACH congestion, grant-free transmission, backlog estimation, traffic prediction, deep learning, medium access control, IoT scalability, queueing theory

The research, led by Zhi Li of Tiangong University with colleagues from The First Affiliated Hospital of Hebei North University and Tianjin Medical University Cancer Institute & Hospital, tackles the multi-priority admission problem across three clinically distinct departments: Endocrinology, Cardiology, and Nephrology. These units serve large populations of patients with multiple coexisting conditions, meaning that a single patient may be clinically appropriate for more than one department, and each department’s bed pool is contested by overlapping streams of demand. In such an environment, deciding which department should admit which patient, and when, is far from trivial.

At the heart of the study is a finite-horizon Markov Decision Process, a classical mathematical framework for sequential decision-making under uncertainty. In this formulation, the state of the system captures the number of available beds in each department at each decision epoch, while the actions available to the admission service centre include assigning an arriving patient to one of the eligible departments or rejecting the patient outright. The model’s reward structure combines the net benefit of a successful admission with an explicit penalty for balking, thereby quantifying what has long been an implicit and unmeasured cost: the harm done when a patient is refused admission because of bed shortages.

This balking penalty is the study’s key conceptual innovation. Traditional bed-allocation policies typically treat a rejection as a neutral event, or at best a minor loss, which encourages myopic decisions that fill beds in one department while pushing waiting patients toward eventual abandonment. By embedding the balking penalty directly into the objective function, the model forces the scheduler to weigh the immediate benefit of an admission against the future risk of a costlier rejection. The result is a more far-sighted policy that strategically reserves capacity in some departments to protect against demand surges in others.

Another distinctive feature is the dynamic multi-priority assignment mechanism, structured around first, second, and third admission attempts. Rather than committing to a single department at the moment of referral, the admission service centre can offer a patient to their first-choice department, and if capacity is unavailable, re-offer to second and third eligible alternatives. The MDP determines, at every state, which department to try first for each patient class and under what bed-availability conditions the scheduler should escalate to a lower-priority option or, ultimately, accept the balking penalty. This layered attempt structure mirrors the way skilled hospital coordinators actually work, but it optimizes those choices systematically rather than by intuition.

Because the state and action spaces of the model are finite, the authors employ a value iteration algorithm to solve the MDP and derive the optimal policy, which they label Policy-PC for Priority Cutoff. Value iteration repeatedly refines estimates of the expected total net benefit from each state until convergence, yielding a policy that specifies the best action at every possible configuration of bed occupancy and pending patient priority. The resulting cutoff structure has an intuitive interpretation: for each department and patient priority level, there is a bed-availability threshold below which the policy stops directing that patient class to the department, preserving its beds for patients who can be admitted nowhere else.

The empirical case is grounded in real-world hospital data drawn from the participating institutions. Using admission records and demand patterns from the Endocrinology, Cardiology, and Nephrology services, the team calibrated arrival rates, length-of-stay distributions, and clinical eligibility rules, then evaluated Policy-PC against four benchmark policies. The benchmarks include the widely used first-come, first-served discipline and a smallest-workload heuristic that routes each patient to the department with the lightest current burden. These comparisons were run across a designed set of experimental scenarios to test robustness under varying load conditions.

The computational results are striking. Policy-PC significantly reduced patient balking rates relative to all four benchmark policies, meaning fewer patients were turned away over the planning horizon. At the same time, the policy improved bed utilization, indicating that the gains came not from hoarding capacity but from allocating it more intelligently across the three departments. The study attributes this dual improvement to the priority cutoff thresholds, which absorb demand flexibly during busy periods while protecting access for the most constrained patient classes, ultimately balancing resource loads in a way that static allocation schemes cannot.

Beyond the headline numbers, the work offers hospital managers a practical decision-support tool. The MDP policy can be recomputed as demand patterns shift, and the explicit balking penalty gives administrators a tunable dial for balancing financial objectives against patient satisfaction and access. For multimorbid populations, who often face the longest waits and the highest clinical risk from delay, even modest reductions in balking can translate into meaningfully better outcomes. The authors suggest that the framework extends naturally to other department clusters and to richer settings involving elective and emergency streams competing for the same beds.

The research was supported by the National Natural Science Foundation of China and a Tianjin enterprise-funded research project, and it was approved by the ethics committee of The First Affiliated Hospital of Hebei North University. Published open access, the study arrives at a moment when health systems everywhere are searching for algorithmic levers to relieve congestion without new construction. By proving that a value-iteration-derived priority cutoff policy can simultaneously cut balking and raise utilization, the authors make a compelling case that the future of hospital admissions lies not in more beds alone, but in smarter, dynamically optimized decisions about the beds that already exist.

Subject of Research: Dynamic multi-priority hospital admission scheduling for multimorbid patients using a Markov decision process with balking penalties

Article Title: Dynamic multi-priority admission scheduling for multimorbid patients: an MDP approach incorporating balking penalties

Article References: Dynamic multi-priority admission scheduling for multimorbid patients: an MDP approach incorporating balking penalties. (n.d.). https://doi.org/10.1007/s40747-026-02476-0

Image Credits: AI Generated

DOI: 10.1007/s40747-026-02476-0

Keywords: hospital admission scheduling, multimorbid patients, Markov decision process, balking penalties, value iteration, bed utilization, queueing theory, healthcare operations, priority cutoff policy, admission control, hospital bed management, operations research