Link-state routing protocol: Difference between revisions

Revision as of 06:50, 13 August 2004

Revision as of 10:40, 23 August 2004

Line 6:

#The neighbor information is gathered continuously.

#The neighbor information list is then broadcasted to every router that can answer to this protocol, a process known as [[flooding]], which means that it sends the information to all of its neighbors who in turn send it to all of their neighbors and so on. Soon, all routers on the network have this information.

#The neighbor information is flooded whenever there is a (routing-significant) change in the network.

#As every router knows everything about the network by structuring the information from other routers, it can calculate the best path to any [[Server|host]] on any destination network by using [[Dijkstra's algorithm]].