Mathematical theory of queuing networks

Some current aspects of the theory of queuing networks are considered: existence and uniqueness theorems for a probabilistic description of networks, exactly solvable models, Poisson, diffusion, and hydrodynamic approximation. Particular attention is paid to “large” (or infinite) networks.

[1]  M. Pulvirenti,et al.  Propagation of chaos for Burgers' equation , 1983 .

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

[3]  B.H. Davies,et al.  The application of packet switching techniques to combat net radio , 1987, Proceedings of the IEEE.

[4]  Ernest Koenigsberg,et al.  Invariance Properties Of Queueing Networks And Their Application To Computer/Communications Systems , 1981 .

[5]  A. Erdélyi,et al.  Higher Transcendental Functions , 1954 .

[6]  J. Lehoczky,et al.  Insensitivity of blocking probabilities in a circuit-switching network , 1984 .

[7]  S. Varadhan,et al.  Central limit theorem for additive functionals of reversible Markov processes and applications to simple exclusions , 1986 .

[8]  W. Whitt.  Queues with superposition arrival processes in heavy traffic , 1985 .

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

[10]  Frank Kelly,et al.  Stochastic Models of Computer Communication Systems , 1985 .

[11]  Tomasz Rolski,et al.  Some comparability results for waiting times in single- and many-server queues , 1984 .

[12]  F. Kelly.  One-Dimensional Circuit-Switched Networks , 1987 .

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

[14]  Wojciech Szpankowski.  Bounds for Queue Lengths in a Contention Packet Broadcast System , 1986, IEEE Trans. Commun..

[15]  Pablo A. Ferrari.  The Simple Exclusion Process as Seen from a Tagged Particle , 1986 .

[16]  Peter Whittle,et al.  Systems in stochastic equilibrium , 1986 .

[17]  Oj Onno Boxma,et al.  M/G/∞ tandem queues , 1984 .

[18]  J. Morrison,et al.  Heavy-usage asymptotic expansions for the waiting time in closed processor-sharing systems with multiple classes , 1985, Advances in Applied Probability.

[19]  Charles M. Newman,et al.  Normal fluctuations and the FKG inequalities , 1980 .

[20]  Micha Yadin,et al.  Randomization Procedures in the Computation of Cumulative-Time Distributions over Discrete State Markov Processes , 1984, Oper. Res..

[21]  GUY FAYOLLE,et al.  Analysis of a stack algorithm for random multiple-access communication , 1985, IEEE Trans. Inf. Theory.

[22]  Roberto H. Schonmann,et al.  Central Limit Theorem for the Contact Process , 1986 .

[23]  J. Morrison.  Response-Time Distribution for a Processor-Sharing System , 1985 .

[24]  Leonard Kleinrock,et al.  Optimal Transmission Ranges for Randomly Distributed Packet Radio Terminals , 1984, IEEE Trans. Commun..

[25]  G. Reuter,et al.  Spectral theory for the differential equations of simple birth and death processes , 1954, Philosophical Transactions of the Royal Society of London. Series A, Mathematical and Physical Sciences.

[26]  Nakatsuka Toshinao.  Substability and ergodicity of queue series , 1987 .

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

[28]  J. Harrison,et al.  A tandem storage system and its diffusion limit , 1984 .

[29]  Marcel F. Neuts,et al.  Matrix-geometric solutions in stochastic models - an algorithmic approach , 1982 .

[30]  Xi-Ren Cao,et al.  An operational approach to perturbation analysis of closed queuing networks , 1986 .

[31]  Arie Hordijk,et al.  Insensitivity for Stochastic Networks , 1983, Computer Performance and Reliability.

[32]  G. Fayolle,et al.  Sojourn Times in a Tandem Queue with Overtaking: Reduction to a Boundary Value Problem , 1986 .

[33]  S. F Yashkov.  Distribution of number of jobs in a feedback processor-sharing queue , 1985 .

[34]  A. Hordijk,et al.  Stochastic inequalities for an overflow model , 1987, Journal of Applied Probability.

[35]  P. Pollett.  Connecting reversible Markov processes , 1986, Advances in Applied Probability.

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

[37]  James G. C. Templeton,et al.  A survey on retrial queues , 1989 .

