Search Results (49)

This study examines a single-server Markovian queueing system featuring continuous service and an infinite number of customers at both ends—namely, offline and online clients. Offline customers are conventional clients who arrive at the system following a Poisson process, while online customers are assumed to be endlessly present in the system. All service times are exponentially and identically distributed and independent. Utilizing generating functions and Laplace transform techniques, this study derives exact analytical expressions for the system size probabilities in both transient and steady states. Furthermore, it evaluates key performance measures for each state and provides graphical representations to illustrate the system’s dynamics, thereby enriching the understanding of its operational behavior. This work contributes to the advancement of priority-based queueing models and proposes a novel framework applicable to hybrid service architectures in contemporary digital ecosystems. Full article

An $MAP/PH/N$-type queuing system functioning within a finite-state Markovian random environment is studied. The random environment’s state impacts the number of available servers, the underlying processes of customer arrivals and service, and the impatience rate of customers. The impact on the state space of the underlying processes of customer arrivals and of the more general, as compared to exponential, service time distribution defines the novelty of the model. The behavior of the system is described by a multidimensional Markov chain that belongs to the classes of the level-independent quasi-birth-and-death processes or asymptotically quasi-Toeplitz Markov chains, depending on whether or not the customers are absolutely patient in all states of the random environment or are impatient in at least one state of the random environment. Using the tools of the corresponding processes or chains, a stationary analysis of the system is implemented. In particular, it is shown that the system is always ergodic if customers are impatient in at least one state of the random environment. Expressions for the computation of the basic performance measures of the system are presented. Examples of their computation for the system with three states of the random environment are presented as 3-D surfaces. The results can be useful for the analysis of a variety of real-world systems with parameters that may randomly change during system operation. In particular, they can be used for optimally matching the number of active servers and the bandwidth used by the transmission channels to the current rate of arrivals, and vice versa. Full article

Background/Objectives: The COVID-19 pandemic underscored the urgent need for rapid, efficient testing methods at large-scale events to control virus spread. This study leverages queueing theory to explore how different floor plan configurations affect the efficiency of Rapid Antigen Diagnostic Test (RADT) centers at mass gatherings, aiming to enhance throughput and minimize wait times. Methods: Employing the MAP/PH/c model (Markovian Arrival Process/phase-type service distribution with c servers), this study compared the operational efficiency of RADT centers using U-shaped and straight-line floor plans. The research involved 500 healthy participants, who underwent the RADT process, including queue number issuance, registration, sample collection, sample mixing, and results dissemination. Agile management techniques were implemented to optimize operations. Results: The findings demonstrated that the U-shaped layout was more efficient than the straight-line configuration, reducing the average time from sample collection to results acquisition—1.6 minutes in the U-shaped layout versus 1.8 minutes in the straight-line layout. The efficiency of the U-shaped layout was particularly notable at the results stage, with statistically significant differences (p < 0.05) in reducing congestion and improving resource allocation. Conclusions: The study confirms the feasibility of implementing RADT procedures at mass gatherings and identifies the U-shaped floor plan as the optimal configuration. This layout significantly enhances testing efficiency and effectiveness, suggesting its suitability for future large-scale testing scenarios. The research contributes to optimizing mass testing strategies, vital for public health emergency management during pandemics. Full article

Nowadays, efficient spectrum usage is one of the most important design principles to take into account in wireless communications due to the exponential growth of mobile devices. In that sense, solutions such as Non-Orthogonal Multiple Access (NOMA) and cognitive radio (CR) have been proposed. In essence, NOMA allows some interference level by using non-orthogonal resource allocation with a tolerable increase in receiver complexity employing successive interference cancellation (SIC). In this work, a novel mathematical model of teletraffic for users performing accessment, simultaneously, by means of Orthogonal Multiple Access (OMA) and NOMA, is developed using a Markovian process that considers bursts of arrivals to model the access schemes. This novel procedure implies a closed-form solution of the proposed system compared to other works where these parameters are estimated assuming the moment generating function obtained with approximation models. The model is validated with a discrete event simulator, considering different scenarios and simulation conditions. The simulation results are in agreement with the mathematical solution proposed. Full article

To ensure the efficient functioning of solar energy generation systems, it is crucial to have dependable designs and regular maintenance. However, when these systems or their components operate at multiple working levels, optimizing reliability becomes a complex task for models and analyses. In the context of reliability modeling in solar energy generation systems, researchers often assume that random variables follow an exponential distribution (binary-state representation) as a simplification, although this may not always hold true for real-world engineering systems. In the present paper, a multi-state solar energy generating system with inverters in series configuration is investigated, in which unreliable by-pass changeover switches, common cause failures (CCFs), and multiple repairman vacations are also considered. Furthermore, the arrivals of CCFs and the repair processes of the failed system due to CCFs are governed by different Markovian arrival processes (MAPs), and the lifetimes and repair times of inverters and by-pass changeover switches and the repairman vacation time in the system have different phase-type (PH) distributions. Therefore, the behavior of the system is represented using a Markov process methodology, and reliability measures for the proposed system are derived utilizing aggregated stochastic process theory. Finally, a numerical example and a comparison analysis are presented to demonstrate the findings. Full article

