scholarly journals Transient analysis of the M/M/1 queue

1993 ◽  
Vol 25 (03) ◽  
pp. 702-713 ◽  
Author(s):  
P. Leguesdron ◽  
J. Pellaumail ◽  
G. Rubino ◽  
B. Sericola
Keyword(s):  
Markov Chain ◽  
Generating Function ◽  
Transient Analysis ◽  
Queueing System ◽  
Second Step ◽  
New Approach ◽  
Analytical Expression ◽  
Transient Probabilities

A new approach is used to obtain the transient probabilities of the M/M/1 queueing system. The first step of this approach deals with the generating function of the transient probabilities of the uniformized Markov chain associated with this queue. The second step consists of the inversion of this generating function. A new analytical expression of the transient probabilities of the M/M/1 queue is then obtained.

scholarly journals Transient analysis of the M/M/1 queue

1993 ◽  
Vol 25 (3) ◽  
pp. 702-713 ◽  
Author(s):  
P. Leguesdron ◽  
J. Pellaumail ◽  
G. Rubino ◽  
B. Sericola
Keyword(s):  
Markov Chain ◽  
Generating Function ◽  
Transient Analysis ◽  
Queueing System ◽  
Second Step ◽  
New Approach ◽  
Analytical Expression ◽  
Transient Probabilities

A new approach is used to obtain the transient probabilities of the M/M/1 queueing system. The first step of this approach deals with the generating function of the transient probabilities of the uniformized Markov chain associated with this queue. The second step consists of the inversion of this generating function. A new analytical expression of the transient probabilities of the M/M/1 queue is then obtained.

On the absorption probabilities and mean time for absorption for discrete Markov chains

2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Nikolaos Halidias
Keyword(s):  
Markov Chain ◽  
Random Walk ◽  
Markov Chains ◽  
Generating Function ◽  
Discrete Time ◽  
Probability Generating Function ◽  
The Mean ◽  
Mean Time ◽  
Absorption Probabilities

Abstract In this note we study the probability and the mean time for absorption for discrete time Markov chains. In particular, we are interested in estimating the mean time for absorption when absorption is not certain and connect it with some other known results. Computing a suitable probability generating function, we are able to estimate the mean time for absorption when absorption is not certain giving some applications concerning the random walk. Furthermore, we investigate the probability for a Markov chain to reach a set A before reach B generalizing this result for a sequence of sets A 1 , A 2 , … , A k {A_{1},A_{2},\dots,A_{k}} .

Transient Analysis and Simulation of Pitting Corrosion for the Estimation of Noise Resistance

CORROSION ◽  
2000 ◽  
Vol 56 (9) ◽  
pp. 928-934
Author(s):  
G. Miramontes de León ◽  
D. C. Farden ◽  
D. E. Tallman
Keyword(s):  
Computer Simulation ◽  
Pitting Corrosion ◽  
Transient Analysis ◽  
Electrochemical Noise ◽  
Electrochemical Impedance ◽  
Transient Behavior ◽  
Noise Resistance ◽  
New Approach ◽  
Noise Data ◽  
Current Transients

Abstract A new approach for the measurement of noise resistance based on the transient behavior of pitting corrosion is presented. Potential noise and current transients have been recognized as a characteristic behavior of pitting corrosion. This new approach uses the transient information present during corrosion as a way to estimate the noise resistance of coated metals directly. Computer simulation and analytical results are presented, indicating that the new technique can be applied to the problem of noise resistance estimation. This new approach was applied to experimental electrochemical noise data obtained with commercial electrochemical impedance spectroscopy (EIS)/electrochemcial noise measurement (ENM) equipment.

Transient analysis of M/M/1 queues in discrete time by general server vacations

