Each of the generated packets can have two different priorities(high- and low-priority packets). High-priority packets are assumed tohave a more restrictive delay requirement than low priority ones. Forsuch a system, the authors propose a class of synchronous random-accessalgorithms which use a small portion of the channel capacity for theannouncements of the existence of high- or low-priority packets. Thestability and throughput-delay performances of the algorithms aredetermined analytically for the cases when one or two minislots areused. Representative performance results are given and compared with asimilar algorithm which does not use minislots. The algorithms give adelay advantage to the high-priority packet class without adverselyaffecting the delays of the low-priority packets. The algorithms usebinary C-NC (collision versus noncollision) feedback, and the maximumthroughput is 0.487 when two minislots are used
展开▼
