what is the main features of link state routing protocols?
Answer Posted / vikramsingh11
Link-state algorithms are also known as Dijkstras algorithm
or as SPF (shortest path first) algorithms.
Link-state routing algorithms maintain a complex database of
topology information.
The distance vector algorithm are also known as Bellman-Ford
algorithms. They have nonspecific information about distant
networks and no knowledge of distant routers.
A link-state routing algorithm maintains full knowledge of
distant routers and how they interconnect. Link-state
routing uses:
Link-state advertisements (LSAs)
A link-state advertisement (LSA) is a small packet of
routing information
that is sent between routers.
Topological database
A topological database is a collection of information
gathered from LSAs.
SPF algorithm
The shortest path first (SPF) algorithm is a calculation
performed on the
database resulting in the SPF tree.
Routing tables – A list of the known paths and interfaces
Is This Answer Correct ? | 1 Yes | 1 No |
Post New Answer View All Answers
Explain what is the default behavior of access-list?
Which protocol supenetting is enable by default?
Mention what are the ranges for the private ips?
What is the working of router?
What do you mean by Port Mirroring?
On which layer does L2F, PPTP and L2TP operate?
What is the difference between named and extended acl?
Default packet size of ipv6?
Tell me which cable called roll-over?
What is mac address size of ipv6?
What is the difference between csma/cd and csma/ca?
What command do we give if router ios is stucked?
How does PPTP encapsulate data?
In port based access-list which command you give instead of ip?
Which ipsec rule is used for the olympia branch and what does it define?