Limitations of Theoretical Solutions for Closed BCMP Queueing Networks
Author Information
Author(s): Shinya Mizuno, Haruka Ohba
Primary Institution: Juntendo University, Chiba, Japan
Hypothesis
This study investigates the computational limits of solving large-scale closed BCMP queueing networks using exact methods and proposes an alternative approach using parallel simulations.
Conclusion
The proposed parallel simulation approach can accurately and efficiently replace theoretical solutions for large-scale closed BCMP queueing networks.
Supporting Evidence
- The study demonstrated that computational time increased exponentially with the number of customers in the system.
- Parallel simulations provided performance metrics that converged to theoretical values within an acceptable error range.
- The proposed method allows for the analysis of larger closed BCMP networks than previously possible.
Takeaway
This study shows that using simulations can help solve complex queueing problems faster than traditional methods, especially when there are many customer classes.
Methodology
The study applied mean value analysis (MVA) and parallel simulations to evaluate performance metrics for closed BCMP queueing networks.
Limitations
The study is limited to closed BCMP networks with up to three customer classes using MVA, while simulations were required for four or more classes.
Digital Object Identifier (DOI)
Want to read the original?
Access the complete publication on the publisher's website