The G/M/1 queue revisited (Q811972)

The goal of this paper is two-fold: (1) To introduce new derivations of some well-known results, and (2) to present some new results for the G/M/1 queue and its variants. In particular, it pays attention to the G/M/1 queue with a set-up time at the start of each busy period, to the G/M/1 queue with exceptional first service time, and to the cycle maximum of the G/M/1 queue. The main methods in the paper are (a) martingale techniques, (b) transform techniques, and (c) sample-path arguments, exploiting duality between the attained and virtual waiting time processes.