On the ASTA Property in a Feedback Processor-Sharing Queue
Abstract
A stationary M/M/1 Processor-Sharing queue with Bernoulli feedbacks is considered in this paper. Jobs arrive externally with rate $\lambda$ and require services whose average is $1/\mu$; after completing a service, a job leaves the system with probability $\alpha$ and rejoins the queue with probability $1-\alpha$. The queue is stable when the offered load, $\rho= \lambda/(\alpha\mu)$, satisfies $\rho<1$. The distribution of the queue seen by a tagged job which has joined the queue $n$ times already is investigated.