An Algorithmic Analysis of a Communication Model with Retransmission of Flawed Messages |
Contents
THE MATHEMATICAL MODEL | 7 |
BUSY PERIOD CHARACTERISTICS | 24 |
STATIONARY QUEUE LENGTH DISTRIBUTIONS | 45 |
Copyright | |
1 other sections not shown
Common terms and phrases
¹µ acknowledgement algorithms arbitrary point block size blocks per message bursty busy period Chapter Corollary corresponding cross moments defined denote derived differential equations eigenvalue eigenvector empty system epochs Erlang distribution error environment exponential distribution following theorem formulas function FUNDAMENTAL PERIOD given go to Step I-BO I-G+Ğ I–G+Ğ I−G+Ğ irreducible iterative j-th component Laplace-Stieltjes transform Lemma Markov chain Markov process Markov renewal process matrix mean number message transmission Nonlinear notation Note number of blocks obtained optimal P(b+t parameter PH-distribution PH-renewal process PHRP Poisson process powerful accuracy check probability vector Proof quantities random error characteristics random variable recurrence representation a,T respectively retransmission Section semi-Markov process sequence singular stochastic stochastic matrix successful block transmissions successful transmission successfully transmitted traffic intensity trans underlying PHRP XI-Q Σ Α Σ Σ Σ Φ
