Scribd
Upload
106 views

OSPF

OSPF is an interior gateway routing protocol that uses a link-state algorithm to calculate the shortest path between each node based on the topology of the network. Each router sends information about its own links and the complete routing structure to all other routers. This allows for smaller, more frequent updates that converge quickly to prevent routing loops and other problems, resulting in a stable network, though it requires significant CPU and memory resources. OSPF is defined in RFC1583 and is replacing RIP as the dominant interior gateway protocol on the Internet.

Uploaded by

Hugo Reyes
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
106 views

OSPF

OSPF is an interior gateway routing protocol that uses a link-state algorithm to calculate the shortest path between each node based on the topology of the network. Each router sends information about its own links and the complete routing structure to all other routers. This allows for smaller, more frequent updates that converge quickly to prevent routing loops and other problems, resulting in a stable network, though it requires significant CPU and memory resources. OSPF is defined in RFC1583 and is replacing RIP as the dominant interior gateway protocol on the Internet.

Uploaded by

Hugo Reyes
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

OSPF protocol

Short for Open Shortest Path First, an interior gateway routing


protocol developed for IP networks based on the shortest path first or
link-state algorithm.
Routers use link-state algorithms to send routing information to all nodes
in an internetwork by calculating the shortest path to each node based
on a topography of the Internet constructed by each node. Each router
sends that portion of the routing table (keeps track of routes to
particular network destinations) that describes the state of its own links,
and it also sends the complete routing structure (topography).
The advantage of shortest path first algorithms is that they results in
smaller more frequent updates everywhere. They converge quickly, thus
preventing such problems as routing loops and Count-to-Infinity (when
routers continuously increment the hop count to a particular network).
This makes for a stable network.
The disadvantage of shortest path first algorithms is that they require a
lot of CPU power and memory. In the end, the advantages out weigh the
disadvantages.
OSPF Version 2 is defined in RFC1583. It is rapidly replacing RIP on the
Internet.

You might also like