Exploration_Routing_Chapter_ 4(bupt).pptVIP

Distance Vector Routing Protocols Routing Protocols and Concepts – Chapter 4 Objectives Identify the characteristics of distance vector routing protocols. Describe the network discovery process of distance vector routing protocols using Routing Information Protocol (RIP). Describe the processes to maintain accurate routing tables used by distance vector routing protocols. Identify the conditions leading to a routing loop and explain the implications for router performance. Recognize that distance vector routing protocols are in use today Context Index 4.1 Introduction to Distance Vector Routing Protocols 4.2 Network Discovery 4.3 Routing Table Maintenance 4.4 Routing Loops 4.5 Distance Vector Routing Protocols Today 4.6 Lab Activities 4.1 Introduction to Distance Vector Routing Protocols 4.1.1 Distance Vector Routing Protocols Examples of Distance Vector routing protocols: Routing Information Protocol (RIP) Interior Gateway Routing Protocol (IGRP) Enhanced Interior Gateway Routing Protocol (EIGRP) 4.1.2 Distance Vector Technology The Meaning of Distance Vector: A router using distance vector routing protocols knows 2 things: Distance to final destination Vector or direction traffic should be directed 4.1.2 Distance Vector Technology Characteristics of Distance Vector routing protocols: Periodic updates Neighbors Broadcast updates Entire routing table is included with routing update 4.1.3 Routing Protocol Algorithm 4.1.4 Routing Protocols Characteristics Criteria used to compare routing protocols includes: - Time to convergence: Time to convergence defines how quickly the routers in the network topology share routing information and reach a state of consistent knowledge. - Scalability: Scalability defines how large a network can become based on the routing protocol that is deployed. - Classless (Use of VLSM) or Classful: Classless routing protocols include the subnet mask in the updates. - Resource usage: Resource usage includes the requirements of