Performance of a partially shared priority buffer with correlated arrivals

In this paper, we analyse a finite sized discrete time priority buffer with two types of packet arrivals, referred to as class 1 and class 2 packets. Packets of both classes arrive according to a discrete batch Markovian arrival process, taking into account the correlated nature of arrival processes in heterogeneous telecommunication networks. Packets of class I are assumed to have both space priority and transmission priority over packets of class 2. In particular, the partial buffer sharing acceptance policy is adopted as space priority mechanism. Using a matrix analytic approach, the buffer content is analysed and through some numerical examples, the impact of the priority scheduling, the threshold and the correlation in the arrival process is demonstrated