Routing Information Protocol (RIP) Routing Information Protocol (RIP) is a standards-based, distance-vector, interior gateway protocol (IGP) used by routers.

Slides:



Advertisements
Similar presentations
The subnet /28 has been selected to be further subnetted to support point-to-point serial links. What is the maximum number of serial links.
Advertisements

RIP V2 W.lilakiatsakun.  RFC 2453 (obsoletes –RFC 1723 /1388)  Extension of RIP v1 (Classful routing protocol)  Classless routing protocol –VLSM is.
RIP V2 CCNP S1(5), Chapter 4.
Copyright 2008 Kenneth M. Chipps Ph.D. Cisco CCNA Exploration CCNA 2 Routing Protocols and Concepts Chapter 4 Distance Vector Routing Protocols.
IP Routing.
SYPCNSA Department2007 Summer Youth Program: Internal Protocols: RIP & IGRP.
RIP – Routing Information Protocol Syeda Momina Tabish MIT - 7.
CSEE W4140 Networking Laboratory Lecture 4: IP Routing (RIP) Jong Yul Kim
CCNA 2 v3.1 Module 7.
RD-CSY /09 Distance Vector Routing Protocols.
© 2006 Cisco Systems, Inc. All rights reserved. ICND v2.3—3-1 Determining IP Routes Enabling RIP.
RIP. A PPROACHES TO S HORTEST P ATH R OUTING There are two basic routing algorithms found on the Internet. 1. Distance Vector Routing Each node knows.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public ITE PC v4.0 Chapter 1 1 Distance Vector Routing Protocols Routing Protocols and Concepts –
Distance Vector Routing Protocols Distance Vector Routing.
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
© 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.
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.
Routing/Routed Protocols. Remember: A Routed Protocol – defines logical addressing. Most notable example on the test – IP A Routing Protocol – fills the.
Advantages of Dynamic Routing over Static Routing : Advertise only the directly connected networks. Updates the topology changes dynamically. Administrative.
RIP, IGRP, & EIGRP Characteristics and Design. 2 Chapter Topics  RIPv1  RIPv2  IGRP  EIGRP.
CN2668 Routers and Switches Kemtis Kunanuraksapong MSIS with Distinction MCTS, MCDST, MCP, A+
Sybex CCENT Chapter 8: IP Routing Instructor & Todd Lammle.
1 Chapter Overview Routing Principles Building Routing Tables.
Sybex CCNA Chapter 6: IP Routing Instructor & Todd Lammle.
Routing -2 Dynamic Routing
Review Routing fundamental W.lilakiatsakun. Review Routing Fundamental VLSM VLSM Route Summarization Route Summarization Static & Dynamic Routing Static.
1 3-Oct-15 Distance Vector Routing CCNA Exploration Semester 2 Chapter 4.
1 Network Layer Lecture 14 Imran Ahmed University of Management & Technology.
© Wiley Inc All Rights Reserved. CCNA: Cisco Certified Network Associate Study Guide CHAPTER 5: IP Routing.
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.
Chapter 6 IP Routing. Basic information When you configure interface of a node with IP and mask, the node will know the network corresponding to that.
CCNA 2 Week 7 Distance Vector Routing. Copyright © 2005 University of Bolton Topics Distance Vector Protocol Issues RIP IGRP.
TCOM 509 – Internet Protocols (TCP/IP) Lecture 06_a Routing Protocols: RIP, OSPF, BGP Instructor: Dr. Li-Chuan Chen Date: 10/06/2003 Based in part upon.
1 © 2004, Cisco Systems, Inc. All rights reserved. CCNA 2 v3.1 Module 7 Distance Vector Routing Protocols.
Lecture #2 VLSM Asst.Prof. Dr.Anan Phonphoem Department of Computer Engineering, Faculty of Engineering, Kasetsart University, Bangkok, Thailand.
Distance Vector Routing Protocols Dynamic Routing.
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
TCOM 515 Lecture 2. Lecture 2 Objectives Dynamic Routing Distance Vectore Routing Link State Routing Interior vs Exterior RIP - Routing Information Protocol.
Chabot College ELEC Routing Loops.
CCNA2 v3 Module 7 v3 CCNA 2 Module 7 JEOPARDY K. Martin.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 Routing Protocols and Concepts Dr. Muazzam A. Khan.
RIP Routing Protocol. 2 Routing Recall: There are two parts to routing IP packets: 1. How to pass a packet from an input interface to the output interface.
1. 2  An autonomous system is a region of the Internet that is administered by a single entity.  Examples of autonomous regions are:  UVA’s campus.
1 © 2004, Cisco Systems, Inc. All rights reserved. Introduction to Classless Routing.
RIP v1– Routing Information Protocol RIP Versions –RIP v1 (original version, Doyle ch 5) –RIP v2 (improved version, Doyle ch 7) Simple distance-vector.
RIP.
Routing Protocols and Concepts
Distance Vector Routing Protocols
Dalya A.Alrahim Aljubori
Routing Information Protocol (RIP)
CCNA 2 v3.1 Module 7 Distance Vector Routing Protocols
Dynamic Routing Protocols part2
Routing Protocols and Concepts – Chapter 5
Distance Vector Routing Protocols
CCNA 3 v3 JEOPARDY Module 1 CCNA3 v3 Module 1 K. Martin.
Routing Protocols and Concepts – Chapter 5
CIT 384: Network Administration
Routing Protocols and Concepts – Chapter 5
Distance Vector Routing Protocols
Routing Protocols and Concepts – Chapter 5
Distance Vector Routing
Presentation transcript:

