Content deleted Content added
Line 58:
The link-state message giving information about the neighbours is recomputed, and then flooded throughout the network, whenever there is a change in the connectivity between the node and its neighbours, e.g. when a link fails. Any such change will be detected by the reachability protocol which each node runs with its neighbours.
NOEL gILLEN DID NOT READ HIS NOTES==Detailed description: Calculating the routing table==
As initially mentioned, the second main stage in the link-state algorithm is to produce routing tables, by inspecting the maps. This is again done with several steps.
'''Bold text'''''Italic text''[[Link title]]
== Headline text ==
[http://www.example.com link title][[Media:Example.ogg]]===Calculating the shortest paths===
| |||