A random access algorithm for data networks carrying high priority traffic

This publication has 10 references indexed in Scilit:

• Multiple access algorithms for a system with mixed traffic: high- and low-priority
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2003
• A full sensing window Random-Access algorithm for messages with strict delay constraints
  Algorithmica, 1989
• A simple window random access algorithm with advantageous properties
  IEEE Transactions on Information Theory, 1989
• On the Relation Between the Finite and the Infinite Population Models for a Class of RAA's
  IEEE Transactions on Communications, 1987
• A Method for the Delay Analysis of Random Multiple-Access Algorithms Whose Delay Process is Regenerative
  IEEE Journal on Selected Areas in Communications, 1987
• A 0.487 throughput limited sensing algorithm
  IEEE Transactions on Information Theory, 1987
• Multiple-access protocols and time-constrained communication
  ACM Computing Surveys, 1984
• Tree algorithms for packet broadcast channels
  IEEE Transactions on Information Theory, 1979
• Criteria for classifying general Markov chains
  Advances in Applied Probability, 1976
• Some Conditions for Ergodicity and Recurrence of Markov Chains
  Operations Research, 1969