• DocumentCode
    1554757
  • Title

    The mean resequencing delay for M/HK/∞ systems

  • Author

    Chowdhury, Shyamal

  • Author_Institution
    Dept. of Comput. Sci., Arizona Univ., Tucson, AZ, USA
  • Volume
    15
  • Issue
    12
  • fYear
    1989
  • fDate
    12/1/1989 12:00:00 AM
  • Firstpage
    1633
  • Lastpage
    1638
  • Abstract
    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
  • Keywords
    computer networks; electronic messaging; packet switching; queueing theory; K-stage hyperexponential transmission time distribution; Poisson stream; asymptotic bound analysis; destination nodes; equal capacity links; mean resequencing delay; packet transmission times; upper bound; Circuits; Computer architecture; Computer networks; Computer science; Delay effects; H infinity control; Joining processes; Queueing analysis; Upper bound; Virtual colonoscopy;
  • fLanguage
    English
  • Journal_Title
    Software Engineering, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0098-5589
  • Type

    jour

  • DOI
    10.1109/32.58774
  • Filename
    58774