Semester 2 Chapter 4 Study Guide

Semester 2 Chapter - SEMESTER 2 Chapter 4 Distance Vector Routing Protocols V 4.0 4.1.1 What are the three distance vector routing protocols What

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
SEMESTER 2 Chapter 4 Distance Vector Routing Protocols V 4.0 4.1.1 What are the three distance vector routing protocols? RIP, IGRP, and EIGRP What are the key characteristics of RIP? Hop count is used as the metric for path selection. If the hop count for a network is greater than 15, RIP cannot supply a route to that network. Routing updates are broadcast or multicast every 30 seconds, by default. What are the key characteristics of IGRP? Bandwidth, delay, load and reliability are used to create a composite metric. Routing updates are broadcast every 90 seconds, by default. IGRP is the predecessor of EIGRP and is now obsolete. What are the key characteristics of EIGRP? It can perform unequal cost load balancing. It uses Diffusing Update Algorithm (DUAL) to calculate the shortest path. There are no periodic updates as with RIP and IGRP. Routing updates are sent only when there is a change in the topology. 4.1.2 How are distance vector routes advertised? As the name implies, distance vector means that routes are advertised as vectors of distance and direction. Does a router in a distance vector network have knowledge of the entire path to a destination network? A router using a distance vector routing protocol does not have the knowledge of the entire path to a destination network. What are the 2 things a distance vector router knows? The direction or interface in which packets should be forwarded and The distance or how far it is to the destination network 4.1.2.2 What are the two reasons sending an entire routing table in an update inefficient? This method is inefficient because the updates not only consume bandwidth but also consume router CPU resources to process the updates. What is the periodic update time for RIP? 30 seconds for RIP What is the periodic update time for IGRP? 90 seconds for IGRP What is the address for broadcast updates? 255.255.255.255 4.1.3 What is the algorithm used for? The algorithm is used to calculate the best paths and then send that information to the neighbors. What processes does the routing protocol define? Mechanism for sending and receiving routing information. Mechanism for calculating the best paths and installing routes in the routing table. Mechanism for detecting and reacting to topology changes.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
4.1.4 Define 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. Define Scalability. Scalability defines how large a network can become based on the routing protocol that is deployed. The larger the network is, the more scalable the routing protocol needs to be. Define Classless (Use of VLSM) or Classful. Classless routing protocols include the subnet mask in the updates. This feature supports the use of Variable Length Subnet Masking (VLSM) and better route summarization. Classful routing protocols do not include the subnet mask and cannot support VLSM. Define Resource Usage.
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 03/06/2011 for the course BUSN 115 taught by Professor Jack during the Winter '10 term at DeVry Arlington.

Page1 / 6

Semester 2 Chapter - SEMESTER 2 Chapter 4 Distance Vector Routing Protocols V 4.0 4.1.1 What are the three distance vector routing protocols What

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online