Collision resolution algorithm for M-priority users

Author

Chung, W.S. ; Un, C.K.

Author_Institution

Dept. of Electr. Eng., Korea Adv. Inst. of Sci. & Technol., Taejon, South Korea

Volume

142

Issue

3

fYear

1995

fDate

6/1/1995 12:00:00 AM

Firstpage

151

Lastpage

157

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

Keywords

access protocols; multi-access systems; queueing theory; telecommunication congestion control; telecommunication traffic; M-priority users; clipped binary-tree protocol; collision detection; collision resolution algorithm; delay characteristic; maximum throughput; modified M/D/1 priority queueing model; random access communication systems; simulations; throughput performance; total traffic;

fLanguage

English

Journal_Title

Communications, IEE Proceedings-

Publisher

iet

ISSN

1350-2425

Type

jour

DOI

10.1049/ip-com:19951909

Filename

398754