Document Type
Thesis
Date of Award
10-31-1992
Degree Name
Master of Science in Computer and Information Science - (M.S.)
Department
Computer and Information Science
First Advisor
Daniel Y. Chao
Abstract
The performance measures are derived for a queueing system which is characterized by its synchronous server operations. This property is the one which normal queueing systems lack. A system of this nature contains a single common server to which multiple number of buffers are connected in parallel, where the server operates only when all system buffers are occupied.
In this thesis, the analysis is carried out focusing on the simplest system involving only two buffers. Throughout the analysis, a symmetricity of the system is assumed (i.e., system is symmetrical in terms of arriving customer statistics.). Also assumed are the Poisson arrival and the exponential service time distribution.
As a first step, the behaviour of the original system is investigated and, as a result, it is converted into an equivalent M/G/1 with the new probability density function of the arriving packets. Once we obtain the equivalent model, we apply M/G/1 analyzing method to the model and derive the probability of queue length in a closed form. The deviation of the result from that of M/M/1 are considered. All the performance measures directly follow from the probability of queue length equation.
Recommended Citation
Hur, Wonmu, "Performance analysis of queueing systems with synchronous server" (1992). Theses. 2283.
https://digitalcommons.njit.edu/theses/2283
