Queuing System, Based On The Theory Of Markov Skeleton Process Minimum Captain

The shortest queueing system is one of the important class models in queueing theory, this model has been applied to information and communication in Code Division Multiple Access (CDMA) cellular systems.In this thesis ,apply with the theory of Markov skeleton process ,which is a new theory tools establised by Hou Zhenting etal,to study the shortest queueing system.The content and main result of the thesis as follows:In chapter 1, the queuing theory research history and the present situation are outlined ,simultaneously has listed the thesis structure and the main result.In chapter 2,the preliminary knowledge of Markov skeleton process are introduced, including the concept of Markov skeleton process, backward and forward equation, limit distribution, and other important elements.In chapter 3,study the M/(G/1)~2 type shortest queueing system and the transient distribution and the limit distribution of the queue length of the types queueing model are obtained and prove that the transient distribution is the minimal nonnegative solution of the backward equation.In chapter 4,analysis the GI/(M/1)~2 type shortest queueing system and the transient distribution and the limit distribution of the queue length of the types queueing model are obtained and prove that the transient distribution is the minimal nonnegative solution of the backward equation.In chapter 5,study the GI/(G/1)~2 type shortest queueing system, the transient distribution and the limit distribution of the queue length of the types queueing model are obtained and prove that the transient distribution is the minimal nonnegative solution of the backward equation.