Distance Vector Routing

Slides:



Advertisements
Similar presentations
Distance Vector Routing Protocols
Advertisements

© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public ITE PC v4.0 Chapter 1 1 Distance Vector Routing Protocols Routing Protocols and Concepts –
RIP2 CCNA Exploration Semester 2 Chapter 7
RIP V2 CCNP S1(5), Chapter 4.
Cisco S3 C5 Routing Protocols. Network Design Characteristics Reliable – provides mechanisms for error detection and correction Connectivity – incorporate.
Copyright 2008 Kenneth M. Chipps Ph.D. Cisco CCNA Exploration CCNA 2 Routing Protocols and Concepts Chapter 4 Distance Vector Routing Protocols.
Copyright 2002 Year 2 - Chapter 5/Cisco 3 - Module 5 Routing Protocols: IGRP By Carl Marandola.
Chapter 5 IP Routing Routing Sending packets through network from one device to another What must routers know? – Destination address – Neighboring routers.
CCNA 2 v3.1 Module 7.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public ITE PC v4.0 Chapter 1 1 Distance Vector Routing Protocols Routing Protocols and Concepts –
Switching and Routing Technique
Distance Vector Routing Protocols Distance Vector Routing.
Distance Vector Protocols
Distance Vector Routing Protocols W.lilakiatsakun.
Dynamic Routing Protocols  Function(s) of Dynamic Routing Protocols: – Dynamically share information between routers (Discover remote networks). – Automatically.
Distance Vector Routing Protocols
1 13-Sep-15 S Ward Abingdon and Witney College Routing loops And other problems CCNA 2 Chapter 4.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public ITE PC v4.0 Chapter 1 1 Distance Vector Routing Protocols Routing Protocols and Concepts –
M. Menelaou CCNA2 DYNAMIC ROUTING. M. Menelaou DYNAMIC ROUTING Dynamic routing protocols can help simplify the life of a network administrator Routing.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public ITE PC v4.0 Chapter 1 1 Distance Vector Routing Protocols Routing Protocols and Concepts –
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 2 Module 7 Distance Vector Routing Protocols.
Slide /2009COMM3380 Routing Algorithms Distance Vector Routing Each node knows the distance (=cost) to its directly connected neighbors A node sends.
1 © 2004, Cisco Systems, Inc. All rights reserved. CCNA 2 v3.1 Module 7 Distance Vector Routing Protocols.
Routing/Routed Protocols. Remember: A Routed Protocol – defines logical addressing. Most notable example on the test – IP A Routing Protocol – fills the.
1 Routing Protocols and Configuration Instructor: Te-Lung Liu Program Associate Researcher NCHC, South Region Office.
Sybex CCNA Chapter 6: IP Routing Instructor & Todd Lammle.
1 3-Oct-15 Distance Vector Routing CCNA Exploration Semester 2 Chapter 4.
IGRP ► IGRP is a distance vector routing protocol developed by Cisco. ► IGRP sends routing updates at 90 second intervals. ► These updates advertise all.
1 Network Layer Lecture 14 Imran Ahmed University of Management & Technology.
Networks and Protocols CE Week 8a. Dynamic / Distance Vector Routing.
Chapter 4 Distance Vector Routing Protocols CIS 82 Routing Protocols and Concepts Rick Graziani Cabrillo College Last Updated: 3/9/2009.
1 Network Layer Lecture 13 Imran Ahmed University of Management & Technology.
RIP2 (Routing Information Protocol) Team Agile. Routing Protocols Link State – OSPF – ISIS Distance vector – RIP (version 1 and 2) – IGRP (Cisco Proprietary)
© 2007 Cisco Systems, Inc. All rights reserved.ICND1 v1.0—-5-1 WAN Connections Routing & Enabling RIP.
Distance Vector Routing Protocols Routing Protocols and Concepts Lecture Week 4.
CCNA 2 Week 7 Distance Vector Routing. Copyright © 2005 University of Bolton Topics Distance Vector Protocol Issues RIP IGRP.
1 © 2004, Cisco Systems, Inc. All rights reserved. CCNA 2 v3.1 Module 7 Distance Vector Routing Protocols.
1 1-Dec-15 S Ward Abingdon and Witney College Distance Vector Routing CCNA Exploration Semester 2 Chapter 4.
Chapter 4 Distance Vector Routing Protocols
Chabot College ELEC Routing Loops.
1 7-Jan-16 S Ward Abingdon and Witney College Dynamic Routing CCNA Exploration Semester 2 Chapter 3.
 RIP — A distance vector interior routing protocol  IGRP — The Cisco distance vector interior routing protocol (not used nowadays)  OSPF — A link-state.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 Routing Protocols and Concepts Dr. Muazzam A. Khan.
