what is the main features of link state routing protocols?
- 1 Answers
- 4502 Views
- Wipro, I also Faced
- E-Mail Answers
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
What does routing mean?
Why is network segmentation a good idea when managing a large network?
What causes a triggered update to reset the router hold-down timer?
What is encapsulation and de-encapsulation?
hi friend i am sending some interview question which is asked from me at volvo hope this will help you of all 1 what is mpls al question is posted by jitendera kumar sinha
What is default size of hello packets in ospf?
What do you understand by redundancy?
Explain the difference between half-duplex and full-duplex?
What is name of ospf algo?
Explian what is a node?
How does Hold-downs work?
How many ways are there to implement VPN architecture?
Explain what is route poisoning?
Explain how many broadcast domains are in switch?
Can you explain in a generic manner the packet of IPSec?
