Fast Discrete-Event Simulation of Markovian Queueing Networks through Euler Approximation

The efficient management of large-scale queueing networks is critical for a variety of sectors, including healthcare, logistics, and customer service, where system performance has profound implications for operational effectiveness and cost management. To address this key challenge, our paper introduces simulation techniques tailored for complex, large-scale Markovian queueing networks. We develop two simulation schemes based on Euler approximation, namely the backward and forward schemes. These schemes can accommodate time-varying dynamics and are optimized for efficient implementation using vectorization. Assuming a feedforward queueing network structure, we establish that the two schemes provide stochastic upper and lower bounds for the system state, while the approximation error remains bounded over the simulation horizon. With the recommended choice of time step, we show that our approximation schemes exhibit diminishing asymptotic relative error as the system scales up, while maintaining much lower computational complexity compared to traditional discrete-event simulation and achieving speedups up to tens of thousands times. This study highlights the substantial potential of Euler approximation in simulating large-scale discrete systems

Theoretical and Empirical Investigation of Fourier Trajectory Analysis for System Discrimination

With few exceptions, simulation output analysis has focused on static characterizations, to determine a property of the steady-state distribution of a performance metric such as a mean, a quantile, or the distribution itself. Analyses often seek to overcome difficulties induced by autocorrelation of the output stream. But sample paths generated by stochastic simulation exhibit dynamic behavior that is characteristic of system structure and associated distributions. In this technical report, we investigate these dynamic characteristics, as captured by the Fourier transform of a dynamic simulation trajectory. We find that Fourier coefficient magnitudes can have greater discriminatory power than the usual test statistics, and with simpler analysis resulting from the statistical independence of coefficient estimates at different frequencies. Theoretical and Empirical results are provided

Integrating glycolysis, citric acid cycle, pentose phosphate pathway, and fatty acid beta‑oxidation into a single computational model

The metabolic network of a living cell is highly intricate and involves complex interactions between various pathways. In this study, we propose a computational model that integrates glycolysis, the pentose phosphate pathway (PPP), the fatty acids beta-oxidation, and the tricarboxylic acid cycle (TCA cycle) using queueing theory. The model utilizes literature data on metabolite concentrations and enzyme kinetic constants to calculate the probabilities of individual reactions occurring on a microscopic scale, which can be viewed as the reaction rates on a macroscopic scale. However, it should be noted that the model has some limitations, including not accounting for all the reactions in which the metabolites are involved. Therefore, a genetic algorithm (GA) was used to estimate the impact of these external processes. Despite these limitations, our model achieved high accuracy and stability, providing real-time observation of changes in metabolite concentrations. This type of model can help in better understanding the mechanisms of biochemical reactions in cells, which can ultimately contribute to the prevention and treatment of aging, cancer, metabolic diseases, and neurodegenerative disorders

Optimal scheduling and fair servicepolicy for STDMA in underwater networks with acoustic communications

In this work, a multi-hop string network with a single sink node is analyzed. A periodic optimal scheduling for TDMA operation that considers the characteristic long propagation delay of the underwater acoustic channel is presented. This planning of transmissions is obtained with the help of a new geometrical method based on a 2D lattice in the space-time domain. In order to evaluate the performance of this optimal scheduling, two service policies have been compared: FIFO and Round-Robin. Simulation results, including achievable throughput, packet delay, and queue length, are shown. The network fairness has also been quantified with the Gini index

Incorporating within link dynamics in an agent-based computationally faster and scalable queue model

The growing pace of urbanization increases the need of simulation models to handle large-scale scenarios in reasonable time. The present study proposes a fast spatial queue model, which is anchored to an agent-based travel demand simulation framework. The existing queue model is extended to produce more realistic flow dynamics by introducing backward travelling holes to mixed traffic conditions. In this approach, the space freed by a leading vehicle is not immediately available to the following vehicle. The resulting dynamics resembles Newell's simplified kinematic wave model. The space freed corresponding to each leaving vehicle is named as hole' and, as following vehicles occupy the space freed by leading vehicles, the hole travels backward. This results in triangular fundamental diagrams for traffic flow. The robustness of the model is tested with flow density and average bike passing rate contours. Spatio-temporal trajectories are presented to differentiate the queuing patterns. Finally, a comparison of the computational performance of the different link and traffic dynamics of the queue model is made