Chapter 4a - Distance Vector Routing CCNA Exploration...

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

View Full Document Right Arrow Icon
1 7 Oct 2009 Distance Vector Routing CCNA Exploration Semester 2 Chapter 4
Background image of page 1

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

View Full DocumentRight Arrow Icon
2 7 Oct 2009 Topics Characteristics of distance vector routing protocols Distance vector routing protocols in use today How they discover routes How they maintain routing tables Routing loops
Background image of page 2
3 7 Oct 2009 RIP v1 RIP v2 IGRP EIGRP Routing protocols Interior Exterior Distance vector Link state OSPF IS-IS EGP BGP
Background image of page 3

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

View Full DocumentRight Arrow Icon
4 7 Oct 2009 Distance vector knowledge A distance vector protocol learns: The distance to a network, measured in hops or in some other way The direction of the network: which port should be used to reach it It puts the routes in the routing table It does not know any more details of the route or the other routers along the way
Background image of page 4
5 7 Oct 2009 Distance vector Network 192.168.48.0 is 3 hops away using port fa0/0 Network 192.168.22.0 is 2 hops away using port fa0/1
Background image of page 5

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

View Full DocumentRight Arrow Icon
6 7 Oct 2009 Link state knowledge A link state routing protocol finds out about all the routers in the system and the networks they link to. It builds up a complete picture of the topology It can then work out the best path to any network It puts these best paths in the routing table
Background image of page 6
7 7 Oct 2009 Link state I know all the routers and paths in this system of networks.
Background image of page 7

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

View Full DocumentRight Arrow Icon
8 7 Oct 2009 Metrics RIP v1 and 2 hop count, maximum 15 IGRP and EIGRP bandwidth, delay, load, reliability
Background image of page 8
9 7 Oct 2009 Distance vector Exchange complete routing tables with immediate neighbours Do this at regular intervals Adjust the metric, e.g. add 1 to the hop count, or add number based on bandwidth and delay of link.
Background image of page 9

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

View Full DocumentRight Arrow Icon
10 7 Oct 2009 Adjust the metric 192.168.13.0 is 2 hops away 192.168.13.0 is 3 hops away Send update
Background image of page 10
11 7 Oct 2009 Sending updates RIP v1 Whole routing table Broadcast every 30 sec RIP v2 Whole routing table Multicast every 30 sec IGRP Whole routing table Broadcast every 90 sec EIGRP Initial learning process then small updates when topology changes
Background image of page 11

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

View Full DocumentRight Arrow Icon
12 7 Oct 2009 RIP v1 RIP v2 IGRP Routing protocols Distance vector Link state OSPF IS-IS EIGRP Slow to converge Easy to configure Small networks Little use of resources Fast to converge Harder to configure Large networks Much use of resources
Background image of page 12
13
Background image of page 13

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

View Full DocumentRight Arrow Icon
Image of page 14
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 01/12/2012 for the course NETWORKING 2083 taught by Professor Cathymarak during the Winter '12 term at NorthWest Arkansas Community College.

Page1 / 40

Chapter 4a - Distance Vector Routing CCNA Exploration...

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

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