Machine Learning Tool for Analyzing Finite Buffer Queueing Systems
Queueing delays are one very important performance measure for most engineering network systems. Providing low-delay systems is a major goal of service providers, as it is a leading concern for users/customers. These network systems and their performance measures are typically analyzed using queuein...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2025-01-01
|
| Series: | Mathematics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2227-7390/13/3/346 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Queueing delays are one very important performance measure for most engineering network systems. Providing low-delay systems is a major goal of service providers, as it is a leading concern for users/customers. These network systems and their performance measures are typically analyzed using queueing-based models. Even though there are several available strong and precise mathematical models for analyzing queueing systems, their applications are limited to simple and small-scale systems due to their lack of scalability in real-life systems. Researchers have spent a good portion of their efforts toward perfecting the analysis of such systems. Precise and accurate results are available for single-node systems with standard operations. However, for analyzing multi-node systems with complex operations, one has to resort to approximations or simulations. Some of these approximations usually give an oversimplified view of such systems; these approximations remain quite limited. In this paper, we present a machine learning tool that can potentially be used to analyze most finite buffer queues to obtain reasonable approximations for the mean number of items in such systems. The machine learning tool we develop is based on supervised learning using the Michaelis–Menten non-linear model used in biochemistry and the results are simple to obtain. It is fast and very scalable; these characteristics represent the main features of this approach compared to existing systems. The coefficient of determination <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><msup><mi>R</mi><mn>2</mn></msup></semantics></math></inline-formula> for all the examples presented are all higher than <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>90</mn><mo>%</mo></mrow></semantics></math></inline-formula>, with some as high as <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>99.6</mn><mo>%</mo></mrow></semantics></math></inline-formula>. |
|---|---|
| ISSN: | 2227-7390 |