Delay analysis of the n-ary stack random-access algorithm

This publication has 11 references indexed in Scilit:

• A Method for the Delay Analysis of Random Multiple-Access Algorithms Whose Delay Process is Regenerative
  IEEE Journal on Selected Areas in Communications, 1987
• Some Remarks on the Asymptotic Behavior of the Lengths of a Collision Resolution Interval
  IEEE Transactions on Communications, 1986
• On the Throughput of Channel Access Algorithms with Limited Sensing
  IEEE Transactions on Communications, 1986
• Q-ary collision resolution algorithms in random-access systems with free or blocked channel access
  IEEE Transactions on Information Theory, 1985
• Analysis of a stack algorithm for random multiple-access communication
  IEEE Transactions on Information Theory, 1985
• A Class of Efficient Contention Resolution Algorithms for Multiple Access Channels
  IEEE Transactions on Communications, 1985
• Non-negative Matrices and Markov Chains
  Published by Springer Nature ,1981
• Tree algorithms for packet broadcast channels
  IEEE Transactions on Information Theory, 1979
• On Regenerative Processes in Queueing Theory
  Published by Springer Nature ,1976
• Regenerative processes in the theory of queues, with applications to the alternating-priority queue
  Advances in Applied Probability, 1972