Analysis of an M or M or 1 Queue with Single Exponential Working Vacation
In this paper, the time-dependent probabilities of the number in the system during the busy and vacation period of the server are obtained explicitly. The variations of the transient probabilities against time are depicted numerically. Certain measures of effectiveness like the time dependent mean and variance are also obtained analytically and illustrated numerically.
Disclaimer/Regarding indexing issue:
We have provided the online access of all issues and papers to the indexing agencies (as given on journal web site). It’s depend on indexing agencies when, how and what manner they can index or not. Hence, we like to inform that on the basis of earlier indexing, we can’t predict the today or future indexing policy of third party (i.e. indexing agencies) as they have right to discontinue any journal at any time without prior information to the journal. So, please neither sends any question nor expects any answer from us on the behalf of third party i.e. indexing agencies.Hence, we will not issue any certificate or letter for indexing issue. Our role is just to provide the online access to them. So we do properly this and one can visit indexing agencies website to get the authentic information.