1 16-Mar-16 S Ward Abingdon and Witney College RIP v1 Routing CCNA Exploration Semester 2 Chapter 5.
LOGO Dynamic Routing 7/2/20161Jaringan Komputer_D3 TT.
Year 2 - Chapter 5/Cisco 3 - Module 5 Routing Protocols: IGRP.
Lec4: Introduction to Dynamic Routing Protocol
Introduction to Dynamic Routing Protocol
Routing Protocols and Concepts
Distance Vector Routing Protocols
Dynamic Routing Protocols part2
Routing Loops.
IGRP IGRP is a distance vector routing protocol developed by Cisco.
Routing/Routed Protocols
CCNA 2 v3.1 Module 7 Distance Vector Routing Protocols
Routing & Enabling RIP WAN Connections.
IS3120 Network Communications Infrastructure
Introduction to Dynamic Routing Protocol
Chapter 5: Dynamic Routing
Dynamic Routing Protocols part2
Distance Vector Routing Protocols
Introduction to Dynamic Routing Protocol
Distance Vector Routing Protocols
After 3.2 Revised
CIT 384: Network Administration
CCNA2 chap4 routing loops.ppt And other problems CCNA 2 Chapter 4
Distance Vector Routing Protocols
Distance Vector Routing Protocols
RIP1.ppt CCNA Exploration Semester 2 Chapter 5
Presentation transcript:

Distance Vector Routing 16/05/2019 Distance Vector Routing CCNA Exploration Semester 2 Chapter 4 16-May-19 S Ward Abingdon and Witney College S Ward Abingdon and Witney College

S Ward Abingdon and Witney College 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 16-May-19 S Ward Abingdon and Witney College

S Ward Abingdon and Witney College Routing protocols Interior Exterior Distance vector Link state RIP v1 RIP v2 IGRP EIGRP OSPF IS-IS EGP BGP 16-May-19 S Ward Abingdon and Witney College

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 16-May-19 S Ward Abingdon and Witney College

Distance vector Network 192.168.48.0 is 3 hops away using port fa0/0 16-May-19 S Ward Abingdon and Witney College

S Ward Abingdon and Witney College 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 16-May-19 S Ward Abingdon and Witney College

Link state I know all the routers and paths in this system of networks. 16-May-19 S Ward Abingdon and Witney College

S Ward Abingdon and Witney College Metrics RIP v1 and 2 hop count, maximum 15 IGRP and EIGRP bandwidth, delay, load, reliability 16-May-19 S Ward Abingdon and Witney College

S Ward Abingdon and Witney College 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. 16-May-19 S Ward Abingdon and Witney College

S Ward Abingdon and Witney College Adjust the metric 192.168.13.0 is 2 hops away 192.168.13.0 is 3 hops away Send update 16-May-19 S Ward Abingdon and Witney College

S Ward Abingdon and Witney College 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 16-May-19 S Ward Abingdon and Witney College

S Ward Abingdon and Witney College Routing protocols Distance vector Link state RIP v1 RIP v2 IGRP 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 16-May-19 S Ward Abingdon and Witney College

Distance vector updates 10.4.0.0 10.1.0.0 10.2.0.0 10.3.0.0 Routers start up. R1 adds directly connected networks to table. Network Interface Hop 10.1.0.0 Fa0/0 10.2.0.0 S0/0/0 16-May-19 S Ward Abingdon and Witney College

Distance vector updates 10.4.0.0 10.1.0.0 10.2.0.0 10.3.0.0 Exchange of routing table information. 16-May-19 S Ward Abingdon and Witney College

Distance vector updates 10.4.0.0 10.1.0.0 10.2.0.0 10.3.0.0 R1 has learned about 10.3.0.0 from R2. It does not know about 10.4.0.0 Network Interface Hop 10.1.0.0 Fa0/0 10.2.0.0 S0/0/0 10.3.0.0 1 16-May-19 S Ward Abingdon and Witney College

Distance vector updates 10.4.0.0 10.1.0.0 10.2.0.0 10.3.0.0 Exchange of routing table information. 16-May-19 S Ward Abingdon and Witney College

