The importance for this tutorial is to introduce the students into the loss systems, and, to underline the difference between the concepts of call-blocking and time-blocking probabilities, and to understand under which conditions these probabilities are identical. The selected exercises introduce, also, the Erlang tables, which is an important tool for easy calculations for the blocking probabi...

In this paper, we investigate the fuzzy logic based system characteristics of MX/G/1 retrial queuing system with Bernoulli vacation schedule. The service time and vacation time are assumed to be generally distributed. It is found in many practical situations that the queuing models with fuzzy parameters are much more realistic than the classical crisp parameters based queuing models. We have...

Based on queuing theory we develop analytical approximations for the average packet transfer time of a store-and-forward and a cutthrough buffer insertion ring with two client traffic priorities. These types of rings are architectural alternatives for resilient packet rings (RPR) which transport data (e.g., IP) packets over optical media. We use the approximations for a delay comparison of both...

Today, in a competitive market, service organizations and producers have a great attention to optimization and customer satisfaction in order to become competitive. Service organization must reduce the number of arrival, waiting time and service time in the queue to increase the customer satisfaction. In this paper by the aim of queuing theory we analyze the optimal amount of increment in a rep...

We consider a multiserver queuing process speciied by i.i.d. interarrival time, batch size and service time sequences. In the case that diierent servers have diierent service time distributions we say the system is heterogeneous. In this paper we establish conditions for the queuing process to be characterized as a geometrically Harris recurrent Markov chain, and we characterize the stationary ...

This paper presents a new mathematical model to solve cell formation problem in cellular manufacturing systems, where inter-arrival time, processing time, and machine breakdown time are probabilistic. The objective function maximizes the number of operations of each part with more arrival rate within one cell. Because a queue behind each machine; queuing theory is used to formulate the model. T...

Queuing theory is the branch of Operations research in applied mathematics and deals with phenomenon of waiting lines. Queuing theory is concerned with the mathematical modeling and analysis of systems which provides service to random demands. In this paper, we have focused the applications of queuing theory in the field of healthcare (hospital) i.e. one of the biological paradigm. The health s...

Queuing theory has extensively studied the problem of estimating job execution times in steady state conditions both in the case of single queues and queuing networks. This paper discusses the use of closed Queuing Network (QN) models during finite time intervals to estimate the execution time of jobs submitted to a computer system. More specifically, the paper presents the Epochs algorithm tha...