论文信息 - Some Tools for the Study of Channel-Sharing Algorithms - 字舞流文

Some Tools for the Study of Channel-Sharing Algorithms

We will only discuss discrete-time algorithms, with messages of standard length, equal to the discretization step: this may imply some agglutinations in the process of message arrivals, but we will neglect them.

Gabriel Ruget | G. Ruget

[1] A. D. Venttsel. Rough Limit Theorems on Large Deviations for Markov Stochastic Processes. IV , 1977 .

[2] D. Ludwig. Persistence of Dynamical Systems under Random Perturbations , 1975 .

[3] R. Azencott,et al. Mélanges d'équations différentielles et grands écarts à la loi des grands nombres , 1977 .

[4] Stanislav Molchanov,et al. DIFFUSION PROCESSES AND RIEMANNIAN GEOMETRY , 1975 .

[5] R. Khas'minskii. A Limit Theorem for the Solutions of Differential Equations with Random Right-Hand Sides , 1966 .

[6] Erol Gelenbe,et al. Stability and Optimal Control of the Packet Switching Broadcast Channel , 1977, JACM.

[7] S. Varadhan,et al. Asymptotic evaluation of certain Markov process expectations for large time , 1975 .