Queueing Networks: A Survey of Their Random Processes

In this paper we review three topics in queueing network theory: queue length processes, sojourn times, and flow processes. In the discussion of the queue length processes we present results for the continuous-time process and several embedded processes. Then we compare continuous-time processes with embedded processes. In considerable generality we present results for mean sojourn times and discuss the distributions of sojourn times. In the discussion of flow processes we present results for various queueing systems. Our bibliography of over 300 references, while not exhaustive, does cover the major papers for the topics considered.

[1]  J. Doob.  Stochastic processes , 1953 .

[2]  R. R. P. Jackson,et al.  Queueing Systems with Phase Type Service , 1954 .

[3]  E. Reich.  Waiting Times When Queues are in Tandem , 1957 .

[4]  J. R. Jackson.  Networks of Waiting Lines , 1957 .

[5]  R. T. Nelson.  Waiting-Time Distributions for Application to a Series of Service Centers , 1958 .

[6]  P. D. Finch.  The Output Process of the Queueing System M/G/1 , 1959 .

[7]  R. Syski,et al.  Introduction to congestion theory in telephone systems , 1962 .

[8]  A. Ghosal,et al.  Queues in Series , 1962 .

[9]  D. V. Lindley,et al.  Stochastic Service Systems. , 1963 .

[10]  E. Reich.  Note on Queues in Tandem , 1963 .

[11]  G. F. Newell,et al.  Introduction to the Theory of Queues. , 1963 .

[12]  L. Takács.  A single-server queue with feedback , 1963 .

[13]  Hosei Uniuersity,et al.  ON A TANDEM QUEUE WITH BLOCKING , 1963 .

[14]  D. Kendall.  Some Recent Work and Further Problems in the Theory of Queues , 1964 .

[15]  Leonard Kleinrock,et al.  Communication Nets: Stochastic Message Flow and Delay , 1964 .

[16]  R. M. Loynes.  The stability of a system of queues in series , 1964 .

[17]  P. Burke,et al.  The Dependence of Delays in Tandem Queues , 1964 .

[18]  Erhan Çınlar.  Analysis of systems of queues in parallel , 1965 .

[19]  U. N. Bhat.  CUSTOMER OVERFLOW IN QUEUES WITH FINITE WAITING SPACE1 , 1965 .

[20]  B. Avi-Itzhak,et al.  A Sequence of Two Servers with No Intermediate Queue , 1965 .

[21]  Irwin Greenberg,et al.  The Number Served in a Queue , 1966, Oper. Res..

[22]  D. K. Hildebrand.  STABILITY OF FINITE QUEUE, TANDEM SERVER SYSTEMS , 1967 .

[23]  E. Çinlar.  QUEUES WITH SEMI-MARKOVIAN ARRIVALS , 1967 .

[24]  Frederick S. Hillier,et al.  Finite Queues in Series with Exponential or Erlang Service Times - A Numerical Approach , 1966, Oper. Res..

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

[26]  E. Çinlar.  Decomposition of a Semi-Markov Process Under a State Dependent Rule , 1967 .

[27]  牧野 都治.  On a study of output distribution , 1967 .

[28]  E. Çinlar,et al.  On the Superposition of Point Processes , 1968 .

[29]  P. Burke.  The Output Process of a Stationary $M/M/s$ Queueing System , 1968 .

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

[31]  R. Disney,et al.  Finite queues in parallel under a generalized channel selection rule , 1971 .

[32]  Nasser Hadidi,et al.  On the “Output” process of a state dependent queue , 1972 .

[33]  A. Kuczura,et al.  Queues with mixed renewal and poisson inputs , 1972 .

[34]  R. Disney.  A Matrix Solution for the Two Server Queue with Overflow , 1972 .

[35]  S. Stidham.  Regenerative processes in the theory of queues, with applications to the alternating-priority queue , 1972, Advances in Applied Probability.

[36]  D. G. Tambouratzis,et al.  Erlang's formula and some results on the departure process for a loss system , 1973, Journal of Applied Probability.

[37]  J. M. Holtzman.  B.S.T.J. brief: The accuracy of the equivalent random method with renewal inputs , 1973 .

[38]  H. Heffes,et al.  Peakedness of traffic carried by a finite trunk group with renewal input , 1973 .

[39]  Jeffrey P. Buzen,et al.  Computational algorithms for closed queueing networks with exponential servers , 1973, Commun. ACM.

[40]  Anatol Kuczura,et al.  The interrupted poisson process as an overflow process , 1973 .

[41]  D. C. McNickle.  The number of departures from a semi-Markov queue , 1974 .

[42]  Ronald W. Wolff,et al.  The Optimal Order of Service in Tandem Queues , 1974, Oper. Res..

