what is the main features of link state routing protocols?
- 1 Answers
- 4518 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
Can you explain PPP packet format?
How many types of memories are used in cisco router?
Explain how many tables are in ospf protocol?
Differentiate full-duplex from half-duplex.
What is the different between console port and auxiliary port?
How many types of ips?
What is a Frame Relay?
What are 10baset ethernet lans?
How many (minimum and maximum) ports are present in a router?
What is osi?
What are the disadvantages of symmetric algorithms?
What is the terminal emulation, in which layer it comes?
What is the checksum?
in stead of 0.0.0.0 wild card mask what u can write after ip?
State the difference between dynamic IP and static IP addressing?