[38]  D. König,et al.  Queueing Networks: A Survey of Their Random Processes , 1985 .

[39]  Hans Daduna,et al.  On passage times in Jackson networks: Two-stations walk and overtake-free paths , 1983, Z. Oper. Research.

[40]  Simonetta Balsamo.  Decomposability in General Markovian Networks , 1983, Computer Performance and Reliability.

[41]  B. Melamed.  Characterizations of Poisson traffic streams in Jackson queueing networks , 1979, Advances in Applied Probability.

[42]  Benjamin Melamed,et al.  Sojourn Times in Queueing Networks , 1982, Math. Oper. Res..

[43]  G. I. Falin.  ESTIMATIONS OF AN ERROR FOR APPROXIMATION OF COUNTABLE MARKOV-CHAINS ASSOCIATED WITH REPEATED ORDERS QUENEING MODELS , 1987 .

[44]  W. Whitt,et al.  Heavy-traffic approximations for service systems with blocking , 1984, AT&T Bell Laboratories Technical Journal.

[45]  Ryszard Szekli,et al.  Networks of Work-Conserving Normal Queues , 1982 .

[46]  Austin J. Lemoine.  ON SOJOURN TIME IN JACKSON NETWORKS OF QUEUES , 1987 .

[47]  John J. O'Reilly,et al.  Problems of randomness in communication engineering , 1984 .

[48]  J. Walrand.  A NOTE ON NORTON'S THEOREM FOR QUEUING NETWORKS , 1983 .

[49]  Ian F. Akyildiz,et al.  Exact Product Form Solution for Queueing Networks with Blocking , 1987, IEEE Transactions on Computers.

[50]  Marcel F. Neuts.  Problems of Reducibility in Structured Markov Chains of M/G/1 Type and Related Queueing Models in Communication Engineering , 1983, Computer Performance and Reliability.

[51]  R. M. Loynes,et al.  The stability of a queue with non-independent inter-arrival and service times , 1962, Mathematical Proceedings of the Cambridge Philosophical Society.

[52]  Hans Daduna.  The busy period distribution in a closed tandem of queues , 1985 .

[53]  R. Arratia.  The Motion of a Tagged Particle in the Simple Symmetric Exclusion System on $Z$ , 1983 .

[54]  R. Schassberger,et al.  Sojourn times in queuing networks with multiserver modes , 1987, Journal of Applied Probability.

[55]  Debasis Mitra,et al.  Asymptotic expansions of moments of the waiting time in closed and open processor-sharing systems with multiple job classes , 1983, Advances in Applied Probability.

[56]  Ryszard Syski.  Markovian Models—An Essay , 1986 .

[57]  John A. Morrison,et al.  Asymptotic Expansions of Moments of the Waiting Time in a Shared-Processor of an Interactive System , 1983, SIAM J. Comput..

[58]  Xi-Ren Cao,et al.  The dependence of sojourn times on service times in tandem queues , 1984, Journal of Applied Probability.

[59]  H. Srivastava,et al.  Special Functions in Queuing Theory and Related Stochastic Processes , 1982 .

[60]  K. G. Ramakrishnan,et al.  A class of closed Markovian queuing networks: integral representations, asymptotic expansions, and generalizations , 1981 .

[61]  Ralph L. Disney,et al.  Stationary queue-length and waiting-time distributions in single-server feedback queues , 1984 .

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

[63]  Charles Knessl,et al.  Asymptotic Expansions for a Closed Multiple Access System , 1987, SIAM J. Comput..

[64]  O. J. Boxma,et al.  The cyclic queue with one general and one exponential server , 1983, Advances in Applied Probability.

[65]  Hans Daduna,et al.  The Time for a Round Trip in a Cycle of Exponential Queues , 1983, JACM.

[66]  Frederick J. Beutler,et al.  Mean sojourn times in Markov queueing networks: Little's formula revisited , 1983, IEEE Trans. Inf. Theory.

[67]  G. I. Falin.  Comparability of Migration Processes , 1989 .

[68]  Hans Daduna,et al.  The cycle-time distribution in a central server network with state-dependent branching , 1985 .

[69]  Bajis M. Dodin.  Approximating the distribution functions in stochastic networks , 1985, Comput. Oper. Res..