[43]  Carl M. Harris,et al.  Fundamentals of queueing theory , 1975 .

[44]  Charles D. Pack,et al.  The Output of an M/D/1 Queue , 1975, Oper. Res..

[45]  藤沢 武久,et al.  The Departure process of the M/M/1 Queue with Markovian Feedback , 1975 .

[46]  Hisashi Kobayashi,et al.  Queuing Networks with Multiple Closed Chains: Theory and Computational Algorithms , 1975, IBM J. Res. Dev..

[47]  Erol Gelenbe,et al.  On Approximate Computer System Models , 1975, JACM.

[48]  Ralph L. Disney,et al.  Random Flow in Queueing Networks: A Review and Critique , 1975 .

[49]  Frank Kelly,et al.  Networks of queues with customers of different types , 1975, Journal of Applied Probability.

[50]  Wei Chang.  Sequential Server Queues for Computer Communication System Analysis , 1975, IBM J. Res. Dev..

[51]  Donald L. Snyder,et al.  Random point processes , 1975 .

[52]  Ralph L. Disney,et al.  Feedback Queues in the Modelling of Computer Systems: A Survey. , 1975 .

[53]  R.R. Muntz,et al.  Analytic modeling of interactive systems , 1975, Proceedings of the IEEE.

[54]  K. Mani Chandy,et al.  Open, Closed, and Mixed Networks of Queues with Different Classes of Customers , 1975, JACM.

[55]  Wolfgang Krämer,et al.  Total waiting time distribution function and the fate of a customer in a system with two queues in series/ Die Verteilungsfunktion der Gesamtwartezeit und das Schicksal einer Anforderung in einem System mit zwei seriell angeordneten Warteschlangen , 1975, Elektron. Rechenanlagen.

[56]  Paulo Renato de Morais,et al.  Covariance Properties for the Departure Process of M/Ek/1/N Queues , 1976 .

[57]  Ernest Koenigsberg,et al.  Cyclic Queue Models of Fleet Operations , 1976, Oper. Res..

[58]  F. Kelly.  The departure process from a queueing system , 1976, Mathematical Proceedings of the Cambridge Philosophical Society.

[59]  Alan G. Konheim,et al.  A Queueing Model with Finite Waiting Room and Blocking , 1976, JACM.

[60]  Some Properties of Semi-Markov Switches , 1976 .

[61]  F. Kelly,et al.  Networks of queues , 1976, Advances in Applied Probability.

[62]  An M/G/1 Queueing System with Queue-Length Dependent Feedback , 1976 .

[63]  Ralph L. Disney,et al.  Single Server Queues with State Dependent Feedback. , 1976 .

[64]  D. Daley,et al.  Queueing output processes , 1976, Advances in Applied Probability.

[65]  A. Barbour.  Networks of queues and the method of stages , 1976, Advances in Applied Probability.

[66]  John G. Kemeny,et al.  Finite Markov chains , 1960 .

[67]  Jacob Cohen,et al.  On regenerative processes in queueing theory , 1976 .

[68]  R. Schassberger.  Insensitivity of Steady-state Distributions of Generalized Semi-Markov Processes. Part II , 1977 .

[69]  Ralph L. Disney,et al.  Queues with Instantaneous Feedback , 1977 .

[70]  Masakiyo Miyazawa.  Time and customer processes in queues with stationary inputs , 1977 .

[71]  Donald F. Towsley,et al.  Product Form and Local Balance in Queueing Networks , 1977, JACM.

[72]  Uwe Jansen,et al.  Stochastic Processes and Properties of Invariance for Queueing Systems with Speeds and Temporary Interruptions , 1977 .

[73]  Charles D. Pack.  The Output of a ${D / {M / 1}}$ Queue , 1977 .

[74]  Hisashi Kobayashi,et al.  Modeling and analysis , 1978 .

[75]  On the output theorem of queueing theory, via filtering , 1978 .

[76]  R. Schassberger.  The insensitivity of stationary probabilities in networks of queues , 1978, Advances in Applied Probability.

[77]  Donald Gross,et al.  Spares Provisioning for Repairable Items: Cyclic Queues in Light Traffic. , 1978 .

[78]  B. Melamed.  On Poisson traffic processes in discrete-state Markovian systems by applications to queueing theory , 1979, Advances in Applied Probability.

[79]  R. Foley,et al.  Note--Some Results on Sojourn Times in Acyclic Jackson Networks , 1979 .

[80]  O. Boxma.  On a tandem queueing model with identical service times at both counters, II , 1979, Advances in Applied Probability.

[81]  M. Miyazawa.  A formal approach to queueing processes in the steady state and their applications , 1979 .

