Discussion Assignment Unit 5 CS 2204-01 Communications and Networking - AY2023-T5 University of the People Majd Alhaddad Ā· Distance Vector Routing was replaced with Link State Routing mainly because of two primary problems. What are they? Name them and elaborate briefly. Routing protocols are the basis for communication in modern networks. Dynamic protocols such as EIGRP, OSPF, and RIP start in networks using the topology information collected about neighboring routers, in addition to static routing protocols. Thus, there will be a number of routine protocols available, but the proper selection of the path depends on several factors, which are the convergence time, the scalability of the network, and the required specifications such as memory, CPU, security, bandwidth, and others. Routing protocols work on an algorithm basis. The routing algorithm also relies on the basis of the metric to find the best path for transmitting data over two networks. And the metrics also contains several elements such as cost, bandwidth, delay, and number of transfers, and they are stored in the routing table. These routing tables have two types, the first is internal, such as RIP, EIGRP, and IGRP. BGP and the second Exterior gateway protocol .. such as BGP4. Networks based on the TCP/IP protocol allow efficient routing of data packets based on their IP address. Routers are used to control and pass data in the network. For information about the packet connection, the function of the routine is to transmit the traffic across the network, and the routers must know where the next place that will pass the traffic to reach the last destination. In order for routers to distribute data effectively and efficiently, the choice of routing protocols has become the decisive factor for determining the success of the network during the working period. The distinguishing factors of a routing protocol from one to another include the speed of adaptation to topological changes and this is called convergence .. the ability to choose the best path from among several paths and the amount of network traffic created by the routing protocol ..
ROUTING PROTOCOLS Routing algorithms are classified into two categories, either they are Link-State, i.e. they are concerned with the state of the link, or they are Distance Vector, and here the distance and direction are taken into account. Distance Vector characteristics An example of this type is RIP and EIGRP, where it is done through: 1. Gather information for the routing table of neighbors. 2. Determine the best path by adding the metric values it receives as routing information that occurs from one router to another router .. 3. The protocols routing tables are updated periodically to update the topological change The information being updated from router to router, the result being slower convergence. Link state characteristics An example of this is OSPF, where the following steps are applied: 1. Get a complete view of the internetwork topology and build up all the necessary LSA's. 2. Each router works independently to calculate its own shortest path