Maximum entropy approach for discrete-time unreliable server Geo^X/Geo/1 queue with working vacation

DOI10.1504/IJMOR.2012.044473MaRDI QIDQ1753740zbMATH OpenOpenAlexFDO

Authors Madhu Jain, G. C. Sharma, Richa Sharma

Publication date 29 May 2018

Published in International Journal of Mathematics in Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1504/ijmor.2012.044473

zbMATH Keywords

discrete-time queuesgenerating functionsgeometric batch arrivalsmaximum entropyqueue sizeunreliable serverswaiting timeworking vacations

Mathematics Subject Classification ID

Probability distributions: general theory (60E05) Queues and service in operations research (90B22) Sensitivity, stability, parametric optimization (90C31)

Review text

Summary: This paper analyses a discrete-time Geo\(^{\mathrm{X}}\)/Geo/1 queue with unreliable server and working vacation. During the vacation period, the server renders service to the primary job at lower rate rather than completely stopping service; this type of vacation is considered as working vacation. For modelling the queueing problem, the inter-arrival time, service time and repair time are treated as discrete random variables. The customers are assumed to arrive at the system in batches according to a geometric process during the consecutive slots. Using the probability generating function method, we obtain the steady-state distribution of the number of the customers in the system. Furthermore, Maximum Entropy Approach (MEA) is employed to obtain the approximate formulae for the probability distributions of the number of customers and the expected waiting time in the system in terms of several well-known results. Finally, the sensitivity analysis is also carried out to illustrate the effect of different parameters on several performance characteristics.

Recommendations

• Discrete-time \(\mathrm{Geo}^X/G/1\) queue with unreliable server and multiple adaptive delayed vacations
• The discrete-time bulk-service \(Geo/Geo/1\) queue with multiple working vacations
• Maximum entropy solutions for batch arrival queue with an un-reliable server and delaying vacations
• Maximum entropy approach for batch-arrival queue under \(N\) policy with an un-reliable server and single vacation
• scientific article; zbMATH DE number 5630821

Cited in

(4)

• Working vacation policy for a discrete-time Geo\(^X\)/Geo/1 retrial queue
• Analysis of \(GI/M/1/N\) and \(GI/Geo/1/N\) queues with balking and vacation interruptions
• Stochastic modeling and optimization of discrete-time cold standby repairable systems with unreliable repair facility and retrial mechanism
• Maximum entropy solutions for batch arrival queue with an un-reliable server and delaying vacations

This page was built for publication: Maximum entropy approach for discrete-time unreliable server Geo\(^{\mathrm{X}}\)/Geo/1 queue with working vacation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1753740)