M. Kaplan, “A Sufficient Condition for Non-ergodicity of a Markov Chain”, IEEE Transactions on Information Theory, 1979, vol. 25, pp. 470-471. doi:10.1109/TIT.1979.1056059

has been cited by the following article:

• TITLE: Random Access Algorithms in Packet Networks—A Review of Three Research Decades

  AUTHORS: A. T. Burrell, P. Papantoni-Kazakos

  KEYWORDS: Random Access; Packet Networks; Channel Sensing; Throughput and Delay Analysis; Sensitivity to Feedback Errors; Limit Poisson User Model

  JOURNAL NAME: International Journal of Communications, Network and System Sciences, Vol.5 No.10, October 31, 2012

  ABSTRACT: We present a coherent and systematic review of Random Access Algorithms for packet networks, as developed over three and a half decades. We consider the appropriate user models and we classify the algorithms according to the channel sensing constraints imposed. We also present a review of the analytical methodologies required for the performance analysis of these algorithms.