1.

RIP is distance vector routing protocal reason is bcoz its limited number of hop counts
2.number of hops in rip =15
3.RIP convergence mechanism is recieve update> execute uupdate >send updates
4.when hop count =15, destination unreachable
REQUIREMENTS OF LARGE NETWORKS ARE;
a. Networks are expanding:
b. Higher network reliability is required:
c. Network heterogeneity requires interconnection between multi-vendor devices:

problems with RIP

1. hop by hop convergence----causes slow network convergence
2. routing by roumers -------------lack of uderstanding global network
3. maximum hop limit of 15-------unreachable destination
4. usinghop count to measure distance towards destination-----cant select suboptimal route to destination

solution to RIP PROBLEMS

1. use recieve updates>send updates>calcurate routes
2. use topology information to calcurate routes
3. unlimited hop count
4. use link bandwidth to find routes not distance
OSPF PROTOCAL
uses SPF algorithm
uses accumulated link cost as the criteria for route selection
MEANING OF LINK STATE IN OSPF
IP address and mask of the interface
Bandwidth of the interface Neighbor that the interface is connected to
OSPF transmits link state information to its neighbors instead of transmitting its complete routing table.
Each router maintains its link state database (LSDB).
Neighbors synchronize their LSDBs and then use the SPF algorithm to calculate the optimal route.
This speeds up the network convergence speed.
OSPF uses the accumulated bandwidth of the links as the criterion for route selection.
This method is more accurate than using the accumulated hop count.

The process of OSPF route calculation can be summarized in three steps:

Routers discover neighbors and establish neighbor relationships.
Each router generates link state information and floods it to all neighbors,
meanwhile collects link state information from its neighbors until the LSDBs are synchronized among OSPF neighbors.
On the basis of its LSDB, each router uses the SPF algorithm to calculate a Shortest Path Tree (SPT) with itself as the root.
By building an SPT, each router calculates the optimal routes to destination.
The routes form a routing table eventually.

There are several, dozens of, or even hundreds of devices on an enterprise network. Each of these devices must be uniquely
identified by a router ID.

It prefers the manually configured router ID. You are advised to manually configure a router ID for an OSPF router. If there is no
router ID manually configured, it selects the largest IP address on any of its loopback interface as its router ID. If no loopback
interface is present, it uses the largest IP address on any of its active physical interfaces as its router ID. If a router ID is reconfigured
on an OSPF router, the OSPF process must be reset to apply the new router ID.

NEIGHBOUR DISCOVERY
1. In OSPF, interconnected routers exchange Hello packets to discover neighbors and establish neighbor relationships.
2. This is the preparation for synchronizing reachability information following up.
3. When two OSPF routers sharing a common data link successfully negotiate certain parameters, the neighbor relationship
between them is established.
4. After a neighbor relationship is established, routers periodically exchange Hello packets to maintain the neighbor
relationship.
5. If a router does not receive any Hello packet from its neighbor within a specified period, this router terminates the OSPF
neighbor relationship with this neighbor.
NEIGHBOUR DISCOVERY PACKETS ARE 4 WAY;
 down
 down>init
 init>2-way
 2-way
Description of neighbor states:
Down: This is the initial state of a neighbor relationship. It indicates that there has been no information received from the
neighbor. Init: This state occurs when a router has received a Hello packet from its neighbor but its router ID is not in the
neighbor list contained in the received Hello packet. This means that bidirectional communication with the neighbor has not yet
been established. 2-Way: In this state, a router finds that its router ID is in the Hello packet from a neighbor. Bidirectional
communication with the neighbor is then established.