第3课网络逻辑设计.ppt

* * * * Purpose: This figure introduces the distance vector routing algorithm, the first of the classes of routing protocols, and outlines how it operates. Emphasize: Distance vector algorithms do not allow a router to know the exact topology of an internetwork. This information is somewhat analogous to the information found on signs at a highway intersection. A sign points toward a road leading away from the intersection and indicates the distance to the destination. Further down the highway, another sign also points toward the destination, but now the distance to the destination is shorter. So long as each successive point on the path shows that the distance to the destination is successively shorter, the traffic is following the best path. * Layer 1 of 3: Purpose: This figure continues the concept of how a router using a distance vector protocol generally discovers the best path to destinations from each router neighbor. Emphasize: Layer 1 shows the topology consisting of four networks and three routers. Routing tables inside each router begin with entries for the 0 distance to directly connected networks. * Layer 1 of 3: Emphasize: Layer 2 adds routing entries received some time later about noncontiguous networks that have distances of 1 from the given routers. * Layer 1 of 3: Emphasize: Layer 3 adds the final entries received some time later that have distances of 2 from routers A and C. * Layer 1 of 3: Purpose: This figure continues the concept of how a router using a distance vector protocol generally performs its routing information update process when the network topology changes. Emphasize: This layer shows the bullet point, the router on the right, and, on the right, a topology change; routing tables will need updating to reflect this topology change. * Layer 2 of 3: Emphasize: Layer 2 adds the updated routing table that router A sends out after it processes the topology change. * Layer 3 of 3: Layer 3 adds router B, which receives the upda