The Mean Resequencing Delay for M/H_K/infty Systems

The relationship between the mean resequencing delay and variations in packet transmission times is studied. Assuming a Poisson stream of packets, a K-stage hyperexponential transmission time distribution and an infinite number of equal capacity links connecting the source and destination nodes, the authors derive an expression for the mean resequencing delay. This result provides an upper bound on the mean resequencing delay for nodes connected by finitely many links. They observe that for the two-stage and three-stage hyperexponential distribution, the mean resequencing delay varies almost perfectly linearly with the squared coefficient of variation. An asymptotic bound analysis can explain this behavior. >

[1]  Kishor S. Trivedi Probability and Statistics with Reliability, Queuing, and Computer Science Applications , 1984 .

[2]  S. Chowdhury On message resequencing in computer networks , 1989, Eighth Annual International Phoenix Conference on Computers and Communications. 1989 Conference Proceedings.

[3]  Tak-Shing Peter Yum,et al.  Resequencing of messages in communication networks , 1986, IEEE Trans. Commun..

[4]  Subhash C. Agrawal,et al.  Analysis of the resequencing delay for M/M/m systems , 1987, SIGMETRICS '87.

[5]  Parviz Kermani,et al.  Analysis of a Resequencing problem in Communication Networks , 1983, INFOCOM.