Journal
AUTOMATION AND REMOTE CONTROL
Volume 84, Issue 7, Pages 673-686Publisher
MAIK NAUKA/INTERPERIODICA/SPRINGER
DOI: 10.1134/S000511792307007X
Keywords
MAP request flow; single-server queueing system; stationary probability distribution of system states; numerical characteristics
Ask authors/readers for more resources
This study focuses on a single-server queueing system with an incoming Markovian Arrival Process (MAP) request flow consisting of two states. The paper derives explicit expressions for the stationary probability distribution of the states and evaluates several numerical characteristics of the system, including the probability of idle time for the server, the expected number of requests in the system, and the mean queue length. Results are presented in tabular and graphical form, and the paper also examines the recurrent MAP flow as a special case of correlated MAP request flows.
This paper considers a single-server queueing system with an incoming Markovian Arrival Process (MAP) request flow with two states. Explicit expressions are derived for the stationary probability distribution of the states and several numerical characteristics of the system (the probability of idle time of the server, the expected number of requests in the system, and the mean queue length). The resulting numerical characteristics are presented in tables and plotted in graphical form as well. The recurrent MAP flow with two states as a special case of correlated MAP request flows is studied.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available