Analysis of the discrete-time GI/Geom(n)/1/N queue

Analysis of the discrete-time GI/Geom(n)/1/N queue

0.00 Avg rating0 Votes
Article ID: iaor19961063
Country: United Kingdom
Volume: 31
Issue: 1
Start Page Number: 59
End Page Number: 68
Publication Date: Jan 1996
Journal: Computers & Mathematics with Applications
Authors: , ,
Keywords: computational analysis
Abstract:

In this paper, the authors consider the discrete-time single-server finite-buffer late arrival with delayed access queue GI/Geom(n)/1/N. Whereas the interarrival times are independently identically distributed random variables with arbitrary probability mass function, the service times are geometrically distributed random variables with probability of a service completion during a slot dependent on the number of customers present in the system. Using the supplementary variable technique, the authors obtain probability distributions of numbers of customers in the system at arbitrary and prearrival epochs as well as an outside observer’s distribution. In addition, they derive some important results which are used to develop relations between probabilities at prearrival and arbitrary epochs. Results obtained in this paper can be used in several areas such as performance evaluation of computer-communication systems.

Reviews

Required fields are marked *. Your email address will not be published.