Closed-form formulae for moment, tail probability, and blocking probability of waiting time in a buffer-sharing deterministic system

Abstract Obtaining analytic expressions for characteristics in probabilistic systems with finite buffer capacities such as (higher) moments and tail probabilities of stationary waiting times, and blocking probabilities is by no means trivial. This is also true even for a system with deterministic processing times. By using the max–plus algebraic approach in this study, we introduce closed-form formulae for characteristics of stationary waiting time in a complete buffer-sharing m-node tandem system with constant processing times. Numerical examples are also provided.

[1]  C. Leake.  Synchronization and Linearity: An Algebra for Discrete Event Systems , 1994 .

[2]  François Baccelli,et al.  Expansions for steady-state characteristics of (max, +)-linear systems , 1998 .

[3]  Harry G. Perros,et al.  An approximate analysis of open tandem queueing networks with blocking and general service times , 1990 .

[4]  Hayriye Ayhan,et al.  Laplace Transform and Moments of Waiting Times in Poisson Driven (max,+) Linear Systems , 2001, Queueing Syst. Theory Appl..

[5]  Dong-Won Seo,et al.  Performance evaluation of WIP-controlled line production systems with constant processing times , 2016, Comput. Ind. Eng..

[6]  Hayriye Ayhan,et al.  Tail probability of transient and stationary waiting times in (max, +)-linear systems , 2002, IEEE Trans. Autom. Control..

[7]  Henk Tijms,et al.  Stochastic modelling and analysis: a computational approach , 1986 .

[8]  Dong-Won Seo,et al.  Explicit expressions for moments of waiting times in Poisson driven deterministic two-node tandem queues with blocking , 2015, Oper. Res. Lett..

[9]  O. Brun,et al.  Analytical solution of finite capacity M/D/1 queues , 2000, Journal of Applied Probability.

[10]  Leyuan Shi,et al.  Approximate analysis for queueing networks with finite capacity and customer loss , 1995 .

[11]  Dong-Won Seo,et al.  Comparison of DBR with CONWIP in a Production Line with Constant Processing Times , 2012 .

[12]  F. Baccelli,et al.  Taylor series expansions for Poisson-driven $(\max,+$)-linear systems , 1996 .

[13]  Jinpyo Lee,et al.  An Approximation Method for Blocking Probabilities in M/D/1/K1 → ⋅/D/1/K2 Queues , 2015, Asia Pac. J. Oper. Res..