Performance analysis of random slot multiple access algorithms for DOCSIS protocol

This paper proposes the analysis of random slot multiple access algorithms for DOCSIS (Data-Over-Cable Service Interface Specifications) protocol. These algorithms are the contention mini - slots resolution algorithms that uniformly generate probability p of each user need to send a request. They can increase an efficiency of mini-slot access. In this paper, we analyze efficiency of these algorithms by consideration of throughput and delay of system. And, the analysis results provide a comparative evaluation of the Truncated Binary Exponential Back - off (TBEB) that is widely studied algorithm for DOCSIS protocol.