Queuing with Deterministic Service Times and No Waiting Lines in Machine Type Communications

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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset