Abstract
Consider a queueing system with infinitely many servers, a general distribution of service times and an instantaneous rate $\alpha_k$ of new arrivals, where $\alpha_k$ depends only on the number of busy servers. This is called a generalized Erlang model (GEM) since if $\alpha_k = \alpha (k < N), \alpha_k = 0 (k \geqq N)$, then Erlang's model for a telephone exchange with $N$ lines is recovered. The synchronous and asynchronous stationary distributions of the GEM are determined and several interesting properties of the process are discussed. In particular the stationary GEM is shown to be reversible.
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.
