Abstract
A single server queueing system with working vacation operating in a multi-level environment controlled by a random switch is considered. The environment has [Formula: see text] levels and the random switch puts the server in one of the [Formula: see text] levels to perform a service. The server resides in a level and reports to the random switch immediately after completing the service of the last customer in the queue. The random switch initiates an assignment process immediately at the arrival of a customer. The assignment process takes a random time and immediately at the end of the assignment interval, the server is put to operate in any one of the [Formula: see text] levels with a positive probability. In each level [Formula: see text] of the environment, the queueing system behaves like an [Formula: see text] queue and switches to a working vacation at a random time and serves with a lesser rate [Formula: see text] During the working vacation, all newly arriving customers are lost. When the server is with the control switch, customers are permitted to join in the queue. For this model, time-dependent state probabilities are explicitly found and the corresponding steady-state probabilities are deduced. Some key performance measures are also obtained. A numerical study is also made.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.