Abstract
A GI/M/1/N-type queueing system with independent and generally distributed interarrival times and exponential service times is investigated. A system of equations for conditional distributions of the time to the first buffer saturation is built. The solution is written using a special-type sequence defined by ``input'' distributions of the system. The formula of total probability is used to derive a representation for the distribution of the time to the $k$th buffer saturation for k>=2. Moreover, special cases of the Poisson arrival process and the system with one-place buffer are discussed. Sample numerical results for the 3-Erlang and deterministic distributions of interarrival times are attached as well.
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 callMore From: International Journal of Advances in Telecommunications, Electrotechnics, Signals and Systems
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.
