Analysis of a prioritized CSMA protocol based on staggered delays |
| |
Authors: | William R. Franta Mark Benedict Bilodeau |
| |
Affiliation: | (1) Department of Computer Science, University of Minnesota, 55455 Minneapolis, MN, USA |
| |
Abstract: | Summary Carrier sense multiple access (CSMA) protocols were originally conceived for use in digital radio communication. Such protocols are, however, quite applicable in a variety of distributed computing and local networking configurations based on a shared bus. The CSMA protocols are characterized by the fact that message collisions can occur only in a very small time window whose duration corresponds to the propagation delay of the bus. They are further characterized by the technique used to subsequently serialize the transmission of the colliding messages. In this paper we analyze the situation wherein colliding messages are serialized by using a set of staggered retry delays which are associated with the sources that may generate the colliding messages. Our analysis produces both path throughput (utilization) curves and message delay curves, as a function of message generation rate. These curves show that the protocol is in a sense self stabalizing, serve to quantify its behaviour, and indicate loading levels which result in unacceptable message delays. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|