Abstract: In this paper, the flow of different classes of patients
into a hospital is modelled and analyzed by using the queueing
network analyzer (QNA) algorithm and discrete event simulation.
Input data for QNA are the rate and variability parameters of the
arrival and service times in addition to the number of servers in each
facility. Patient flows mostly match real flow for a hospital in Egypt.
Based on the analysis of the waiting times, two approaches are
suggested for improving performance: Separating patients into
service groups, and adopting different service policies for sequencing
patients through hospital units. The separation of a specific group of
patients, with higher performance target, to be served separately from
the rest of patients requiring lower performance target, requires the
same capacity while improves performance for the selected group of
patients with higher target. Besides, it is shown that adopting the
shortest processing time and shortest remaining processing time
service policies among other tested policies would results in,
respectively, 11.47% and 13.75% reduction in average waiting time
relative to first come first served policy.
Abstract: We present a new numerical method for the computation of the steady-state solution of Markov chains. Theoretical analyses show that the proposed method, with a contraction factor α, converges to the one-dimensional null space of singular linear systems of the form Ax = 0. Numerical experiments are used to illustrate the effectiveness of the proposed method, with applications to a class of interesting models in the domain of tandem queueing networks.
Abstract: The modern queueing theory is one of the powerful
tools for a quantitative and qualitative analysis of communication systems, computer networks, transportation systems, and many other technical systems. The paper is designated to the analysis of queueing
systems, arising in the networks theory and communications theory
(called open queueing network). The authors of this research in the
sphere of queueing theory present the theorem about the law of the iterated logarithm (LIL) for the queue length of a customers in open
queueing network and its application to the mathematical model of
the open message switching system.
Abstract: Urban road network traffic has become one of the
most studied research topics in the last decades. This is mainly due to
the enlargement of the cities and the growing number of motor
vehicles traveling in this road network. One of the most sensitive
problems is to verify if the network is congestion-free. Another
related problem is the automatic reconfiguration of the network
without building new roads to alleviate congestions. These problems
require an accurate model of the traffic to determine the steady state
of the system. An alternative is to simulate the traffic to see if there
are congestions and when and where they occur. One key issue is to
find an adequate model for road intersections. Once the model
established, either a large scale model is built or the intersection is
represented by its performance measures and simulation for analysis.
In both cases, it is important to seek the queueing model to represent
the road intersection. In this paper, we propose to model the road
intersection as a BCMP queueing network and we compare this
analytical model against a simulation model for validation.