Erasures, noise, and capture in DQRAP, the Distributed Queueing Random Access Protocol

In this thesis we examine operation and performance of DQRAP when errors are introduced into the system. Where necessary modification to the Algorithm are proposed to effectively correct these errors. We analyze DQRAP's robustness and quantify the degradation of the system performance in presence of different types of errors. The Distributed Queueing Random Access Protocol (DQRAP) is a revolutionary approach to managing channel access which may very well bring about a unified method of communications. DQRAP is a random multiple access protocol that operates in a slotted channel with minislots and ternary feedback. The system employs multiple distributed queues, two at each station, a request queue and a transmission queue, in order for stations to manage the access to channel and the transmission of data. It achieves the best performance of all known protocols in this class, approaching the performance of an idealized protocol.; We analyze DQRAP in symmetric discrete memoryless noisy channels, channels with the property of erasures, and in channels with the property of capture. We utilize a model of DQRAP network.; The results show that DQRAP is a stable and robust protocol in the presence of transmission channel errors. We include a detailed analysis of all parameters of the algorithm for comparison with other random multiaccess protocols in noisy environments. We conclude that DQRAP possesses characteristics that provide for its superior performance in noisy channels and make it stand out from other known random multiaccess protocols in terms of its robustness, stability and performance, and show the analysis of all. In the presence of channel errors that affect control minislots, DQRAP maintains most of the performance characteristics of its error-free operation. We also describe the ways in which the protocol's performance can be improved in the noisy environments, and study the trade-offs. Research shows that channel access strategy and contention resolution algorithms that employ minislots are superior in robustness and performance in channels with errors to other random multiaccess protocols.