Distance vector updates 10.4.0.0 10.1.0.0 10.2.0.0 10.3.0.0 R1 has learned about 10.4.0.0 from R2. R2 previously learned about it from R3. Network Interface Hop 10.1.0.0 Fa0/0 10.2.0.0 S0/0/0 10.3.0.0 1 10.4.0.0 2 16-May-19 S Ward Abingdon and Witney College

S Ward Abingdon and Witney College Update timer R 10.3.0.0 [120/1] via 10.2.0.2, 00:00:04, Serial0/0 Show ip route gives number of seconds since last update. Routing Protocol is “rip” Sending updates every 30 seconds, next due in 3 seconds Show ip protocols says when next update is due. Update timer default is 30 seconds 16-May-19 S Ward Abingdon and Witney College

S Ward Abingdon and Witney College RIP timers Routing Protocol is “rip” Sending updates every 30 seconds, next due in 26 seconds Invalid after 180 seconds, hold down 180, flushed after 240 Routing table contains two RIP routes R 10.3.0.0 [120/1] via 10.2.0.2, 00:00:04, Serial0/0 R 10.4.0.0 [120/2] via 10.2.0.2, 00:00:04, Serial0/0 16-May-19 S Ward Abingdon and Witney College

S Ward Abingdon and Witney College RIP timers Routing Protocol is “rip” Sending updates every 30 seconds, next due in 30 seconds Invalid after 180 seconds, hold down 180, flushed after 240 30 seconds – update Route to 10.3.0.0 refreshed Route to 10.4.0.0 not included R 10.3.0.0 [120/1] via 10.2.0.2, 00:00:00, Serial0/0 R 10.4.0.0 [120/2] via 10.2.0.2, 00:00:30, Serial0/0 16-May-19 S Ward Abingdon and Witney College

S Ward Abingdon and Witney College RIP timers Routing Protocol is “rip” Sending updates every 30 seconds, next due in 30 seconds Invalid after 180 seconds, hold down 180, flushed after 240 60 seconds – update Route to 10.3.0.0 refreshed Route to 10.4.0.0 not included R 10.3.0.0 [120/1] via 10.2.0.2, 00:00:00, Serial0/0 R 10.4.0.0 [120/2] via 10.2.0.2, 00:01:00, Serial0/0 16-May-19 S Ward Abingdon and Witney College

S Ward Abingdon and Witney College RIP timers Routing Protocol is “rip” Sending updates every 30 seconds, next due in 30 seconds Invalid after 180 seconds, hold down 180, flushed after 240 90 seconds – update Route to 10.3.0.0 refreshed Route to 10.4.0.0 not included R 10.3.0.0 [120/1] via 10.2.0.2, 00:00:00, Serial0/0 R 10.4.0.0 [120/2] via 10.2.0.2, 00:01:30, Serial0/0 16-May-19 S Ward Abingdon and Witney College

S Ward Abingdon and Witney College RIP timers Routing Protocol is “rip” Sending updates every 30 seconds, next due in 30 seconds Invalid after 180 seconds, hold down 180, flushed after 240 120 seconds – update Route to 10.3.0.0 refreshed Route to 10.4.0.0 not included R 10.3.0.0 [120/1] via 10.2.0.2, 00:00:00, Serial0/0 R 10.4.0.0 [120/2] via 10.2.0.2, 00:02:00, Serial0/0 16-May-19 S Ward Abingdon and Witney College

S Ward Abingdon and Witney College RIP timers Routing Protocol is “rip” Sending updates every 30 seconds, next due in 30 seconds Invalid after 180 seconds, hold down 180, flushed after 240 150 seconds – update Route to 10.3.0.0 refreshed Route to 10.4.0.0 not included R 10.3.0.0 [120/1] via 10.2.0.2, 00:00:00, Serial0/0 R 10.4.0.0 [120/2] via 10.2.0.2, 00:02:30, Serial0/0 16-May-19 S Ward Abingdon and Witney College

S Ward Abingdon and Witney College RIP timers Routing Protocol is “rip” Sending updates every 30 seconds, next due in 30 seconds Invalid after 180 seconds, hold down 180, flushed after 240 180 seconds – update Route to 10.3.0.0 refreshed Route to 10.4.0.0 not included R 10.3.0.0 [120/1] via 10.2.0.2, 00:00:00, Serial0/0 R 10.4.0.0 [120/16] via 10.2.0.2, 00:03:00, Serial0/0 16-May-19 S Ward Abingdon and Witney College

