CC BY
35
TECHNICAL SCIENCES
ABOUT THE CLASSIFICATION OF DYNAMIC ROUTING
PROTOCOLS Zemtsov A.N.1 (Russian Federation), Tran Dung Khanh2 (Socialist Republic of Vietnam) Email: Zemtsov446@scientifictext.ru
1Zemtsov Andrey Nikolaevich - Candidate of Technical Sciences, Assistant Professor, DEPARTMENT OF ELECTRONIC COMPUTERS AND SYSTEMS, VOLGOGRAD STATE TECHNICAL UNIVERSITY, VOLGOGRAD; 2Tran Dung Khanh - MSc in Computer Science, Lecturer, SCHOOL OF INFORMATION TECHNOLOGY AND DIGITAL ECONOMICS NATIONAL ECONOMICS UNIVERSITY, HANOI, SOCIALIST REPUBLIC OF VIETNAM
Abstract: the article is devoted to one of the key problems in communication systems - the problem of classification of routing protocols. It is proposed to approach the classification of routing protocols not from the point of view of a given theory beforehand, but from the point of view of the principles of functioning of routing protocols as a phenomenon and object of analysis, using as criteria the scope of application and the principle of exchange of route information necessary for creating a presentation of network topology. Keywords: routing protocols, RIP, OSPF, EIGRP, BGP, classful, classless, distance-vector, link-state.
О КЛАССИФИКАЦИИ ПРОТОКОЛОВ ДИНАМИЧЕСКОЙ МАРШРУТИЗАЦИИ Земцов А.Н.1 (Российская Федерация), Чан Зунг Хань2 (Социалистическая Республика Вьетнам)
1 Земцов Андрей Николаевич - кандидат технических наук, доцент,
кафедра электро-вычислительных машин и систем, Волгоградский государственный технический университет, г. Волгоград;
2 Чан Зунг Хань - магистр техники и технологии, преподаватель,
Школа информационных технологий и цифровой экономики Национальный экономический университет, г. Ханой, Социалистическая Республика Вьетнам
Аннотация: статья посвящена одной из ключевых проблем в системах связи -проблеме классификации протоколов маршрутизации. Предлагается подход к классификации протоколов маршрутизации не с точки зрения имеющихся теоретических представлений, а с точки зрения принципов функционирования протоколов маршрутизации как явления и объекта анализа, используя в качестве критериев область применения и принципы, лежащие в основе обмена маршрутной информацией, необходимой для создания протоколом представления топологии сети. Ключевые слова: протоколы маршрутизации, RIP, OSPF, EIGRP, BGP, классовая маршрутизация, бесклассовая маршрутизация, дистанционно-векторные протоколы, протоколы состояния связей.
Many works provide the analysis of interior gateway protocols by evaluating each routing protocol behavior and characteristic [1].
Routing Information Protocol (RIP) was developed by Xerox under the name of GWINFO (Gateway Information protocol) as part of the Xerox Network System (XNS). The protocol was later formally standardized by the IETF and is specified in the RFC 1058. RIP is an open standard interior gateway protocol. It also a distance vector routing protocol
11 ■ European science № 4 (46)
meaning that it uses hop count to calculate the cost of a route. Hop count can be defined as the number of devices that have to be traversed before reaching the destination i.e. a directly connected network will have a hop count of 0. RIP has a maximum hop count of 15 and any network more than 15 hops away will be considered unreachable. This makes this protocol unsuitable for large networks. RIPv1 is a classful protocol but RIPv2 supports variable-length subnet masking. RIPv2 was developed as a hybrid routing protocol due to the fact that it exhibits certain characteristics of link-state protocols [2].
OSPF is an interior gateway protocol that was developed as an alternative to the Routing Information Protocol. OSPF is an open standard link state protocol designed with high scalability to accommodate large networks. It also supports VLSM (variable length subnet masking) which ensures efficient use of IP address space. OSPF uses Link State Advertisements (LSA) to advertise the status of adjacent links. Changes in the data transfer rate meant that there was a need for a routing protocol that could take this into account when calculating the shortest path to a destination. The metric for this protocol is calculated based on the bandwidth, delay, and load on the link. The metric or cost in OSPF is defined as the delay associated with sending packets across that interface.
Enhanced Interior Gateway Routing Protocol (EIGRP) was designed as a Cisco proprietary distance vector routing protocol. EIGRP was introduced in 1993 as a response to the coming of classless routing which was not supported by its predecessor IGRP [3]. EIGRP uses the diffusing update algorithm (DUAL) to calculate the least cost paths to destinations. The best path is calculated using the bandwidth, delay, load, and maximum transmission unit. Unlike the Bellman-Ford algorithm used by RIP, if there is a topology change, only the affected parts of the network will be involved in the re-calculation of the least cost path and only incremental updates will be sent. This significantly reduces the overhead making EIGRP one of the fastest converging protocols. Although it is defined as a distance vector protocol, EIGRP combines features of both link-state and distance-vector routing protocols.
Border Gateway Protocol (BGP) is an IETF standardized routing protocol designed to exchange routing information between autonomous systems on a network who described in RFC 1163. It manages the transmission of information about routing and reachability between edge routers. BGP can also be used for routing within an autonomous system in which case it is called internal BGP. Routing decisions are made based on the available paths and the rules or network policies configured by the network administrator. Automatic discovery of peers is not supported hence connections have to be set up manually and IP addresses have to be manually configured at both ends. If the path selection criteria are not predefined by the administrator to meet the business needs of his/her organization, BGP will select the path with the lowest number of hops (intervening autonomous systems).
Thus, it is proposed to divide the routing protocols by the criterion of the size of the working area into 2 groups: interior gateway protocols and exterior gateway protocols. The first group includes the RIP, IGRP, OSPF, EIGRP, and IS-IS protocols. Distance vector protocols measure the distance to work out the best route for IP packets within a network. Link state protocols exchange routing information with each other by polling using the hello protocol. The first group includes the RIP, IGRP and EIGRP protocols. The group of link state protocols should be assigned the OSPF and IS-IS.
References / Список литературы
1. Masruroh S.U., Widya K.H.P., Fiade A. and Julia I.R. Performance Evaluation DMVPN Using Routing Protocol RIP, OSPF, And EIGRP. 2018 6th International Conference on Cyber and IT Service Management (CITSM), Parapat, Indonesia, 2018, Pp. 1-6.
2. Asadi A. A survey on device-to-device communication in cellular networks // IEEE Communications Surveys and Tutorials, 2014. Vol. 16(4). Pp. 1801-1819.
3. Kurose J.F., Ross K. W. Computer Networking A Top-Down Approach. Pearson, 2013.
European science № 4 (46) ■ 12
