ANALYSIS OF ROUTING PROTOCOLS EFFECTIVENESS IN COMPUTER NETWORKS

Abstract

The main task of networks is to transport information from the sending computer to the receiving computer. In most cases, you need to make several transfers to do this. The problem of choosing a path is solved by routing algorithms. The routing algorithm must have well-defined properties: reliability, correctness, stability, simplicity and optimality. The latter property is not as transparent as it may seem at first glance, it all depends on which or which parameters are optimized. This task is sometimes not at all easy even for relatively simple local networks. Optimization parameters may include minimum delivery delay, maximum throughput, minimum price, maximum reliability, or minimum error probability. In this paper, reactive, proactive and hybrid routing protocols are considered. When making their choice, we relied on the method of hierarchy analysis. Based on the results obtained during the simulation of a network with video conference traffic, a matrix was constructed for each of the criteria studied. The protocols were compared in terms of the possibility of information loss. The results of the research can be useful in the course of building modern computer networks.