Discrete-time buffers with variable-length trainarrivals
Sabine Wittevrongel · Electronics Letters · 1998
An infinite capacity single server queueing system is considered, to which messages consisting of a variable number of fixed-length packets arrive at the rate of one packet per slot (‘train arrivals’). Assuming geometrically distributed message lengths, an exact closed-form expression for the probability generating function (pgf) of the buffer contents is obtained.