This paper delves into the intricacies of retrial queuing within computer networks, synthesizing findings from various research papers. The exploration encompasses 45 distinct studies, each contributing unique insights to the understanding of retrial queuing dynamics. The reviewed papers span a range of topics, such as service time distribution, equilibrium pricing strategies, mathematical analysis of queues with phase service, breakdowns and repairs, strategic joining and pricing policies, priority, collisions, feedback customers, non-Markovian retrial systems, and adaptive permanent pooling. The insights derived from these studies contribute to the ongoing discourse on optimising the performance and efficiency of computer network systems.