MESSAGE SOJOURN TIME FOR TDM SCHEMES WITH ANY BUFFER CAPACITY

In this paper we deal with a queueing model based on TDM schemes. Many results concerning this kind of model can be found in literature, but a large part of these results only concerns particular cases. Our mai n concern is to provide a general solution for the exact message sojou rn time in the queue that should be available whatever the storage cap acity may be. First, the probability distribution function as well as the Laplace transform of the message sojourn time in the buffer are de rived, assuming Poisson fixed-length message arrivals, multiple output and finite buffer capacity. Second, taking advantage of these results , we provide the expected value of the message sojourn time and compar e our results with those obtained by many authors. The formulas stated here are available for various particular cases especially for unlimi ted buffer capacity. Finally, we point out that the work done is direc tly usable for performance evaluation of many communication systems su ch as real-time networks, multiplexers and ATM links. Therefore, our r esults are both of theoretical and practical interests.