Regenerative processes in the theory of queues, with applications to the alternating-priority queue

Using some well-known and some recently proved asymptotic properties of regenerative processes, we present a new proof in a general regenerative setting of the equivalence of the limiting distributions of a stochastic process at an arbitrary point in time and at the time of an event from an associated Poisson process. From the same asymptotic properties, several conservation equations are derived that hold for a wide class of GI/G/1 priority queues. Finally, focussing our attention on the alternating-priority queue with Poisson arrivals, we use both types of result to give a new, simple derivation of the expected steady-state delay in the queue in each class.

[1]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1951 .

[2]  M. Lighthill,et al.  On kinematic waves I. Flood movement in long rivers , 1955, Proceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences.

[3]  M J Lighthill,et al.  ON KINEMATIC WAVES.. , 1955 .

[4]  Walter L. Smith,et al.  Regenerative stochastic processes , 1955, Proceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences.

[5]  L. Takács Investigation of waiting time problems by reduction to Markov processes , 1955 .

[6]  J. Wolfowitz,et al.  On the Characteristics of the General Queueing Process, with Applications to Random Walk , 1956 .

[7]  Walter L. Smith Renewal Theory and its Ramifications , 1958 .

[8]  J. Little A Proof for the Queuing Formula: L = λW , 1961 .

[9]  J D Littler,et al.  A PROOF OF THE QUEUING FORMULA , 1961 .

[10]  Michel Loève,et al.  Probability Theory I , 1977 .

[11]  Gordon F. Newell,et al.  Queues for a Vehicle-Actuated Traffic Light , 1964 .

[12]  William L. Maxwell,et al.  Queuing with Alternating Priorities , 1965 .

[13]  William S. Jewell,et al.  A Simple Proof of: L = λW , 1967, Oper. Res..

[14]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1967 .

[15]  William L. Maxwell,et al.  Theory of scheduling , 1967 .

[16]  Lajos Takács Two Queues Attended by a Single Server , 1968, Oper. Res..

[17]  Samuel Eilon,et al.  Letter to the Editor - A Simpler Proof of L = λW , 1969, Oper. Res..

[18]  Robert B. Cooper,et al.  Queues served in cyclic order , 1969 .

[19]  Sreekantan S. Nair ON CERTAIN PRIORITY QUEUES , 1969 .

[20]  Jack S. Sykes,et al.  Simplified Analysis of an Alternating-Priority Queuing Model with Setup Times , 1970, Oper. Res..

[21]  R. Wolff Work-conserving priorities , 1970 .

[22]  Shaler Stidham,et al.  On the Optimality of Single-Server Queuing Systems , 1970, Oper. Res..

[23]  Robert B. Cooper Queues served in cyclic order: Waiting times , 1970, Bell Syst. Tech. J..

[24]  Ralph E. Strauch,et al.  When a Queue Looks the Same to an Arriving Customer as to an Observer , 1970 .

[25]  William L. Maxwell,et al.  Letter to the Editor - On the Generality of the Equation L = λW , 1970, Oper. Res..

[26]  Martin Eisenberg Two Queues with Changeover Times , 1971, Oper. Res..

[27]  S. Brumelle On the relation between customer and time averages in queues , 1971 .

[28]  S. Ross,et al.  ASYMPTOTIC PROPERTIES OF CUMULATIVE PROCESSES , 1972 .