Advanced Computer Networks: Lecture 21. This lecture will cover the following: distance vector routing example; distance vector routing table; count to infinity problem; split horizon; reliable flooding; route calculation: Dijkstra’s shortest path algorithm; . |