Abstract
The authors propose and analyse a collision resolution algorithm (CRA) with M (≥2) priority classes in random access communication systems. When it is applied to the clipped binary-tree protocol, it is stable if the total traffic is below 0.473 packets per slot regardless of the value of M. Its maximum throughput is higher than those obtained previously. When the algorithm is applied to the tree protocol with collision detection (Tree/CD) where the length of a packet is longer than one slot, the throughput performance can be enhanced by as much as one. Using the modified M/D/1 priority queueing model, the delay characteristic is evaluated and confirmed by simulations. The proposed priority CRA has advantages in the capability of supporting various priority traffics with high throughput.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call