S Ward Abingdon and Witney College RIP timers Routing Protocol is “rip” Sending updates every 30 seconds, next due in 30 seconds Invalid after 180 seconds, hold down 180, flushed after 240 210 seconds – update Route to 10.3.0.0 refreshed Route to 10.4.0.0 not included R 10.3.0.0 [120/1] via 10.2.0.2, 00:00:00, Serial0/0 R 10.4.0.0 [120/16] via 10.2.0.2, 00:03:30, Serial0/0 16-May-19 S Ward Abingdon and Witney College

S Ward Abingdon and Witney College RIP timers Routing Protocol is “rip” Sending updates every 30 seconds, next due in 30 seconds Invalid after 180 seconds, hold down 180, flushed after 240 240 seconds – update Route to 10.3.0.0 refreshed Route to 10.4.0.0 not included R 10.3.0.0 [120/1] via 10.2.0.2, 00:00:00, Serial0/0 Route has been removed. 16-May-19 S Ward Abingdon and Witney College

S Ward Abingdon and Witney College RIP_JITTER RIP updates can become synchronised This is a problem if routers are linked by hubs because the updates will collide RIP_JITTER is a random variable that makes updates vary a little from the default 30 seconds 16-May-19 S Ward Abingdon and Witney College

S Ward Abingdon and Witney College Triggered updates These are to speed up convergence Interface goes up/down, route added/removed Router detects change, sends update to neighbour at once without waiting for timer Neighbour passes on update at once. 16-May-19 S Ward Abingdon and Witney College

S Ward Abingdon and Witney College EIGRP Does not send regular updates Does not send its whole routing table Sends only information about changes Sends only to routers that need the information Non-periodic, partial, bounded. 16-May-19 S Ward Abingdon and Witney College

S Ward Abingdon and Witney College Routing loop A packet is sent from router to router in a loop until it is eventually dropped when its TTL field drops to 0 Caused by incorrect or out of date information in routing tables Very bad for network – uses up bandwidth and processing power in routers 16-May-19 S Ward Abingdon and Witney College

Avoiding routing loops Defining a maximum metric to prevent count to infinity Holddown timers Split horizon Route poisoning or poison reverse Triggered updates 16-May-19 S Ward Abingdon and Witney College

S Ward Abingdon and Witney College Maximum metric Routers exchanging wrong information can report higher and higher values of the metric. RIP sets a maximum metric. The hop count can go up to 15. If it reaches 16 then the route is regarded as unreachable. 16-May-19 S Ward Abingdon and Witney College

S Ward Abingdon and Witney College Holddown timers Router receives update saying that a network is down. Router marks the network as possibly down and starts holddown timer. Update with a better metric for that network arrives: network is reinstated and holddown timer removed. Update with the same or worse metric for that network arrives: update is ignored. Timer runs out : network removed from table. Packets still forwarded to network while timer runs. 16-May-19 S Ward Abingdon and Witney College

S Ward Abingdon and Witney College Split horizon Route to 10.1.1.0 in 4 hops Route to 10.1.1.0 in 3 hops Router receives information about a route through an interface. It will not send out information about the same route through that interface. 16-May-19 S Ward Abingdon and Witney College

S Ward Abingdon and Witney College Route poisoning A router detects that a route has gone down. It marks that route as unreachable in its routing table. (16 hops for RIP) It sends out updates that show the route as unreachable. Neighbour routers pass on these “poison” updates. 16-May-19 S Ward Abingdon and Witney College

S Ward Abingdon and Witney College Poison reverse This is an exception to split horizon. If a router receives an update marking a route as unreachable then it will send this information back to the router that sent it. 16-May-19 S Ward Abingdon and Witney College

S Ward Abingdon and Witney College RIP v1 and RIP v2 RIP v1 Classful, does not send subnet mask in updates so does not support VLSM Sends updates as broadcasts No authentication No manual route summarisation RIP v2 Classless, includes the subnet mask in routing updates, so supports VLSM. Sends updates as multicasts Authentication for security Supports manual route summarization. 16-May-19 S Ward Abingdon and Witney College

S Ward Abingdon and Witney College RIP v2 or EIGRP? RIP runs on any make of router, EIGRP only on Cisco routers. EIGRP is suitable for large networks EIGRP uses a more efficient metric and may choose faster routes. EIGRP converges faster than RIP EIGRP uses less bandwidth but it needs more processing power and RAM RIP is simpler to configure 16-May-19 S Ward Abingdon and Witney College

S Ward Abingdon and Witney College The End 16-May-19 S Ward Abingdon and Witney College