Some reliability indexes and sojourn time distributions for a repairable degradation model

2016 ◽  
Vol 230 (3) ◽  
pp. 334-349 ◽  
Author(s):  
Shijia Du ◽  
Lirong Cui ◽  
Cong Lin
Keyword(s):  
Sojourn Time ◽  
Degradation Model ◽  
Sojourn Time Distributions

Interpolation Approximations of Sojourn Time Distributions

1991 ◽  
Vol 39 (2) ◽  
pp. 251-260 ◽  
Author(s):  
Philip J. Fleming ◽  
Burton Simon
Keyword(s):  
Sojourn Time ◽  
Sojourn Time Distributions

scholarly journals Sojourn time distributions in a Markovian G-queue with batch arrival and batch removal

1999 ◽  
Vol 12 (4) ◽  
pp. 339-356 ◽  
Author(s):  
Yang Woo Shin
Keyword(s):  
Markov Chains ◽  
Sojourn Time ◽  
First Passage Time ◽  
Passage Time ◽  
Batch Arrival ◽  
Single Server ◽  
Negative Customers ◽  
First Passage ◽  
Markovian Queue ◽  
Sojourn Time Distributions

We consider a single server Markovian queue with two types of customers; positive and negative, where positive customers arrive in batches and arrivals of negative customers remove positive customers in batches. Only positive customers form a queue and negative customers just reduce the system congestion by removing positive ones upon their arrivals. We derive the LSTs of sojourn time distributions for a single server Markovian queue with positive customers and negative customers by using the first passage time arguments for Markov chains.

Sojourn times in queuing networks with multiserver modes

1987 ◽  
Vol 24 (02) ◽  
pp. 511-521 ◽  
Author(s):  
R. Schassberger ◽  
H. Daduna
Keyword(s):  
Sojourn Time ◽  
Product Form ◽  
Queuing Networks ◽  
Sojourn Times ◽  
Networks Of Queues ◽  
Sojourn Time Distributions

This paper generalizes previous results for sojourn-time distributions along so-called overtake-free routes in product-form networks of queues.

scholarly journals A Technique for Computing Sojourn Times in Large Networks of Interacting Queues

1993 ◽  
Vol 7 (4) ◽  
pp. 441-464 ◽  
Author(s):  
V. Anantharam ◽  
M. Benchekroun
Keyword(s):  
Fixed Point ◽  
Markov Process ◽  
Sojourn Time ◽  
Asymptotic Limit ◽  
Large Networks ◽  
Sojourn Times ◽  
Sojourn Time Distributions

Consider a large number of interacting queues with symmetric interactions. In the asymptotic limit, the interactions between any fixed finite subcollection become negligible, and the overall effect of interactions can be replaced by an empirical rate. The evolution of each queue is given by a time inhomogeneous Markov process. This may be considered a technique for writing dynamic Erlang fixed-point equations. We explore this as a tool to approximate sojourn time distributions.

Sign in / Sign up

Export Citation Format

Share Document