A Multiclass Discrete-Time Processor-Sharing Queueing Model for Scheduled Message Communication over Multiaccess Channels with Joint Maximum-Likelihood Decoding

摘要

We develop a multi-class discrete-time processor-sharing queueing model for scheduled message communication over a discrete memoryless multiple access channel with joint maximum-likelihood decoding. The framework we consider here models both the random message arrivals and the subsequent reliable communication by suitably combining techniques from queueing theory and information theory. Requests for message transmissions are assumed to arrive according to i.i.d. arrival processes. Then, (i) we derive an outer bound to the stability region of message arrival rate vectors achievable by the class of stationary scheduling policies, (ii) we show for any message arrival rate vector that satisfies the outer bound, that there exists a stationary "state-independent" policy that results in a stable system for the corresponding message arrival processes, and (iii) the stability region of information arrival rate vectors is the information-theoretic capacity region of a multiaccess channel.