Stationary Distribution of Discrete-Time Finite-Capacity Queue with Re-sequencing

2020 ◽  
pp. 399-413
Author(s):  
Rostislav Razumchik ◽  
Lusine Meykhanadzhyan
Keyword(s):  
Stationary Distribution ◽  
Discrete Time ◽  
Finite Capacity ◽  
Finite Capacity Queue

Finite Capacity Queue with Postponed Customers

2018 ◽  
Vol 9 (11) ◽  
pp. 1671-1680
Author(s):  
Rinsy Thomas ◽  
Susha D.
Keyword(s):  
Finite Capacity ◽  
Finite Capacity Queue

Discrete time analysis of a repairable machine

2002 ◽  
Vol 39 (3) ◽  
pp. 503-516 ◽  
Author(s):  
Attahiru Sule Alfa ◽  
I. T. Castro
Keyword(s):  
Detailed Analysis ◽  
Stationary Distribution ◽  
Discrete Time ◽  
Single Machine ◽  
General Distribution ◽  
Optimal Time ◽  
Time Analysis ◽  
Machine System ◽  
Special Cases

We consider, in discrete time, a single machine system that operates for a period of time represented by a general distribution. This machine is subject to failures during operations and the occurrence of these failures depends on how many times the machine has previously failed. Some failures are repairable and the repair times may or may not depend on the number of times the machine was previously repaired. Repair times also have a general distribution. The operating times of the machine depend on how many times it has failed and was subjected to repairs. Secondly, when the machine experiences a nonrepairable failure, it is replaced by another machine. The replacement machine may be new or a refurbished one. After the Nth failure, the machine is automatically replaced with a new one. We present a detailed analysis of special cases of this system, and we obtain the stationary distribution of the system and the optimal time for replacing the machine with a new one.

Newton-Shamanskii Method for a Quadratic Matrix Equation Arising in Quasi-Birth-Death Problems

2014 ◽  
Vol 4 (4) ◽  
pp. 386-395
Author(s):  
Pei-Chang Guo
Keyword(s):  
Markov Chains ◽  
Stationary Distribution ◽  
Discrete Time ◽  
Matrix Equation ◽  
Nonnegative Solution ◽  
Minimal Nonnegative Solution ◽  
The Minimal Nonnegative Solution ◽  
Quadratic Matrix Equation ◽  
Quadratic Matrix ◽  
Birth Death

AbstractIn order to determine the stationary distribution for discrete time quasi-birth-death Markov chains, it is necessary to find the minimal nonnegative solution of a quadratic matrix equation. The Newton-Shamanskii method is applied to solve this equation, and the sequence of matrices produced is monotonically increasing and converges to its minimal nonnegative solution. Numerical results illustrate the effectiveness of this procedure.

scholarly journals Stationary solution to the fluid queue fed by an M/M/1 queue

2002 ◽  
Vol 39 (2) ◽  
pp. 359-369 ◽  
Author(s):  
N. Barbot ◽  
B. Sericola
Keyword(s):  
Stationary Solution ◽  
Stationary Distribution ◽  
Generating Functions ◽  
The State ◽  
Finite Capacity ◽  
Fluid Queue ◽  
Analytic Expression ◽  
Joint Stationary Distribution

We consider an infinite-capacity buffer receiving fluid at a rate depending on the state of an M/M/1 queue. We obtain a new analytic expression for the joint stationary distribution of the buffer level and the state of the M/M/1 queue. This expression is obtained by the use of generating functions which are explicitly inverted. The case of a finite capacity fluid queue is also considered.

Sign in / Sign up

Export Citation Format

Share Document