A Stable Random Access Protocol For A Computer Network


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 4, No. 2, pp. 515-522, Feb. 1997
10.3745/KIPSTE.1997.4.2.515,   PDF Download:

Abstract

A near perfect stable random access protocol for a broadcast channel, the distributed queuing random access protocol(DQRAP), is presented and evaluated. The DQRAP protocol utilizes minislots provide ternary channel feedback and two distributed queues to : (a) resolve contention and (b) to schedule the transmission of messages. Three minislots are sufficient to resolve collisions faster than the transmission times of all involved arrivals when ternary minislot feedback is used. Modelling and simulation indicate that the DQRAP protocol, using as few as three minislot, achieves a performance level which approaches that of a hypothetical perfect scheduling protocol, i.e., the M/D/I system, with respect to propagation delay, thus offers the potential of improved performance over current protocols in satellite, metropolitan and packet radio networks.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
L. S. Keon, "A Stable Random Access Protocol For A Computer Network," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 4, no. 2, pp. 515-522, 1997. DOI: 10.3745/KIPSTE.1997.4.2.515.

[ACM Style]
Lee Sang Keon. 1997. A Stable Random Access Protocol For A Computer Network. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 4, 2, (1997), 515-522. DOI: 10.3745/KIPSTE.1997.4.2.515.