[70]  William A. Massey,et al.  New stochastic orderings for Markov processes on partially ordered spaces , 1984, The 23rd IEEE Conference on Decision and Control.

[71]  C. Kipnis.  Central Limit Theorems for Infinite Series of Queues and Applications to Simple Exclusion , 1986 .

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

[73]  Jean Walrand.  A DISCRETE-TIME QUEUEING NETWORK , 1983 .

[74]  J. Harrison.  The diffusion approximation for tandem queues in heavy traffic , 1978, Advances in Applied Probability.

[75]  Alan A. Bertossi,et al.  Time Slot Assignment in SS/TDMA Systems with Intersatellite Links , 1987, IEEE Trans. Commun..

[76]  Leonid B. Boguslavsky,et al.  Performance analysis of data link and communication device control procedures in distributed Micro/Mini computer systems , 1986 .

[77]  J. Harrison,et al.  Brownian motion and stochastic flow systems , 1986 .

[78]  F. P. Kelly,et al.  Segregating the Input to a Series of Buffers , 1985, Math. Oper. Res..

[79]  W. Szczotka,et al.  Stationary representation of queues. I , 1986, Advances in Applied Probability.

[80]  Peter Whittle.  Scheduling and Characterization Problems for Stochastic Networks , 1985 .

[81]  Linn I. Sennott,et al.  Conditions for the non-ergodicity of Markov chains with application to a communication system , 1987, Journal of Applied Probability.

[83]  J. Shanthikumar.  Stochastic majorization of random variables by proportional equilibrium rates , 1987 .

[84]  J. Harrison,et al.  On the distribution of m ultidimen-sional reflected Brownian motion , 1981 .

[85]  W. J. Gordon,et al.  Closed Queuing Systems with Exponential Servers , 1967, Oper. Res..

[86]  C. Newman.  Asymptotic independence and limit theorems for positively and negatively dependent random variables , 1984 .

[87]  Benjamin Melamed,et al.  On the reversibility of queueing networks , 1982 .

[88]  T. Liggett.  Interacting Particle Systems , 1985 .

[89]  Zvi Rosberg.  Bounds for the Optimal Decentralized Access Protocol in a Local Area Network , 1986, Perform. Evaluation.

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

[91]  F.A. Tobagi,et al.  Issues in packet radio network design , 1987, Proceedings of the IEEE.

[92]  F.A. Tobagi,et al.  Modeling and performance analysis of multihop packet radio networks , 1987, Proceedings of the IEEE.

[93]  Arie Hordijk,et al.  Networks of queues , 1984 .

[95]  Leonard Kleinrock,et al.  On a Self-Adjusting Capability of Random Access Networks , 1984, IEEE Trans. Commun..

[96]  A. Lemoine.  State of the Art---Networks of Queues: A Survey of Weak Convergence Results , 1978 .

[97]  G. Falin.  Monotonicity of random walks in partially ordered sets , 1988 .

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

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

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

[101]  Bruce E. Hajek,et al.  The Proof of a Folk Theorem on Queuing Delay with Applications to Routing in Networks , 1983, JACM.

[102]  William A. Massey.  A FAMILY OF BOUNDS FOR THE TRANSIENT BEHAVIOR OF A JACKSON NETWORK , 1986 .

[103]  Micha Hofri,et al.  On a functional equation arising in the analysis of a protocol for a multi-access broadcast channel , 1986 .

[104]  J. Harrison,et al.  Reflected Brownian Motion on an Orthant , 1981 .

[105]  P. Whittle.  Partial balance and insensitivity , 1985, Journal of Applied Probability.

[106]  Frank Kelly,et al.  Instability in a Communication Network , 1987 .

[107]  C. Kipnis,et al.  DERIVATION OF THE HYDRODYNAMICAL EQUATION FOR THE ZERO-RANGE INTERACTION PROCESS , 1984 .

[108]  Debasis Mitra,et al.  Asymptotic Expansions and Integral Representations of Moments of Queue Lengths in Closed Markovian Networks , 1984, JACM.

[109]  Ralph L. Disney,et al.  Traffic processes in queueing networks: a Markov renewal approach , 1987 .

[110]  Jean Walrand,et al.  A note on optimal control of a queuing system with two heterogeneous servers , 1984 .

