scholarly journals Stationary distribution in the system |M|M|1|∞ with the staying intensity of the input flow

Author(s):  
Gurami Sh. Tsitsiashvili ◽  
Author(s):  
I. Ya. Usar ◽  
I. A. Makushenko

The paper is focused on in-depth study of the promising area of the stochastic systems theory related with scrutiny of queuing systems with repeated calls. We research Markov`s models of retrial systems with queue and variable rate of input flow controlled by threshold strategy with no restriction on the capacity of the orbit. We defined stationary regime existence conditions and investigated probability characteristics of process for two-dimension Markov process with continuous time which we took as a main model of the specified system. In stationary regime for probability characteristics of the service process were found explicit formulas. Research methods which we used are based on the initial process approximation by the process with bounded state space. Results of the research allow us to evaluate convergence rates of stationary distribution of finite systems with repeated calls to stationary distribution of infinite systems. Method of probability flow equating is used for obtain explicit expressions for stationary system probabilities through the closed path which are defined in a special way. For threshold control strategies the optimization problem of the total income of the system was stated and solved.


1986 ◽  
Vol 23 (04) ◽  
pp. 1013-1018
Author(s):  
B. G. Quinn ◽  
H. L. MacGillivray

Sufficient conditions are presented for the limiting normality of sequences of discrete random variables possessing unimodal distributions. The conditions are applied to obtain normal approximations directly for the hypergeometric distribution and the stationary distribution of a special birth-death process.


TAPPI Journal ◽  
2019 ◽  
Vol 18 (10) ◽  
pp. 607-618
Author(s):  
JÉSSICA MOREIRA ◽  
BRUNO LACERDA DE OLIVEIRA CAMPOS ◽  
ESLY FERREIRA DA COSTA JUNIOR ◽  
ANDRÉA OLIVEIRA SOUZA DA COSTA

The multiple effect evaporator (MEE) is an energy intensive step in the kraft pulping process. The exergetic analysis can be useful for locating irreversibilities in the process and pointing out which equipment is less efficient, and it could also be the object of optimization studies. In the present work, each evaporator of a real kraft system has been individually described using mass balance and thermodynamics principles (the first and the second laws). Real data from a kraft MEE were collected from a Brazilian plant and were used for the estimation of heat transfer coefficients in a nonlinear optimization problem, as well as for the validation of the model. An exergetic analysis was made for each effect individually, which resulted in effects 1A and 1B being the least efficient, and therefore having the greatest potential for improvement. A sensibility analysis was also performed, showing that steam temperature and liquor input flow rate are sensible parameters.


Author(s):  
Viktor Afonin ◽  
Vladimir Valer'evich Nikulin

The article focuses on attempt to optimize two well-known Markov systems of queueing: a multichannel queueing system with finite storage, and a multichannel queueing system with limited queue time. In the Markov queuing systems, the intensity of the input stream of requests (requirements, calls, customers, demands) is subject to the Poisson law of the probability distribution of the number of applications in the stream; the intensity of service, as well as the intensity of leaving the application queue is subject to exponential distribution. In a Poisson flow, the time intervals between requirements are subject to the exponential law of a continuous random variable. In the context of Markov queueing systems, there have been obtained significant results, which are expressed in the form of analytical dependencies. These dependencies are used for setting up and numerical solution of the problem stated. The probability of failure in service is taken as a task function; it should be minimized and depends on the intensity of input flow of requests, on the intensity of service, and on the intensity of requests leaving the queue. This, in turn, allows to calculate the maximum relative throughput of a given queuing system. The mentioned algorithm was realized in MATLAB system. The results obtained in the form of descriptive algorithms can be used for testing queueing model systems during peak (unchanged) loads.


2020 ◽  
Vol 52 (4) ◽  
pp. 1249-1283
Author(s):  
Masatoshi Kimura ◽  
Tetsuya Takine

AbstractThis paper considers ergodic, continuous-time Markov chains $\{X(t)\}_{t \in (\!-\infty,\infty)}$ on $\mathbb{Z}^+=\{0,1,\ldots\}$ . For an arbitrarily fixed $N \in \mathbb{Z}^+$ , we study the conditional stationary distribution $\boldsymbol{\pi}(N)$ given the Markov chain being in $\{0,1,\ldots,N\}$ . We first characterize $\boldsymbol{\pi}(N)$ via systems of linear inequalities and identify simplices that contain $\boldsymbol{\pi}(N)$ , by examining the $(N+1) \times (N+1)$ northwest corner block of the infinitesimal generator $\textbf{\textit{Q}}$ and the subset of the first $N+1$ states whose members are directly reachable from at least one state in $\{N+1,N+2,\ldots\}$ . These results are closely related to the augmented truncation approximation (ATA), and we provide some practical implications for the ATA. Next we consider an extension of the above results, using the $(K+1) \times (K+1)$ ( $K > N$ ) northwest corner block of $\textbf{\textit{Q}}$ and the subset of the first $K+1$ states whose members are directly reachable from at least one state in $\{K+1,K+2,\ldots\}$ . Furthermore, we introduce new state transition structures called (K, N)-skip-free sets, using which we obtain the minimum convex polytope that contains $\boldsymbol{\pi}(N)$ .


Sign in / Sign up

Export Citation Format

Share Document