Professional Documents
Culture Documents
By Utkarsh Hathi
Routing
A process of selecting paths in a network to decide where to send the network traffic. In most subnets, packets require multiple hops to make the journey. Even in broadcast networks, routing is an issue if source and destination are not on the same network.
Routing Algorithm
Routing Algorithm is that part of the network layer software responsible for deciding which output line an incoming packet should be transmitted on. Overall performance of your network depends on the routing algorithms
Continued
Routing Algorithm cant be changed, only protocols can be changed and as different protocols use different algorithms; changing it will change the algorithm as well. Now, we will have a look at the different routing protocols by the algorithms they support.
Routing Metric
A property of a route, consisting of a value used by algorithms to decide which route will perform better Different algorithms and protocols use different metrics and that can help us to decide which protocol to use by the type of services we want.
Continued
RIP is not preferred choice for routing as its convergence time and scalability are poor compared to EIGRP, OSPF or IS-IS. RIP V1 doesnt support subnet while RIP V2 does thus supporting Classless Inter-domain routing.
IGRP
Interior gateway routing protocol (IGRP), another distance vector routing protocol invented by CISCO and increases the hop limit to 255 from 15 of RIP. Supports multiple metrics such as bandwidth, delay, load, MTU and reliability.
Each node independently runs an algorithm over the map to determine the shortest path from itself to every other node in the network Uses link as the metric and will choose the path from where the packet will reach the fastest
Example:
Continued
OSPF Areas
Allows an AS to be split into different areas for ease of management and the routing information transmitted between areas is summarized to reduce network bandwidth consumption. Special area called the backbone
OSPF Computation
OSPF route computation OSPF route computation is described as follows: 1. Based on the network topology around itself, each router generates Link State Advertisements (LSA) and sends them to other routers in update packets. 2. Each OSPF router collects LSAs from other routers to compose a LSDB (Link State Database). An LSA describes the network topology around a router, so the LSDB describes the entire network topology of the AS. 3. Each router transforms the LSDB to a weighted directed graph, which actually reflects the topology architecture of the entire network. All the routers have the same graph. 4. Each router uses the SPF algorithm to compute a Shortest Path Tree that shows the routes to the nodes in the autonomous system. The router itself is the root of the tree.
The exchange of the routing information between two routers using BGP takes place in a session. For that BGP uses the services of TCP; when a TCP connection is created for BGP it lasts for long.