Routing Information Protocol (RIP) Routing Information Protocol (RIP) is a standards-based, distance-vector, interior gateway protocol (IGP) used by routers to exchange routing information. RIP uses hop count to determine the best path between two locations. Hop count is the number of routers the packet must go through till it reaches the destination network. The maximum allowable number of hops a packet can traverse in an IP network implementing RIP is 15 hops.

RIP (Continued) In a RIP network, each router broadcasts its entire RIP table to its neighboring routers every 30 seconds. When a router receives a neighbor's RIP table, it uses the information provided to update its own routing table and then sends the updated table to its neighbors.

Differences between RIPv1 or RIPv2 RIPv1 A classful protocol, broadcasts updates every 30 seconds, hold-down period 180 seconds. Hop count is metric (Maximum 15). RIP supports up to six equal-cost paths to a single destination, where all six paths can be placed in the routing table and the router can load-balance across them. The default is actually four paths, but this can be increased up to a maximum of six. Remember that an equal-cost path is where the hop count value is the same. RIP will not load-balance across unequal-cost paths

Differences between RIPv1 or RIPv2 (CONTD.) RIPv2 RIPv2 uses multicasts, version 1 use broadcasts, RIPv2 supports triggered updates—when a change occurs, a RIPv2 router will immediately propagate its routing information to its connected neighbors. RIPv2 is a classless protocol. RIPv2 supports variable-length subnet masking (VLSM) RIPv2 supports authentication. You can restrict what routers you want to participate in RIPv2. This is accomplished using a hashed password value.

RIP Timers RIP uses four different kinds of timers to regulate its performance: Route update timer Sets the interval (typically 30 seconds) between periodic routing updates in which the router sends a complete copy of its routing table out to all neighbors.

RIP Timers (CONTINUED) Route invalid timer Determines the length of time that must elapse (180 seconds) before a router determines that a route has become invalid. It will come to this conclusion if it hasn’t heard any updates about a particular route for that period. When that happens, the router will send out updates to all its neighbors letting them know that the route is invalid.

RIP Timers (CONTINUED) Holddown timer This sets the amount of time during which routing information is suppressed. Routes will enter into the holddown state when an update packet is received that indicated the route is unreachable. This continues either until an update packet is received with a better metric or until the holddown timer expires. The default is 180 seconds.

RIP Timers (CONTINUED) Route flush timer Sets the time between a route becoming invalid and its removal from the routing table (240 seconds). Before it's removed from the table, the router notifies its neighbors of that route's impending failure. The value of the route invalid timer must be less than that of the route flush timer. This gives the router enough time to tell its neighbors about the invalid route before the local routing table is updated.

Class Activity 2.0