Abstract
We consider a discrete-time Geo/G/1 retrial queue in which all the arriving customers demand a first essential service whereas only some of them ask for a second optional service. We study the Markov chain underlying the considered queueing system and derive a stochastic decomposition law. We also develop a recursive procedure for computing the distributions of the orbit and system size as well as the marginal distributions of the orbit size when the server is idle and busy with an essential or optional service. Finally, we prove the convergence to the continuous-time counterpart and show some numerical results.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
