A New Method for Markovian Adaptation of the Non-Markovian Queueing System Using the Hidden Markov Model
Clicks: 172
ID: 267624
2019
Article Quality & Performance Metrics
Overall Quality
Improving Quality
0.0
/100
Combines engagement data with AI-assessed academic quality
Reader Engagement
Emerging Content
0.3
/100
1 views
1 readers
Trending
AI Quality Assessment
Not analyzed
Abstract
This manuscript starts with a detailed analysis of the current solution for the queueing system M/Er/1/∞. In the existing solution, Erlang’s service is caused by Poisson’s arrival process of groups, but not individual clients. The service of individual clients is still exponentially distributed, contrary to the declaration in Kendall’s notation. From the related theory of the Hidden Markov Model (HMM), for the advancement of queueing theory, the idea of “hidden Markov states” (HMS) was taken. In this paper, the basic principles of application of HMS have first been established. The abstract HMS states have a catalytic role in the standard procedure of solving the non-Markovian queueing systems. The proposed solution based on HMS exceeds the problem of accessing identical client groups in the current solution of the M/Er/r queueing system. A detailed procedure for the new solution of the queueing system M/Er/1/∞ is implemented. Additionally, a new solution to the queueing system M/N/1/∞ with a normal service time N(μ, σ) based on HMS is also implemented.Reference Key |
tanackov2019algorithmsa
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
---|---|
Authors | Ilija Tanackov;Olegas Prentkovskis;Žarko Jevtić;Gordan Stojić;Pamela Ercegovac;Tanackov, Ilija;Prentkovskis, Olegas;Jevtić, Žarko;Stojić, Gordan;Ercegovac, Pamela; |
Journal | algorithms |
Year | 2019 |
DOI | 10.3390/a12070133 |
URL | |
Keywords |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.