5 research outputs found
Large Scale and Heavy Traffic Asymptotics for Systems with Unreliable Servers
The asymptotic behaviour of the M/M/n queue, with servers subject to independe- nt breakdowns and repairs, is examined in the limit where the number of servers tends to infinity and the repair rate tends to 0, such that their product remains finite. It is shown that the limiting two-dimensional Markov process corresponds to a queue where the number of servers has the same stationary distribution as the number of jobs in an queue. Hence, the limiting model is referred to as the M/M/[M/M/\infty ]M/M/[M/M/\infty ]$ queue is analysed in heavy traffic. When the traffic intensity approaches 1, the distribution of the (suitably normalized) number of jobs in the system is approximately exponential. This result relies on two limiting processes---a diffusion and a normalized heavy traffic limit---being essentially the same
Large scale and heavy traffic asymptotics for systems with unreliable servers
Theme 2 - Genie logiciel et calcul symbolique. Projet AlgoSIGLEAvailable from INIST (FR), Document Supply Service, under shelf-number : 14802 E, issue : a.1999 n.3807 / INIST-CNRS - Institut de l'Information Scientifique et TechniqueFRFranc