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.
展开▼
机译:ATM交换机被建模为一个离散时间IBP + M [×] / D / 1 / K Queue系统,其中新呼叫加入现有调用。在本文中,使用递归Algerithm来介绍模型的完整排队分析。有限缓冲系统的队列长度分布,等待时间分布和单元丢失概率均完全计算。还显示了数值示例来研究切换性能如何取决于输入流量的突发。
展开▼