0
Want this question answered?
Be notified when an answer is posted
Add your answer:
Earn +20 pts
What is the main difference between OSPF and RIP?
Both uses Distance vector algorithm...... . updates the routing table for every 30 seconds. and in OSPF requires hoping reneval of routing table
Which of is predetermined by an administrator and does not require a routing algorithm?
ospf and static route
What does the Cisco IOS use to calculate the OSPF cost to a destination network?
OSPF stands for open shortest path first. OSPF is an exterior routing protocol. OSPF uses Path vector routing algorithm.
What is Dijkstra's algorithm?
Dijkstra's algorithm is used by the OSPF and the IS-IS routing protocols. The last three letters in OSPF (SPF) mean "shortest path first", which is an alternative name for Dijkstra's algorithm.
Ccna2 version 4.0 chapter 11?
Router R1 is participating in the OSPF routing protocol as well as the EIGRP routing protocol. If R1 learns of network 192.168.10.0/24 from both the OSPF and internal EIGRP routing protocols, how will the route appear in the routing table of R1?
What type of routing protocol is OSPF?
OSPF is short form of open shortest path first. OSPF is based on linked state routing.
Which is classified as a link-state routing protocol?
There are actually two OSPF and IS-IS
Which two of these are routing protocol?
Rip ospf
What type of protocol is OSPF?
OSPF is short form of open shortest path first. OSPF is based on linked state routing.
Is OSPF link state or distance vector or path vector protocol?
OSPF is a link-state routing protocol.
What are the two characteristics of OSPF?
The first is that the protocol is open, which means that its specification is in the public domain. The OSPF specification is published as Request For Comments (RFC) 1247. The second principal characteristic is that OSPF is based on the SPF algorithm, which sometimes is referred to as the Dijkstra algorithm (Answer is from CCNA 3 guide)
What is the Dijkstra's algorithm?
Dijkstra's algorithm has importance when you are trying to find the shortest path between two points. It's used in the computer networking field where routing protocols, like OSPF, uses it to find the shortest path between routers. http://en.wikipedia.org/wiki/Dijkstra%27s_algorithm
