Issue |
RAIRO-Oper. Res.
Volume 50, Number 1, January-March 2016
|
|
---|---|---|
Page(s) | 67 - 81 | |
DOI | https://doi.org/10.1051/ro/2015012 | |
Published online | 07 October 2015 |
Analysis of Discrete-time queues with correlated arrivals, negative customers and server interruption
1 Department of Mathematics, Dr.NGP
Institute of Technology, 641048
Coimbatore,
India.
asenthilvadivu@gmail.com
2 Department of Mathematics, PSG
College of Technology, 641004
Coimbatore,
India.
ranpsgtech@yahoo.co.in
3 Department of Applied Mathematics
& Computational Sciences, PSG College of Technology, 641004
Coimbatore,
India.
mskumarin@yahoo.com
Received:
29
June
2013
Accepted:
17
April
2015
This paper analysis a discrete time infinite capacity queueing system with correlated arrival and negative customers served by two state Markovian server. Positive customers are generated according to the first order Markovian arrival process with geometrically distributed lengths of On periods and Off periods. Further, the geometrically distributed arrival of negative customer removes the positive customers is any, and has no effect when the system is empty. The server state is a two state Markov chain which alternate between Good and Bad states with geometrically distributed service times. Closed-form expressions for mean queue length, unfinished work and sojourn time distributions are obtained. Numerical illustrations are also presented.
Mathematics Subject Classification: 60K25 / 90B22
Key words: On-OffSource / negative customers / two state Markovian server / sojourn time distribution
© EDP Sciences, ROADEF, SMAI, 2015
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.