On the Information-Theoretic Capacity of Discrete-Time Queues

Abstract

this paper, we consider the timing capacity of two models of discrete-time single-server queues. The first model is the discrete-time analogue of the continuous-time model analyzed in [1]. In this model, packets arrive and depart in discrete time slots. We allow at most one packet arrival and at most one packet departure in each slot. Service times of packets are independent, identically distributed (i.i.d.), integer-valued random variables with mean 1=¯ slots. We obtain upper and lower bounds to the -timin