A Markovian single server with upstream job and downstream demand arrival stream

In this paper we consider a Markovian single server system which processes items arriving from an upstream region (as usual in queueing systems) and is controlled by a demand arrival stream for finished items from a downstream area. A finite storage is available at the server to store finished items not immediately needed in the downstream area. The system considered corresponds to an assembly-like queue with two input streams. The system is stable in a strict sense only if all queues are finite, i.e., both random processes are synchronized via blocking. This notion leads to a complementary system with a very similar state space which is a pair of Markovian single servers with synchronous arrivals. In the mathematical analysis the main focus is on the state probabilities and expectation of minimum and maximum of the two input queues.

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

[2]  Flavio Bonomi,et al.  An approximate analysis for a class of assembly-like queues , 1987, Queueing Syst. Theory Appl..

[3]  M.R. Schroeder,et al.  Number theory , 1989, IEEE Potentials.

[4]  Mischa Schwartz,et al.  Telecommunication networks: protocols, modeling and analysis , 1986 .

[5]  G. Latouche.  QUEUES WITH PAIRED CUSTOMERS , 1981 .

[6]  S. Wittevrongel,et al.  Queueing Systems , 2019, Introduction to Stochastic Processes and Simulation.

[7]  P. Naor,et al.  Some Queuing Problems with the Service Station Subject to Breakdown , 1963 .

[8]  E. H. Lipper,et al.  Assembly-like queues with finite capacity: Bounds, asymptotics and approximations , 1986, Queueing Syst. Theory Appl..

[9]  Leonard Kleinrock,et al.  Theory, Volume 1, Queueing Systems , 1975 .

[10]  Christoph J. Scriba,et al.  B. L. van der Waerden: A History of Algebra. From al‐Khwarizmi to Emmy Noether. Berlin/Heidelberg/New York/Tokyo: Springer‐Verlag 1985. xi, 271 Seiten, 28 Figuren. Leinen, DM 98,‐. , 1987 .

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

[12]  Jacques Teghem,et al.  Control of the service process in a queueing system , 1986 .

[13]  Tadeusz Czachórski,et al.  Performance evaluation of fork and join synchronization primitives , 1987, Acta Informatica.

[14]  J. Harrison.  Assembly-like queues , 1973, Journal of Applied Probability.

[15]  M. Schroeder.  Number Theory in Science and Communication , 1984 .

[16]  Leonard Kleinrock,et al.  Queueing Systems - Vol. 1: Theory , 1975 .

[17]  L. Flatto,et al.  Two parallel queues created by arrivals with two demands. II , 1984 .