The Average CRI-Length of a Controlled ALOHA Collision Resolution Algorithm
暂无分享,去创建一个
[1] G. Doetsch. Handbuch der Laplace-Transformation , 1950 .
[2] Philippe Flajolet,et al. Q -ary collision resolution algorithms in random-access systems with free or blocked channel access , 1985, IEEE Trans. Inf. Theory.
[3] Robert G. Gallager,et al. A perspective on multiaccess channels , 1984, IEEE Trans. Inf. Theory.
[4] Philippe Flajolet,et al. Estimating the multiplicities of conflicts to speed their resolution in multiple access channels , 1987, JACM.
[5] Ulrich Schmid. On the asymptotics of the average CRI length of the slotted ALOHA collision resolution algorithm , 1992 .
[6] Robert Metcalfe,et al. Ethernet: distributed packet switching for local computer networks , 1976, CACM.
[7] Edmund Taylor Whittaker,et al. A Course of Modern Analysis , 2021 .
[8] P. Flajolet,et al. Some Uses of the Mellin Integral Transform in the Analysis of Algorithms , 1985 .