The growth of Machine-Type Communication (MTC) increases the relevance of queuing scenarios with deterministic service times. In this letter, we present a model for queues without waiting lines and with degenerate service time distributions and show how the framework is extendable to model general service time distributions. Simple bounds and a close approximation of the blocking probability are derived and the results are shown to hold for simulated queues with Markovian and degenerate arrival processes.

中文翻译：

---

在机器类型通信中使用确定的服务时间排队且无需排队

机器类型通信 (MTC) 的增长增加了排队场景与确定性服务时间的相关性。在这封信中，我们提出了一个没有等待线和退化服务时间分布的队列模型，并展示了该框架如何扩展以模拟一般服务时间分布。导出了阻塞概率的简单边界和近似近似值，并且结果显示适用于具有马尔可夫和退化到达过程的模拟队列。