1994 ◽  
Vol 31 (A) ◽  
pp. 115-129 ◽  
Author(s):  
W. Böhm ◽  
S. G. Mohanty
Keyword(s):  
Discrete Time ◽  
Continuous Time ◽  
Transient Analysis ◽  
Queueing System ◽  
Queueing Model ◽  
Discrete Parameter ◽  
Server Vacations ◽  
Special Case ◽  
Combinatorial Methods ◽  
Transient And Steady State

In this contribution we consider an M/M/1 queueing model with general server vacations. Transient and steady state analysis are carried out in discrete time by combinatorial methods. Using weak convergence of discrete-parameter Markov chains we also obtain formulas for the corresponding continuous-time queueing model. As a special case we discuss briefly a queueing system with a T-policy operating.

scholarly journals Rehydration of Dried-Out Specimens: a New Approach

2020 ◽  
Vol 34 (1) ◽  
pp. 73-86
Author(s):  
F. Neisskenwirth
Keyword(s):  
Water Vapor ◽  
Soft Tissue ◽  
Second Step ◽  
Phosphate Solution ◽  
Glycerol Solution ◽  
New Approach ◽  
The Third ◽  
Demineralized Water ◽  
Chemically Induced

Abstract Different procedures are proposed in the literature for the rehydration of dried-out specimens. These procedures vary greatly in their efficiency and application. This work describes a new procedure that is inspired by the literature but that avoids heating the specimens. This method was applied to reconditioning dried-out specimens from a historical collection (Swiss freshwater fishes, bird brains, and bird eyes), stored at the Naturhistorisches Museum Bern in Switzerland. The procedure consists of five steps. The first step is the softening of hardened soft tissue with benzaldehyde and demineralized water. The second step is an indirect rehydration with water vapor. The third step is a chemically induced direct hydration using a trisodium phosphate solution that allows the specimen to swell in size before being washed with water to remove all additives. Finally, the rehydrated specimen is transferred into new preserving fluid. Because the dehydrating properties of ethanol as a preservative are problematic, this paper presents the results of an experimental case study using a glycerol solution as a preservation fluid.

On the waiting time distribution in a generalized queueing system with uniformly bounded sojourn times

1972 ◽  
Vol 9 (3) ◽  
pp. 642-649 ◽  
Author(s):  
Jacqueline Loris-Teghem
Keyword(s):  
Generating Function ◽  
Waiting Time ◽  
Service Time ◽  
Time Distribution ◽  
Queueing System ◽  
Waiting Time Distribution ◽  
Stieltjes Transform ◽  
Sojourn Times ◽  
Stieltjes Transforms ◽  
Uniformly Bounded

A generalized queueing system with (N + 2) types of triplets (delay, service time, probability of joining the queue) and with uniformly bounded sojourn times is considered. An expression for the generating function of the Laplace-Stieltjes transforms of the waiting time distributions is derived analytically, in a case where some of the random variables defining the model have a rational Laplace-Stieltjes transform.The standard Kl/Km/1 queueing system with uniformly bounded sojourn times is considered in particular.

scholarly journals M/G/1 vacation model with limited service discipline and hybrid switching-on policy

1997 ◽  
Vol 3 (3) ◽  
pp. 243-253
Author(s):  
Alexander V. Babitsky
Keyword(s):  
Generating Function ◽  
Busy Period ◽  
Optimization Problem ◽  
Queueing System ◽  
Service Discipline ◽  
Multiple Vacations ◽  
Queueing Process ◽  
Vacation Model ◽  
Hybrid Switching ◽  
Limited Service

The author studies an M/G/1 queueing system with multiple vacations. The server is turned off in accordance with the K-limited discipline, and is turned on in accordance with the T-N-hybrid policy. This is to say that the server will begin a vacation from the system if either the queue is empty orKcustomers were served during a busy period. The server idles until it finds at leastNwaiting units upon return from a vacation.Formulas for the distribution generating function and some characteristics of the queueing process are derived. An optimization problem is discussed.

Sign in / Sign up

Export Citation Format

Share Document