On queueing delays of dispersed messages

Abstract

We study the message queueing delays in a node of a communication system, where a message consists of a block of consecutive packets. The message delay is defined as the time elapsing between the arrival epoch of the first packet of the message to the system until after the transmission of the last packet of that message is completed. We distinguish between two types of message generation processes. The message can be generated as a batch or it can be dispersed over time. In this paper we focus on the dispersed generation model. The main difficulty in the analysis is due to the correlation between the system states observed by different packets of the same message. This paper introduces a new technique to analyze the message delay in such systems for different arrival models and different number of sessions. For an M/M/1 system with variable size messages and for the bursty traffic model, we obtain an explicit expression for the Laplace-Stieltjes transform (LST) of the message delay. Derivations are also provided for an M/G/1 system, for multiple session systems and for fixed message sizes. We show that the correlation has a strong effect on the performance of the system, and that the commonly used independence assumption, i.e., the assumption that the delays of packets are independent from packet to packet, can lead to wrong conclusions. © 1994 J.C. Baltzer AG, Science Publishers.