[111]  S. Hurtubise,et al.  Dynamic Routing and Call Repacking in Circuit-Switched Networks , 1983, IEEE Trans. Commun..

[112]  Errico Presutti,et al.  The weakly asymmetric simple exclusion process , 1989 .

[113]  David Strauss.  On a general class of models for interaction , 1986 .

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

[115]  René Boel,et al.  Stochastic Models of Computer Networks , 1981 .

[116]  Isi Mitrani,et al.  Note—A Critical Note on a Result by Lemoine , 1979 .

[117]  P. Whittle,et al.  PARTIAL BALANCE, INSENSITIVITY AND WEAK COUPLING , 1986 .

[118]  S. F. Yashkov.  A note on asymptotic estimates of the sojourn time variance in the M/G/1 queue with processor-sharing , 1986 .

[119]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

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

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

[122]  E. Andjel.  Invariant Measures for the Zero Range Process , 1982 .

[123]  F. Kelly.  Blocking probabilities in large circuit-switched networks , 1986, Advances in Applied Probability.

[124]  Aleksandr Alekseevich Borovkov,et al.  Asymptotic methods in queuing theory , 1984 .

[125]  Jean C. Walrand,et al.  A probabilistic look at networks of quasireversible queues , 1981, 1981 20th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes.

[126]  Kathryn E. Stecke,et al.  On the Nonconcavity of Throughput in Certain Closed Queueing Networks , 1986, Perform. Evaluation.

[128]  Austin J. Lemoine.  A stochastic network formulation for complex sequential processes , 1986 .

[129]  Lower bounds for the probability of overload in certain queueing networks , 1985 .

[130]  R. Schassberger,et al.  Decomposable stochastic networks: Some observations , 1984 .

[131]  P. Brémaud.  Point Processes and Queues , 1981 .

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

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

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

[135]  C. Newman,et al.  An Invariance Principle for Certain Dependent Sequences , 1981 .

[136]  Yechiam Yemini.  Astatistical Mechanics of Distributed Resource Sharing Mechanisms , 1983, INFOCOM.

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

[138]  Frank Kelly,et al.  Blocking, reordering, and the throughput of a series of servers , 1984 .

[139]  Costas Courcoubetis,et al.  Stability of a Queueing System with Concurrent Service and Locking , 1987, SIAM J. Comput..

[140]  BORIS S. TSYBAKOV.  Survey of USSR contributions to random multiple-access communications , 1985, IEEE Trans. Inf. Theory.

[141]  R. Binder,et al.  Crosslink architectures for a multiple satellite system , 1987, Proceedings of the IEEE.

[142]  L. Kleinrock,et al.  Spatial reuse in multihop packet radio networks , 1987, Proceedings of the IEEE.

[143]  Ward Whitt,et al.  Comparison methods for queues and other stochastic models , 1986 .

[144]  Jean-Pierre Fouque,et al.  Hydrodynamical Limit for the Asymmetric Simple Exclusion Process , 1987 .

[145]  S. Lam,et al.  Queueing network models of packet switching networks part 2: Networks with population size constraints , 1982, Perform. Evaluation.

[146]  Onno Boxma,et al.  Pseudo-conservation laws in cyclic-service systems , 1986 .

[147]  Rolf Schassberger.  An Aggregation Principle for Computing Invariant Probability Vectors for Semi-Markovian Models , 1983, Computer Performance and Reliability.

[148]  S. T. Rachev,et al.  Characterization problems in queueing and their stability , 1985, Advances in Applied Probability.

[149]  F. Baccelli,et al.  Construction of the stationary regime of queues with locking , 1987 .

[150]  P. Franken,et al.  Ergodicity and steady state existence. Continuity of stationary distributions of queueing characteristics , 1984 .

[151]  Martin I. Reiman,et al.  Open Queueing Networks in Heavy Traffic , 1984, Math. Oper. Res..

[152]  Isi Mitrani,et al.  The Distribution of Sojourn Times in a Queueing Network with Overtaking: Reduction to a Boundary Problem , 1983, International Symposium on Computer Modeling, Measurement and Evaluation.

[153]  Phuoc Tran-Gia,et al.  A Renewal Approximation for the Generalized Switched Poisson Process , 1983, Computer Performance and Reliability.

