IDENTIFIABILITY IN GI/G/K QUEUES
CALIFORNIA UNIV BERKELEY OPERATIONS RESEARCH CENTER
Pagination or Media Count:
Consider a queueing system in which customers arrive in accordance with a renewal process having an unknown distribution F, and in which the service times are independent and have unknown distribution G. We assume that there are kk or infinity servers. Let Ct denote the number of customers in the system at time t. It is shown that F and G are identifiable from the set Ct, t or 0 if either G or F is continuous, if Fx 1 for all x, and if the number of busy periods is infinite almost surely. Secondly, it is shown that F and G are identifiable if G is not lattice and the queue size a.s. converges to infinity.
- Operations Research