Buffer analysis for asynchronous data interpolation in analogue speech

The store-and-forward buffer required for asynchronous data interpolation (ADI) in analogue speech is analysed using a queueing model with single server having 1st-order Markov interruptions. The buffer-content probability generating function and probability mass function are derived. It is shown that the empty-buffer probability in the finite buffer equals that of the infinite buffer with its offered load equal to the carried load of the finite buffer. This concept proves helpful in obtaining a solution for the finite buffer through the solution for infinite buffer which is obtained in a closed form. This results in considerable saving in computer time. Although the results presented are for analogue speech, they can serve as a worst-case design for the STDM case.