[154]  Simon S. Lam,et al.  Dynamic Scaling and Growth Behavior of Queuing Network Normalization Constants , 1982, JACM.

[155]  D. Mitra.  Asymptotic analysis and computational methods for a class of simple, circuit-switched networks with blocking , 1987, Advances in Applied Probability.

[156]  S. A.,et al.  A Propagation of Chaos Result for Burgers ' Equation , 2022 .

[157]  A. E. Conway,et al.  A New Method For Computing The Normalization Constant Of Multiple-Chain Queueing Networks , 1986 .

[158]  J. G. Shanthikumar.  On Stochastic Comparison of Random Vectors. , 1987 .

[159]  Hans Daduna,et al.  Networks of queues in discrete time , 1983, Z. Oper. Research.

[160]  Enrique D. Andjel.  The asymmetric simple exclusion process on Zd , 1981 .

[161]  Zvi Rosberg,et al.  Optimal hop-by-hop flow control in computer networks , 1986 .

[162]  B. Lindqvist.  Monotone and associated Markov chains, with applications to reliability theory , 1987, Journal of Applied Probability.

[163]  B. Lisek,et al.  A method for solving a class of recursive stochastic equations , 1982 .

[164]  R. J. T. Morris,et al.  Priority queuing networks , 1981, The Bell System Technical Journal.

[165]  Shaler Stidham,et al.  Control of arrivals to two queues in series , 1985 .

[166]  S. F. Yashkov,et al.  Processor-sharing queues: Some progress in analysis , 1987, Queueing Syst. Theory Appl..

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

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

[169]  J. Walrand,et al.  Individually optimal routing in parallel systems , 1985 .

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

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

[172]  Guy Fayolle,et al.  On Functional Equations for One or Two Complex Variables Arising in the Analysis of Stochastic Models , 1983, Computer Performance and Reliability.

[173]  G. F. Newell.  APPROXIMATIONS FOR SUPERPOSITION ARRIVAL PROCESSES IN QUEUES , 1984 .

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

[175]  Erol Gelenbe,et al.  Modeling the Execution of Block Structured Processes with Hardware and Software Failures , 1983, Computer Performance and Reliability.

[176]  William A. Massey.  CALCULATING EXIT TIMES FOR SERIES JACKSON NETWORKS , 1985 .

[177]  Associated random variables and martingale inequalities , 1982 .

[178]  Peter Whittle,et al.  Weak coupling in stochastic systems , 1984, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.

[179]  Stephen S. Lavenberg,et al.  A Perspective on Iterative Methods for the Approximate Analysis of Closed Queueing Networks , 1983, Computer Performance and Reliability.

[180]  P. G. Harrison,et al.  Transient behaviour of queueing networks , 1981 .

[182]  Simonetta Balsamo,et al.  An Extension of Norton's Theorem for Queueing Networks , 1982, IEEE Transactions on Software Engineering.

[183]  I. Ziedins.  Quasi-stationary distributions and one-dimensional circuit-switched networks , 1987 .

[184]  Jean C. Walrand,et al.  Multi-Armed Bandit Problems and Resource Sharing Systems , 1983, Computer Performance and Reliability.

[185]  B. Lisek.  Construction of stationary state distributions for loss systems , 1979 .

[186]  Bryan S. Whittle.  Standards for the evolving ISDNs progress and challenges a road map , 1985, CCRV.

[187]  Simon S. Lam,et al.  Queuing network models of packet switching networks part 1: Open networks , 1982, Perform. Evaluation.

[188]  Yu. M. Sukhov,et al.  Perturbation theory approach for a class of hybrid switching networks with small transit flows , 1990 .

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

[190]  Guy Pujolle,et al.  A Solution For Multiserver And Multiclass Open Queueing Networks , 1986 .

[191]  Isi Mitrani,et al.  Response Time Problems in Communication Networks , 1985 .

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

[193]  Debasis Mitra,et al.  Probabilistic Models of Database Locking: Solutions, Computational Algorithms, and Asymptotics , 1984, JACM.

[194]  Gennadi Falin.  Single-line repeated orders queueing systems 1 , 1986 .

[195]  Martin I. Reiman,et al.  Some diffusion approximations with state space collapse , 1984 .