Analysis of random slot multiple access algorithms for DOCSIS network

Data-Over-Cable Service Interface Specifications (DOCSIS) permit the addition of high-speed data transfer to an existing Cable TV (CATV) system. In DOCSIS standard, the binary exponential back-off (BEB) algorithm has been studied in many paper. These papers resolved collision in the request mini-slot contention process since this algorithm normally allocates unnecessary large contention window. In this paper, we propose simple contention resolution algorithms, called random slot multiple access algorithms. These algorithms which use p-persistence value, which are the transmission required probability of each station in analysis method. We simulate the system and the analyzed models of random slot multiple access algorithms by randomly selected mini-slots. The mini-slots are selected from p-persistence value of transmission required probability and individual address of each station.