Content deleted Content added
m neigbors->neighbors |
mNo edit summary |
||
Line 9:
#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 [[host]] on any destination network by using [[Dijkstra's algorithm]].
==Examples of Link-State Protocols==
*[[Routing Information Protocol]] (or RIP) - Versions one and two.
*[[Interior Gateway Routing Protocol]] (or IGRP) - A [[Cisco]] proprietary routing protocol.
|