The frame construction of an apartment complex that consists of multiple buildings encounters various uncertainties, owing to the complex relationships among units of work. Currently, the period of such a construction is calculated based on the number of floors of the highest building in the complex. This study quantitatively analyzes an apartment frame construction period using a queue model and evaluates the validity of the estimated period. In this regard, a methodology is proposed for analyzing the construction period by applying the concept of a customer and a server. A case study on the duration of an apartment frame construction is conducted with Korea Land and Housing Corporation, which has supplied the largest number of apartments in South Korea. It was found that the stable state of a queue system was observed when the rate of server utilization was applied to the basement and aboveground floors. However, a stable state was not reached on the ground floor. This study includes non-working days in its calculation and quantitatively analyzes uncertainty factors during construction. Therefore, the findings can be practically utilized to quantitatively plan the durations of work units in an apartment frame construction.

This paper provides the first-time ever analytic modelling for Pointwise Stationary Fluid Flow Approximation(PSFFA) model of the non-stationary

The theory of Ismail's non-extensive maximum entropy solution (NME) is described in detail. It is used as an inductive inference technique for heavy-tailed queues with a non-robust mean queue length and a non-extensive "long-range" interaction. In our novel method, we substitute the non-robust mean queue length for the conventional Pollaczeck-Khinchin mean queue length. In other words, the new non-extensivity parameter q will be included in the resulting state probability function. Numerical portraits are provided to capture the influential effect of the derived formalism, , on the stable M//1 queue with heavy tails. More potentially, some applications of Hurst Exponent to social computing and connected health are provided. Conclusion with some challenging open problems and possible future research pathways are given.

There is a case about a system comprising two queues of M/M(a)/1/K with a due date with FCFS service policy in each queue. Using the methods of simulation and mathematical analysis, the solution diagrams were illustrated for the fixed due date Ɵ=1 second at the phase of due date up to the commencement of the service, limited capacity K₁=5 and K₂=4, for both scenarios of different service management rate resulted. For the analytical solution, first, a SAN model from the system was created in the Mobius tool. For simulation, a java discrete systems simulation code was used. Adjustment of the initial values, selection of the scenarios for service rate, the number of the consumers in the simulation, etc. were all carried out in the simulation code.

This paper provides a new discovery that adds to the contemporary theory of modelling of non-stationary queues, by capturing analytically the behavior of the root parameter, for the G1/M/1 PSFFA model of non-stationary Ek/M/1 queue. Additionally, it has been also revealed that the resulting root parameter reduces to the PSFFA model of non-stationary queue. Potential applications of PSFFA to Computer engineering are provided. Some challenging open problems are addressed combined with closing remarks and future research directions.

Information geometry is a mathematical framework that analyses the structure of statistical models using concepts from differential geometry. It treats families of probability distributions as manifolds, where the parameters of each model determine the coordinate charts. By applying info-geometric tools, we can gain insights into the characteristics of these models. The approach involves characterizing the queueing system's manifold using information geometry and presenting the exponential of the information matrix. This integration of information geometry with queueing theory provides a novel perspective for analyzing the dynamics of queueing systems, incorporating relativistic and Riemannian concepts. Some applications to E-health are highlighted. Finally, closing remarks and the next phase of research.

The paper explores the Kullback-Leibler divergence formalism (KLDF) applied to the stable MG1 queue manifold. It explores the analytic forms of state probabilities and their maximization based on entropy functionals, subject to normalization and mean value constraints. The credibility of KLDF is justified through consistency axioms, and the application of Rényi's and Tsallis's formalisms on a stable M/G/1 queue is examined, resulting in novel state probabilities and insights into information theory of Queue Learning.

Sharding shows great potential for extending the blockchain. The current challenge facing sharded blockchain technology lies in addressing the extended transaction confirmation times caused by isolated states between shards and unbalanced transaction allocation strategies. These factors contribute to an increase in cross-shard transactions and disproportionate shard workload, ultimately resulting in indefinite confirmation delays for cross-shard transactions. A critical priority for sharded blockchain systems is to conduct a comprehensive qualitative analysis to better understand and mitigate the prolonged transaction confirmation times. We introduce a Product-Form Queue Network (PFQN) model to address the transaction confirmation time problem in sharded blockchains and incorporate a new confirmation queue to more accurately simulate the actual transaction confirmation process in the blockchain. In addition, we provide a detailed quantitative analysis of the relationship between network load, consensus efficiency, and security in sharded blockchains, laying a theoretical foundation for achieving robustness and efficiency in sharded blockchains. This research not only contributes to addressing the scalability issues in sharded blockchains but also offers a new perspective for future research directions.

The convergence of artificial intelligence and the Internet of Things (IoT) has made remarkable strides in the realm of industry. The IoT devices in this computing model gather data from various sources and send it to edge servers for real-time processing, which presents a challenge to the existing message queue systems in Artificial Intelligence of Things (AIoT) Edge computing. These systems lack the adaptability to respond to the current state of the system, such as changes in the number of devices, message size, and frequency, and optimize the message transmission mechanism accordingly. Hence, it is critical to devise an approach that can effectively decouple message processing and mitigate workload fluctuations in the AIoT computing environment. To this end, this study introduces a distributed message queue system that is specifically tailored to the AIoT edge environment, utilizing a reinforcement learning approach to optimize message queue performance. Empirical findings reveal that this pioneering method significantly improves system throughput while handling varying message scenarios.

As more end devices are getting connected, the Internet will become more congested. A variety of congestion control techniques have been developed either on transport or network layers. Active Queue Management (AQM) is a paradigm that aims at mitigating the congestion on the network layer by active buffer control to avoid overflow. However, finding the right parameters for an AQM scheme is challenging, due to the complexity and dynamics of the networks. On the other hand, the Explicit Congestion Notification (ECN) mechanism is a solution that makes visible incipient congestion on the network layer to the transport layer. In this work, we propose to exploit the ECN information to improve AQM algorithms by applying Machine Learning techniques. Our intelligent method uses an artificial neural network to predict congestion and an AQM parameter tuner based on reinforcement learning. The evaluation results show that our solution can enhance the performance of deployed AQM, using the existing TCP congestion control mechanisms.

The problem of optimal scheduling in a system with parallel queues and a single server has been extensively studied in the queueing theory. However, such systems have mostly been studied by assuming homogeneous attributes of arrival and service processes, or in heterogeneous case a Markov random process was usually assumed. In this paper, we explore the possibility of combining simulation and neural network paradigms for optimal scheduling in a heterogeneous system with an arbitrary inter-arrival and service time distributions. The service of any queue by the server is exhaustive. Further routing of the server after the queue has been emptied is as instructed by the trained neural network. Any change in the queue that currently has a server is accompanied by a switching cost. The simulated annealing optimization algorithm which is used to optimize the parameters of the neural network was adapted for numerically evaluated average cost function. A Markov decision problem was formulated for the corresponding markovian queueing system to verify the results of solving the optimization problem. In addition to comparing the actual values of the average cost, the parameter values of the neural network trained on the optimal control policy of the Markov model are also used to determine the domains of parameters required for the simulated annealing defined on a finite discrete domain. Numerical analysis shows the effectiveness of this approach. Moreover, a comparison of the results for different distributions illustrates the insensitivity of the optimal control policy to the shape of the distributions for the same two first moments. Thus, the optimal control policy for an exponential model can be used as a suboptimal one for the general system.

It has been more than a century since Erlang published his paper in 1909. The classical queueing system for the M/D/c queue has been investigated by many authors. The key is to find the roots of an equation using explicit or numerical methods. We present an alternate form of explicit solution(s) of this/these root(s) using the Lambert-W function in this paper. In addition, the unsaturated probabilities of the number of customers in the system is derived explicitly in terms of this/these root(s). Finally, the mean number of customers in the system and the mean queueing delay are obtained from these probabilities. The exact queueing delay formula for the M/D/c queue is expressed in closed-form in terms of the root(s). Numerical results show that they are in excellent agreement with the numerical results published by Seelen, Tijms and Van Hoorn.

The paper explores the Kullback-Leibler divergence formalism (KLDF) applied to the stable MG1 queue manifold. More potentially, both service time probability and cumulative functions which make KLDF exact are obtained. The credibility of KLDF is justified through consistency axioms. Some potential applications of Kullback-Leibler divergence to Biometry are presented. The paper concludes with closing remarks combined with some challenging open problems and the next phase of research.

The current study characterizes the transient M/M/1 queue manifold info-geometrically, through devising Fisher Information matrix(FIM) and its inverse(IFIM). Additionally, the impact of stability on the existence of IFIM and explore the geodesic equations of motion has been revealed. More potentially, the paper discusses some info-geometric applications to Machine Learning are highlighted. Closing remarks with some challenging open problems combined with the next phase of research are given.

From a differential geometric perspective, information geometry (IG) aims to characterise the structure of statistical geodesic models. The research done for this paper offers a novel method for modelling the information geometry of a queuing system. From the perspective of IG, the manifold of the transient M/M/infinity queue is described in this context. The Fisher Information matrix (FIM) as well as the inverse of (FIM), (IFIM) of transient M/M/infinity QM are devised. In addition to that, new results that uncovered the significant impact of stability of QM on the existence of (IFIM) are obtained. Moreover, the Geodesic equations of motion of the coordinates of the underlying transient are obtained. Also, it is revealed that stable QM is developable (i.e., has a zero Gaussian curvature) and has a non-zero Ricci Curvature Tensor (RCT). Novel stability dynamics of transient M/M/iInfinity queue manifold is revealed by discovering the mutual dual impact between the behaviour of (RCT) and the stability(instability) phases of M/M/Infinity QM. Furthermore, a new discovery that presents the significant impact of stability of queue manifold and the continuity of the unique representation between M/G/1 queue manifold and Ricci Curvature Tensor (RCT). The information matrix exponential (IME) is devised. Also, it is shown that stability of the devised (IME) enforces the instability of M/M/ Infinity QM. More interestingly, novel relativistic info-geometric queueing theoretic links are revealed .