In this paper, we study a finite capacity queue where the arrival process is special case of discrete time Markov modulated Poisson process, service times are generally distributed, and server takes repeated vacations when system empty. The buffer acceptance strategy based on generalized push-out scheme: full, an arriving customer pushes out Nth in queue, N values between 2 system, joins end qu...
