DocumentCode
2063771
Title
Prioritized access in CSMA networks: a node partitioning approach
Author
Arora, Rajiv ; Albicki, Alexander
Author_Institution
Dept. of Electr. Eng., Rochester Univ., NY, USA
fYear
1988
fDate
10-12 Oct 1988
Firstpage
275
Lastpage
280
Abstract
The authors address the problem of incorporating message-based priority classes in random access protocols. The organization of these classes is based on the different packet delay requirements of higher-layer applications. A novel node-partitioning mechanism to restrict contention only to higher priority packets is introduced. The authors describe node-partitioning carrier-sense multiple access (NP-CSMA), a protocol that uses CSMA as its base access mechanism, and incorporates three priority mechanisms that influence different aspects of the channel access. These are node partitioning, priority queueing at station buffers, and prioritized persistence. A detailed simulation model is described. Simulation studies that demonstrate the effect of these mechanisms, separately and in concert, on the throughput and delay of the various priority classes are presented. It is shown how desired performance can be achieved by suitable variation of protocol parameters
Keywords
carrier sense multiple access; packet switching; queueing theory; CSMA networks; message-based priority classes; node partitioning approach; packet delay; prioritized access; prioritized persistence; priority queueing; random access protocols; simulation model; station buffers; Access protocols; Computational modeling; Delay; Intelligent networks; Local area networks; Multiaccess communication; Network topology; Telecommunication traffic; Throughput; Traffic control;
fLanguage
English
Publisher
ieee
Conference_Titel
Local Computer Networks, 1988., Proceedings of the 13th Conference on
Conference_Location
Minneapolis, MN
Print_ISBN
0-8186-0891-9
Type
conf
DOI
10.1109/LCN.1988.10238
Filename
10238
Link To Document