Cyclic networks with general blocking and starvation

We introducegeneral starvation and consider cyclic networks withgeneral blocking and starvation (GBS). The mechanism of general blocking allows the server to process a limited number of jobs when the buffer downstream is full, and that of general starvation allows the server to perform a limited number of services in anticipation of jobs that are yet to arrive. The two main goals of this paper are to investigate how the throughput of cyclic GBS networks is affected by varying (1) the total number of jobsJ, and (2) the buffer allocationk=(k1..., km) subject to a fixed total buffer capacityK=k1 +... + km. In particular, we obtain sufficient conditions for the throughput to be symmetric inJ and to be maximized whenJ=K/2. We also show that the equal buffer allocation is optimal under the two regimes of light or heavy usage. In order to establish these results, we obtain several intermediate structural properties of the throughput, using duality, reversibility, and concavity, which are of independent interest.

[1]  Genji Yamazaki,et al.  Reversibility of Tandem Blocking Queueing Systems , 1985 .

[2]  David Maier,et al.  Review of "Introduction to automata theory, languages and computation" by John E. Hopcroft and Jeffrey D. Ullman. Addison-Wesley 1979. , 1980, SIGA.

[3]  P. Glynn A GSMP formalism for discrete event systems , 1989, Proc. IEEE.

[4]  B. Melamed Note-A Note on the Reversibility and Duality of Some Tandem Blocking Queueing Systems , 1986 .

[5]  F. Baccelli,et al.  Comparison properties of stochastic decision free Petri nets , 1992 .

[6]  David D. Yao,et al.  Generalized Semi-Markov Processes: Antimatroid Structure and Second-Order Properties , 1992, Math. Oper. Res..

[7]  Mostafa H. Ammar,et al.  Equivalence Relations in Queueing Models of Fork/Join Networks with Blocking , 1989, Perform. Evaluation.

[8]  Weibo Gong,et al.  A generalized semi-Markov process model for the buffer allocation problem in a cyclic network , 1990, 29th IEEE Conference on Decision and Control.

[9]  Dinah W. Cheng,et al.  Tandem queues with general blocking: A unified model and comparison results , 1993, Discret. Event Dyn. Syst..

[10]  Gordon F. Newell,et al.  Cyclic Queuing Systems with Restricted Length Queues , 1967, Oper. Res..

[11]  D Towsley,et al.  Symmetry property of the throughput in closed tandem queueing networks with finite buffers , 1991, Oper. Res. Lett..

[12]  E. Muth The Reversibility Property of Production Lines , 1979 .

[13]  P. Ramadge,et al.  Supervisory control of a class of discrete event processes , 1987 .

[14]  守屋 悦朗,et al.  J.E.Hopcroft, J.D. Ullman 著, "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley, A5変形版, X+418, \6,670, 1979 , 1980 .

[15]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[16]  David D. Yao,et al.  A GSMP Framework for the Analysis of Production Lines , 1994 .

[17]  John A. Buzacott,et al.  Stochastic models of manufacturing systems , 1993 .

[18]  Harry G. Perros,et al.  Approximate Throughput Analysis of Cyclic Queueing Networks with Finite Buffers , 1989, IEEE Trans. Software Eng..

[19]  David D. Yao,et al.  Monotonicity in Generalized Semi-Markov Processes , 1992, Math. Oper. Res..

[20]  G. Yamazaki,et al.  Properties of duality in tandem queueing systems , 1975 .