Analysis of a Single-Buffer Loss-Delay System

Abstract

Tasks arrive at a finite-capacity buffer according to a Markov counting process conditioned on the number in the buffer. A processor visits the buffer at a random time epoch, serves up to a given maximum number of tasks, leaves, and repeats this process. The probability of buffer overflow, and the waiting time of a task until it is processed are studied as a function of model parameters.