This article concerns the problem of estimating the throughput and forecasting the operation of a coal transshipment complex that comprises a marine coal terminal and a railway station. Scenario modeling is employed to address this issue. The mathematical model of the transshipment complex has the form of a queuing network, which allows us to take into account the impact of random factors on the arrival of trains and departure of vessels from the system and their handling. In the model, we use the batch marked Markovian arrival process (BMMAP), which allows for the batch arrival of several types of requests, to describe the arrival of different categories of trains. Various queuing systems model particular structural elements of the complex to consider peculiarities of their work. We investigate the coal transshipment complex, which includes one of the largest and most modern coal export terminals in Russia. Based on the results of a numerical study, we estimate its current and maximum throughput, find bottlenecks in the system structure, and forecast its performance after the planned modernization. We also discuss the advantages and limitations of the model presented and its potential extension. Full article

This paper presents a study of fork–join systems. The fork–join system breaks down each customer into numerous tasks and processes them on separate servers. Once all tasks are finished, the customer is considered completed. This design enables the efficient handling of customers. The customers enter the system in a MAP flow. This helps create a more realistic and flexible representation of how customers arrive. It is important for modeling various real-life scenarios. Customers are divided into $K\ge 2$ tasks and assigned to different subsystems. The number of tasks matches the number of subsystems. Each subsystem has a server that processes tasks, and a buffer that temporarily stores tasks waiting to be processed. The service time of a task by the k-th server follows a PH (phase-type) distribution with an irreducible representation (${\beta }_k$, $S_k$), $1\le k\le K$. An analytical solution was derived for the case of $K=2$ when the input MAP flow and service time follow a PH distribution. We have efficient algorithms to calculate the stationary distribution and performance characteristics of the fork–join system for this case. In general cases, this paper suggests using a combination of Monte Carlo and machine learning methods to study the performance of fork–join systems. In this paper, we present the results of our numerical experiments. Full article

We discuss two queueing-inventory systems with catastrophes in the warehouse. Catastrophes occur according to the Poisson process and instantly destroy all items in the inventory. The arrivals of the consumer customers follow a Markovian arrival process and they can be queued in an infinite buffer. The service time of a consumer customer follows a phase-type distribution. The system receives negative customers which have Poisson flows and as soon as a negative customer comes into the system, he causes a consumer customer to leave the system, if any. One of two inventory policies is used in the systems: either $(s,S)$ or $(s,Q)$. If the inventory level is zero when a consumer customer arrives, then this customer is either lost (lost sale) or joins the queue (backorder sale). The system is formulated by a four-dimensional continuous-time Markov chain. Ergodicity condition for both systems is established and steady-state distribution is obtained using the matrix-geometric method. By numerical studies, the influence of the distributions of the arrival process and the service time and the system parameters on performance measures are deeply analyzed. Finally, an optimization study is presented in which the criterion is the minimization of expected total costs and the controlled parameter is warehouse capacity. Full article

In recent times, we have encountered new situations that have imposed restrictions on our ability to visit public places. These changes have affected various aspects of our lives, including limited access to supermarkets, vegetable shops, and other essential establishments. As a response to these circumstances, we have developed a continuous review retrial queueing–inventory system featuring a single server and controlled customer arrivals. In our system, customers arriving to procure a single item follow a Markovian Arrival Process, while the service time for each customer is modeled by an exponential distribution. Inventories are replenished according to the $(s,Q)$ reordering policy with exponentially distributed lead times. The system controls arrival in the waiting space with setup time. The customers who arrive at a not allowed situation decide to enter an orbit of infinite size with predefined probability. Orbiting customers make retrials to claim a place in the waiting space, and their inter-retrial times are exponentially distributed. The server may experience essential interruption (emergency situation) which arrives according to Poisson process. Then, the server goes for an emergency vacation of a random time which is exponentially distributed. In the steady-state case, the joint probability of the number of customers in orbit and the inventory level has been found, and the Matrix Geometric Method has been used to find the steady-state probability vector. In numerical calculations, the convexity of the system and the impact of F-policy and emergency vacation in the system are discussed. Full article

The problem of optimal scheduling in a system with parallel queues and a single server has been extensively studied in queueing theory. However, such systems have mostly been analysed by assuming homogeneous attributes of arrival and service processes, or Markov queueing models were usually assumed in heterogeneous cases. The calculation of the optimal scheduling policy in such a queueing system with switching costs and arbitrary inter-arrival and service time distributions is not a trivial task. In this paper, we propose to combine simulation and neural network techniques to solve this problem. The scheduling in this system is performed by means of a neural network informing the controller at a service completion epoch on a queue index which has to be serviced next. We adapt the simulated annealing algorithm to optimize the weights and the biases of the multi-layer neural network initially trained on some arbitrary heuristic control policy with the aim to minimize the average cost function which in turn can be calculated only via simulation. To verify the quality of the obtained optimal solutions, the optimal scheduling policy was calculated by solving a Markov decision problem formulated for the corresponding Markovian counterpart. The results of numerical analysis show the effectiveness of this approach to find the optimal deterministic control policy for the routing, scheduling or resource allocation in general queueing systems. Moreover, a comparison of the results obtained for different distributions illustrates statistical insensitivity of the optimal scheduling policy to the shape of inter-arrival and service time distributions for the same first moments. Full article

