Does the problem of Count to Infinity exists in Link State also as it exists in Distance Vector?
Count to infinity is a direct result of using a plain scalar quantity (like the routing metric) to make routing decisions. When a link does go down DVP entities will not know which side the current updates are coming from. An LSP on the other hand will rely on the most current link state of all other routers in the subnet. It can build entire spanning trees out of it and therefore will converge very fast. There is no count in LSP and therefore no count-to-infinity.
