Abstract
A discrete buffered system with infinite buffer size, multiple Poisson arrival streams, priority service, and random server interruptions is considered. The queueing times of the data packets of different priority classes are derived using the concepts of delayed busy cycle and level crossing analysis. The results of this study can be used as a guidelines for the buffer design in digital systems.

This publication has 13 references indexed in Scilit: