A second look at a queueing system with moving average input process

Abstract
We consider a single-server queueing system with first-come first-served queue discipline in which (i) customers arrive at the instants 0 = A0 < A1 < A2 < …, with time interval between the mth and (m+1)th arrivals

This publication has 0 references indexed in Scilit: