Queueing Analysis of IBP+M×/D/1/K

摘要

An ATM switch is modeled as a discrete time IBP+M[×]/D/1/K queue system where a new call joins existing calls. In this paper, a complete queueing analysis of the model is presented with the use of a recursive algerithm. The queue length distribution, the waiting time distribution, and the cell loss probaility for a finite buffer system, are all exactly calculated. Numeried examples are also shown to investigate how the switching performance depends on burstiness of input traffic.