The state 0 of a birth and death process with state space E = {0, 1, 2,....} is a barrier which can be classified into four kinds： reflection, absorption, leaping reflection, quasi-leaping reflection. For the first, second and fourth barriers, the characteristic numbers of different forms have been introduced. In this paper unified characteristic numbers for birth and death processes with barriers were introduced, the related equations were solved and the solutions were expressed by unified characteristic numbers. This paper concerns work solving probability construction problem of birth and death processes with leaping reflection barrier and quasi-leaping reflection barrier.
In this paper, we consider a BMAP/G/1 G-queue with setup times and multiple vacations. Arrivals of positive customers and negative customers follow a batch Markovian arrival process （BMAP） and Markovian arrival process （MAP） respectively. The arrival of a negative customer removes all the customers in the system when the server is working. The server leaves for a vacation as soon as the system empties and is allowed to take repeated （multiple） vacations. By using the supplementary variables method and the censoring technique, we obtain the queue length distributions. We also obtain the mean of the busy period based on the renewal theory.
