Abstract
An approximation procedure is proposed for the analysis of general queueing networks with finite capacity. A customer arriving to a node with fully occupied buffer is lost. Throughput and mean waiting time are studied by this approximation procedure. The general approach is to approximately characterize the arrival processes by two parameters, and then to analyze the individual nodes separately. The two parameters, mean and variance, will be obtained by using linear (or quadratic) approximations. This method is a QNA version for handling queueing networks with blocking. The numerical examples show that the approximations compare favorably with simulation results.
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.
