A Method for the Delay Analysis of Random Multiple-Access Algorithms Whose Delay Process is Regenerative
暂无分享,去创建一个
[1] P. Papantoni-Kazakos,et al. Limited feedback sensing algorithms for the packet broadcast channel , 1985, IEEE Trans. Inf. Theory.
[2] J. Massey. Collision-Resolution Algorithms and Random-Access Communications , 1981 .
[3] S. Stidham. Regenerative processes in the theory of queues, with applications to the alternating-priority queue , 1972, Advances in Applied Probability.
[4] Toby Berger,et al. Delay Analysis of 0.487 Contention Resolution Algorithms , 1986, IEEE Trans. Commun..
[5] L. Kantorovich,et al. Approximate methods of higher analysis , 1960 .
[6] Walter L. Smith. Renewal Theory and its Ramifications , 1958 .
[7] Robert G. Gallager,et al. A perspective on multiaccess channels , 1984, IEEE Trans. Inf. Theory.
[8] Jacob Cohen,et al. On regenerative processes in queueing theory , 1976 .