M. Paterakis, L. Georgiadis and P. Papantoni-Kazakos, “On the Relation between the Finite and the Infinite Population Models for a Class of RAA’s,” IEEE Transactions on Communications, Vol. 35, No. 11, 1987, pp. 1239-1240. doi:10.1109/TCOM.1987.1096696

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.