Abstract
In this paper, we study ak-out-of-n system with single server who provides service to external customers also. The system consists of two parts: (i) a main queue consisting of customers (failed components of thek-out-of-n system) and (ii) a pool (of finite capacityM) of external customers together with an orbit for external customers who find the pool full. An external customer who finds the pool full on arrival, joins the orbit with probability γ and with probability 1- γ leaves the system forever. An orbital customer, who finds the pool full, at an epoch of repeated attempt, returns to orbit with probability δ (< 1) and with probability 1- δ leaves the system forever. We compute the steady state system size probability. Several performance measures are computed, numerical illustrations are provided.
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.
