Analytical investigation of a single-server queueing system with an incoming MAP event flow

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.