[82]  M. Reiser,et al.  A Queueing Network Analysis of Computer Communication Networks with Window Flow Control , 1979, IEEE Trans. Commun..

[83]  Frank Kelly,et al.  Reversibility and Stochastic Networks , 1979 .

[84]  Yonathan Bard,et al.  Some Extensions to Multiclass Queueing Network Analysis , 1979, Performance.

[85]  Stephen S. Lavenberg,et al.  Stationary state probabilities at arrival instants for closed queueing networks with multiple types of customers , 1980, Journal of Applied Probability.

[86]  Ward Whitt,et al.  Continuity of Generalized Semi-Markov Processes , 1980, Math. Oper. Res..

[87]  Erol Gelenbe,et al.  Analysis and Synthesis of Computer Systems , 1980 .

[88]  James J. Solberg,et al.  Analysis of Flow Control in Alternative Manufacturing Configurations , 1980 .

[89]  B. Simon,et al.  The M/G/1 Queue with Instantaneous, Bernoulli Feedback. , 1980 .

[90]  D. König,et al.  Imbedded and non-imbedded stationary characteristics of queueing systems with varying service rate and point processes , 1980 .

[91]  Marcel F. Neuts,et al.  Efficient Algorithmic Solutions to Exponential Tandem Queues with Blocking , 1980, SIAM J. Algebraic Discret. Methods.

[92]  Dieter König.  Methods for Proving Relationships between Stationary Characteristics of Queueing Systems with Point Processes , 1980, J. Inf. Process. Cybern..

[93]  J. A. Morrison.  Some traffic overflow problems with a large secondary queue , 1980, The Bell System Technical Journal.

[94]  J. Walrand,et al.  Sojourn times and the overtaking condition in Jacksonian networks , 1980, Advances in Applied Probability.

[95]  Uwe Jansen,et al.  Insensitivity and Steady-state Probabilities in Product Form for Queueing Networks , 1980, J. Inf. Process. Cybern..

[96]  D. Burman.  Insensitivity in queueing systems , 1980, Advances in Applied Probability.

[97]  Peter C Kiessler.  A Simulation Analysis of Sojourn Times in a Jackson Network. , 1980 .

[98]  James J. Solberg,et al.  Capacity Planning with a Stochastic Workflow Model , 1981 .

[99]  A. Barbour,et al.  INSENSITIVE AVERAGE RESIDENCE TIMES IN GENERALIZED SEMI-MARKOV PROCESSES , 1981 .

[100]  Guy Latouche.  On a Markovian queue with weakly correlated interarrival times , 1981 .

[101]  Marcel F. Neuts,et al.  Matrix-Geometric Solutions in Stochastic Models , 1981 .

[102]  W. Whitt.  Comparing counting processes and queues , 1981, Advances in Applied Probability.

[103]  Isi Mitrani,et al.  The Distribution of Queuing Network States at Input and Output Instants , 1979, JACM.

[104]  Jean C. Walrand,et al.  Flows in Queueing Networks: A Martingale Approach , 1981, Math. Oper. Res..

[105]  Ward Whitt,et al.  Approximating a point process by a renewal process , 1981 .

[106]  K. Meyer.  The Output of a Queueing System , 1981 .

[107]  Guy Pujolle,et al.  Stationary Distributions of Flows in Jackson Networks , 1981, Math. Oper. Res..

[108]  Austin J. Lemoine,et al.  A note on networks of infinite-server queues , 1981, Journal of Applied Probability.

[109]  Donald Gross,et al.  The Machine Repair Problem with Heterogeneous Populations , 1981, Oper. Res..

[110]  J. B. Seery,et al.  Overflow models for dimension® PBX feature packages , 1981, The Bell System Technical Journal.

[111]  Ralph L. Disney,et al.  Applied Probability— Computer Science: The Interface , 1982, Progress in Computer Science.

[112]  S. Albin.  On Poisson Approximations for Superposition Arrival Processes in Queues , 1982 .

[113]  M. Miyazawa.  Simple derivations of the invariance relations and their applications , 1982, Journal of Applied Probability.

[114]  Peter C. Kiessler,et al.  The Sojourn Time in a Three Node, Acyclic, Jackson Queueing Network. , 1982 .

[115]  Paul J. Schweitzer.  Bottleneck Determination in Networks of Queues , 1982 .

[116]  M. Reiman.  The Heavy Traffic Diffusion Approximation for Sojourn Times in Jackson Networks , 1982 .

[117]  Rolf Schassberger,et al.  Insensitive Generalized Semi-Markov Schemes with Point Process Input , 1982, Math. Oper. Res..

[118]  Tayfur M. Altiok,et al.  Approximate analysis of exponential tandem queues with blocking , 1982 .