In this paper, we consider two queuing models. Model 1 considers a single-server working vacation queuing system with interdependent arrival and service processes. The arrival and service processes evolve by transitions on the product space of two Markovian chains. The transitions in the two Markov chains in the product space are governed by a semi-Markov rule, with sojourn times in states governed by the exponential distribution. In contrast, in the second model, we consider independent arrival and service processes following phase-type distributions with representation $(\mathbf{\alpha },T)$ of order m and $(\mathbf{\beta },S)$ of order n, respectively. The service time during normal working is the above indicated phase-type distribution whereas that during working vacation is a phase-type distribution with representation $(\mathbf{\beta },\theta S)$, $0<\theta <1$. The duration of the latter is exponentially distributed. The latter model is already present in the literature and will be briefly described. The main objective is to make a theoretical comparison between the two. Numerical illustrations for the first model are provided. Full article

In this paper, we consider a queueing system consisting of two multi-server subsystems that is designed for the service of clients arriving at a system according to a Markovian arrival process (MAP). Arriving clients receive information about the number of clients present in both subsystems and use this information to make a randomized decision to balk (depart without receiving service) or join the system. In the latter case, they also decide which subsystem they would like to join. One subsystem has an infinite buffer, while the buffer of the second subsystem is finite. The service time distribution is exponential in the first subsystem and phase-type in the second subsystem. During the waiting in the chosen buffers, after the random time intervals, each waiting client checks the status of the alternative subsystem. If some server in that subsystem is idle during this epoch, the client immediately leaves the buffer where it has been staying and starts a service in the alternative subsystem. The problem of computing the steady-state distribution of this system is solved. The feasibility of the proposed solution and certain features of the system’s behavior are numerically illustrated. Full article

In this paper, we consider a single server queueing system in which the arrivals occur according to a Markovian arrival process (MAP). The served customers may be recruited (or opted from those customers’ point of view) to act as secondary servers to provide services to the waiting customers. Such customers who are recruited to be servers are referred to as secondary servers. The service times of the main as well as that of the secondary servers are assumed to be exponentially distributed possibly with different parameters. Assuming that at most there can only be one secondary server at any given time and that the secondary server will leave after serving its assigned group of customers, the model is studied as a QBD-type queue. However, one can also study this model as a GI/M/1-type queue. The model is analyzed in steady state, and a few illustrative numerical examples are presented. Full article

In a recent work we introduced a semi-Markovian discrete-time generalization of the telegraph process. We referred to this random walk as the ‘squirrel random walk’ (SRW). The SRW is a discrete-time random walk on the one-dimensional infinite lattice where the step direction is reversed at arrival times of a discrete-time renewal process and remains unchanged at uneventful time instants. We first recall general notions of the SRW. The main subject of the paper is the study of the SRW where the step direction switches at the arrival times of a generalization of the Sibuya discrete-time renewal process (GSP) which only recently appeared in the literature. The waiting time density of the GSP, the ‘generalized Sibuya distribution’ (GSD), is such that the moments are finite up to a certain order $r\le m-1$ ($m\ge 1$) and diverging for orders $r\ge m$ capturing all behaviors from broad to narrow and containing the standard Sibuya distribution as a special case ($m=1$). We also derive some new representations for the generating functions related to the GSD. We show that the generalized Sibuya SRW exhibits several regimes of anomalous diffusion depending on the lowest order m of diverging GSD moment. The generalized Sibuya SRW opens various new directions in anomalous physics. Full article

In this paper, we consider the batch arrival of customers to a transport station. Customers belonging to each category is considered as a single entity according to a BMMAP. An Erlang clock of order m starts ticking when the transport vessel reaches the station. When the Lth stage of the clock is reached, an order for the next vessel is placed. The lead time for arrival of the vessel follows exponential distribution. There are two types of rooms in this system: the waiting rooms and the service rooms for customers in the transport station and in the vessel, respectively. The waiting room capacity for customers of type 1 is infinite whereas those for customer of type $2,\dots ,k$ are of finite capacities. The service room capacity $C_j$ for customer type $j,j=1,2,\dots ,k$ is finite. Upon arrival, customers of category j occupy seats designated for that category in the vessel, provided there is at least one vacancy belonging to that category. The total number of vessels with the operator is $h^{*}$. The service time of each vessel follows exponential distribution with parameter $\mu .$ Each group of customers belong to category j searches independently for customers of this category to mobilize passengers when the Erlang clock reaches $L_1$ where $L_1<L$. The search time for customers of category j follows exponential distribution with parameter ${\lambda }_j.$ The stability condition is derived. Some performance measures are estimated. Full article