Throughput limits from the asymptotic profile of cyclic networks with state-dependent service rates

We consider networks where at each node there is a single exponential server with a service rate which is a non-decreasing function of the queue length. The asymptotic profile of a sequence of networks consists of the set of persistent service rates, the limiting customer-to-node ratio, and the limiting service-rate measure. For a sequence of cyclic networks whose asymptotic profile exists, we compute upper and lower bounds for the limit points of the sequence of throughputs as functions of the limiting customer-to-node ratio. We then find conditions under which the limiting throughput exists and is expressible in terms of the asymptotic profile. Under these conditions, we determine the limiting queue-length distributions for persistent service rates. In the absence of these conditions, the limiting throughput need not exist, even for increasing sequences of cyclic networks.

[1]  Subramanian Ramakrishnan,et al.  Queue length and occupancy in discrete-time cyclic networks with several types of nodes , 1999, Queueing Syst. Theory Appl..

[2]  David D. Yao,et al.  Fundamentals of Queueing Networks , 2001 .

[3]  Vadim Malyshev,et al.  Condensation in large closed Jackson networks , 1996 .

[4]  Yaakov Kogan,et al.  Bottleneck analysis in multiclass closed queueing networks and its application , 1999, Queueing Syst. Theory Appl..

[5]  A. Müller,et al.  Comparison Methods for Stochastic Models and Risks , 2002 .

[6]  P BuzenJeffrey Computational algorithms for closed queueing networks with exponential servers , 1973 .

[7]  C. Landim,et al.  Scaling Limits of Interacting Particle Systems , 1998 .

[8]  J. van der Wal Monotonicity of the throughput of a closed exponential queueing network in the number of jobs , 1989 .

[9]  K. Banasiewicz Economic and organizational effects of different legal and organizational forms of enterprises , 2006 .

[10]  Victor Pestien,et al.  Asymptotic Behavior of Large Discrete-Time Cyclic Queueing Networks , 1994 .

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

[12]  S. Fotopoulos Stochastic modeling and analysis of manufacturing systems , 1996 .

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

[14]  Hans Daduna,et al.  A queueing theoretical proof of increasing property of Polya frequency functions , 1996 .

[15]  H. Daduna,et al.  Asymptotic Throughput in Discrete‐Time Cyclic Networks with Queue‐Length‐Dependent Service Rates , 2003 .

[16]  Patrick Billingsley,et al.  Probability and Measure. , 1986 .

[17]  James R. Jackson,et al.  Jobshop-Like Queueing Systems , 2004, Manag. Sci..

[18]  Hans Daduna Queueing networks with discrete time scale: explicit expressions for the steady state behavior of discrete time stochastic networks , 2001 .

[19]  Hans Daduna,et al.  Queueing Networks with Discrete Time Scale , 2001, Lecture Notes in Computer Science.

[20]  J. Fritz,et al.  INTERACTING PARTICLE SYSTEMS (Grundlehren der mathematischen Wissenschaften, 276) , 1986 .