[119]  J. McKenna,et al.  Integral representations and asymptotic expansions for closed Markovian queueing networks: Normal usage , 1982, The Bell System Technical Journal.

[120]  Benjamin Melamed,et al.  On Markov jump processes imbedded at jump epochs and their queueing-theoretic applications , 1980, Advances in Applied Probability.

[121]  Ronald W. Wolff,et al.  Poisson Arrivals See Time Averages , 1982, Oper. Res..

[122]  H. Daduna.  PASSAGE TIMES FOR OVERTAKE-FREE PATHS IN GORDON-NEWELL NETWORKS , 1982 .

[123]  A. Barbour.  Generalized semi-Markov schemes and open queueing networks , 1982 .

[124]  Marcel F. Neuts,et al.  Algorithmic Solution of Some Queues with Overflows , 1982 .

[125]  F. Kelly.  The throughput of a series of buffers , 1982, Advances in Applied Probability.

[126]  Arie Hordijk,et al.  Stationary Probabilities for Networks of Queues , 1982 .

[127]  Ernest Koenigsberg,et al.  Twenty Five Years of Cyclic Queues and Closed Queue Networks: A Review , 1982 .

[128]  P. K. Pollett,et al.  Some distributional approximations in Markovian queueing networks , 1982, Advances in Applied Probability.

[129]  K. G. Ramakrishnan,et al.  An overview of PANACEA, a software package for analyzing Markovian queueing networks , 1982, The Bell System Technical Journal.

[130]  Frank Kelly,et al.  Networks of Quasi-Reversible Nodes , 1982 .

[131]  W. P. Cherry,et al.  The superposition of two independent Markov renewal processes. , 1983 .

[132]  M. Miyazawa.  The derivation of invariance relations in complex queueing systems with stationary inputs , 1983 .

[133]  W. Whitt,et al.  The Queueing Network Analyzer , 1983, The Bell System Technical Journal.

[134]  Ralph L. Disney,et al.  Queues with delayed feedback , 1983, Advances in Applied Probability.

[135]  Fred Böker,et al.  Ordered thinnings of point processes and random measures , 1983 .

[136]  M. Berman,et al.  On queueing systems with renewal departure processes , 1983, Advances in Applied Probability.

[137]  Masakiyo Miyazawa,et al.  On the identification of Poisson arrivals in queues with coinciding time-stationary and customer-stationary state distributions , 1983 .

[138]  P. Brémaud.  Point processes and queues, martingale dynamics , 1983 .

[139]  F. Kelly,et al.  Sojourn times in closed queueing networks , 1983, Advances in Applied Probability.

[140]  Frank P. Kelly,et al.  The Dependence of Sojourn Times in Closed Queueing Networks , 1983, Computer Performance and Reliability.

[141]  W. Whitt,et al.  Performance of the Queueing Network Analyzer , 1983, The Bell System Technical Journal.

[142]  Christos Langaris,et al.  On the waiting time of a two-stage queueing system with blocking , 1984, Journal of Applied Probability.

[143]  Frank P. Kelly,et al.  The Product Form for Sojourn Time Distributions in Cyclic Exponential Queues , 1984, JACM.

[144]  Jonathan R Goodman,et al.  The non-ergodic Jackson network , 1984 .

[145]  P. G. Harrison.  A note on cycle times in tree-like queueing networks , 1984, Advances in Applied Probability.

[146]  William A. Massey,et al.  An operator-analytic approach to the Jackson network , 1984, Journal of Applied Probability.

[147]  Micha Yadin,et al.  Numerical Computation of Sojourn-Time Distributions in Queuing Networks , 1984, JACM.

[148]  U. Jansen.  Conditional expected sojourn times in insensitive queueing systems and networks , 1984, Advances in Applied Probability.

[149]  V. Schmidt,et al.  RELATIONSHIPS BETWEEN TIME/CUSTOMER STATIONARY CHARACTERISTICS OF TANDEM QUEUES ATTENDED BY A SINGLE SERVER , 1984 .

[150]  Klaus-Dieter Wirth.  Some Remarks on Feedback Queues , 1984, J. Inf. Process. Cybern..

[151]  William A. Massey.  Open networks of queues: their algebraic structure and estimating their transient behavior , 1984, Advances in Applied Probability.

[152]  W. Whitt.  Approximations for departure processes and queues in series , 1984 .

[153]  M. Miyazawa.  The intensity conservation law for queues with randomly changed service rate , 1985, Journal of Applied Probability.

[154]  V. Schmidt,et al.  On a single-server queue with multiple transaction , 1985 .

[155]  Thinning of point processes—covariance analyses , 1985, Advances in Applied Probability.

[156]  Matthew Rosenshine,et al.  THE DEPARTURE PROCESS FOR THE M/M/1 QUEUE , 1986 .