Steady State Analysis of Buffer Contents in a General Communication System

Analyzing buffer contents is important for communication systems. Queueing systems have been used to study many discrete time communication models and networks. In this paper, we investigate the buffer contents (queue length) of general discrete-time communication system assuming general probability distributions for both arrival process and service time. Data is divided into fixed length packets each requires equal transmission time. The system is considered with infinite buffer and single server. The buffer is analyzed using two-dimensional Markov Chain. Results include general expressions of Joint probability generating functions of buffer contents, buffer contents at arbitrary slot boundaries, and buffer contents at departure time of packets.