Service Capacity Sharing Strategy Of Queueing Model Based On Markov Theory

Queueing theory originated in the early 20th century, beginning with the research on telecommunications system by Danish telecom engineer A. K. Erlang. After that, it gradually developed into a very mature form of theory with strong practical usage and value. In the recent years, the queueing theory study is asked to be actual in order to give some advice to queueing system designer. This study is from the actual problem. We design the capacity sharing queueing model in this study. Then the performance characteristics of the model will be analyzed and the compared with other queueing model. At last, we give the economic indicators, and make system's reward-cost analysis to provide ideas and considerations of model selection.In the beginning, we briefly introduce the history and base theory of queueing theory. And the background of the problem and the component of the study also be introduced. Then we begin to study the capacity sharing queueing system. Detailed model description is given and the steady-state probability vector is obtained. We get the performance characteristic of system and make the sensitivity analysis. As the main part of this study, we make the comparison of capacity sharing system and other system. In order to get the better understanding, the comparison will be based on the customers'arrival rates, service rates and the endurance limits respectively. At last, we give the economic indicators, and make system's reward-cost analysis to provide ideas and considerations of model selection. In this part, the waiting-time cost of customer in the system is considered in the reward-cost function. According to the economic analysis, we can get the key factors that influence the selection of the system.