Objectives After completing this chapter you will be able to: Describe the Routing Information Protocol (RIP version 1 and RIP version 2) Describe Routing.

Slides:



Advertisements
Similar presentations
IP Routing.
Advertisements

RIP V1 W.lilakiatsakun.
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.
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.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 RIP version 1 Routing Protocols and Concepts – Chapter 5.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 RIP version 1 Routing Protocols and Concepts – Chapter 5.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public ITE PC v4.0 Chapter 1 1 RIP version 1 Routing Protocols and Concepts – Chapter 5.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 Introduction to Dynamic Routing Protocol Routing Protocols and Concepts – Chapter.
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization –All routers are identical –Network is flat. Not true in Practice Hierarchical.
Chapter 5 IP Routing Routing Sending packets through network from one device to another What must routers know? – Destination address – Neighboring routers.
RFC 2453 RIP 2 (Routing Information Protocol) Daher Kaiss.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public ITE PC v4.0 Chapter 1 1 RIP version 1&2 Revised by Chakchai So-In, Ph.D.
© 2006 Cisco Systems, Inc. All rights reserved. ICND v2.3—3-1 Determining IP Routes Introducing Distance Vector Routing.
INTRA- AND INTERDOMAIN ROUTING Routing inside an autonomous system is referred to as intradomain routing. Routing between autonomous systems is.
TCP/IP Protocol Suite1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter 11 Unicast Routing Protocols.
ROUTING BASICS. Why are Routers Necessary? One of the key components of the technical infrastructure of the network One of the key components of the technical.
Introduction to Routing and Routing Protocols By Ashar Anwar.
Routing Information Protocol (RIP). Intra-and Interdomain Routing An internet is divided into autonomous systems. An autonomous system (AS) is a group.
Chabot College Chapter 5 – Routing Protocols: IGRP Review Questions Semester IIIELEC Semester III ELEC
Dynamic Routing Protocols  Function(s) of Dynamic Routing Protocols: – Dynamically share information between routers (Discover remote networks). – Automatically.
M. Menelaou CCNA2 DYNAMIC ROUTING. M. Menelaou DYNAMIC ROUTING Dynamic routing protocols can help simplify the life of a network administrator Routing.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Chapter 14 Routing Protocols RIP, OSPF, BGP.
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.
1 Routing Protocols and Configuration Instructor: Te-Lung Liu Program Associate Researcher NCHC, South Region Office.
RIP, IGRP, & EIGRP Characteristics and Design. 2 Chapter Topics  RIPv1  RIPv2  IGRP  EIGRP.
Sybex CCNA Chapter 6: IP Routing Instructor & Todd Lammle.
Introduction to Dynamic Routing Protocol
Code : STM#520-1 Samsung Electronics Co., Ltd. OfficeServ7400 Router Operation Distribution EnglishED01.
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.
© 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)
McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Chapter 13 Routing Protocols (RIP, OSPF, BGP)
Lecture Week 5 RIP version 1 Routing Protocols and Concepts.
Objectives After completing this chapter you will be able to: Understand how routers operate Describe Distance Vector and Link State Algorithms Describe.
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.
7400 Samsung Confidential & Proprietary Information Copyright 2006, All Rights Reserved. -0/35- OfficeServ 7x00 Enterprise IP Solutions Quick Install Guide.
1 1-Dec-15 S Ward Abingdon and Witney College Distance Vector Routing CCNA Exploration Semester 2 Chapter 4.
Chapter 14 1 Unicast Routing Protocols There isn’t a person anywhere that isn’t capable of doing more than he thinks he can. - Henry Ford.
© 2006 Cisco Systems, Inc. All rights reserved.Cisco PublicITE I Chapter 6 1 Routing with a Distance Vector Protocol in an Enterprise Network Introducing.
Cisco Systems Networking Academy S2 C 12 Routing Protocols.
RIP V1 W.lilakiatsakun. RIP V1 characteristics RIP is a distance vector routing protocol. RIP is a distance vector routing protocol. RIP uses hop count.
Routing Information Protocol
RIP Routing Information Protocol 指導老師:梁德昭 老師 簡報者:方佳娣.
CCNA2 v3 Module 7 v3 CCNA 2 Module 7 JEOPARDY K. Martin.
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 16-Mar-16 S Ward Abingdon and Witney College RIP v1 Routing CCNA Exploration Semester 2 Chapter 5.
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization All routers are identical Network is flat. Not true in Practice Hierarchical.
RIP.
Dynamic Routing Protocols part2
Routing Protocols (RIP, OSPF, BGP)
Routing Information Protocol (RIP)
Routing Information Protocol (RIP)
IS3120 Network Communications Infrastructure
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization All routers are identical Network is flat. Not true in Practice Hierarchical.
Dynamic Routing Protocols part2
Routing Protocols and Concepts – Chapter 5
Routing Protocols and Concepts
Routing Protocols and Concepts – Chapter 5
RFC 1058 & RFC 2453 Routing Information Protocol
Routing Protocols and Concepts – Chapter 5
Routing Protocols and Concepts – Chapter 5
CCE1030 Computer Networking
Distance Vector Routing
CCE1030 Computer Networking
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization All routers are identical Network is flat. Not true in Practice Hierarchical.
Presentation transcript:

Objectives After completing this chapter you will be able to: Describe the Routing Information Protocol (RIP version 1 and RIP version 2) Describe Routing Loops, Split Horizons and Poison Reverse Outline the advantages and disadvantages of RIP

Characteristics of RIP RIP is a very simple protocol of the distance vector family. RIP was documented in RFC-1058 in June RIP messages can be broadly classified into two types: Routing information messages and messages used to request information. RIP uses a very simple metric - the hop count. RIP packets are carried over User Data Protocol (UDP) and IP. The RIP processes uses UDP port number 520. RIP updates are normally sent every 30 seconds by default. Every entry has a timer (180 seconds by default) associated with it and on expiry the distance for that entry is set to infinity.

Routing Table From Ericsson Colorado Router

RIP Version 1 Message Format Command(1) Version (1) Must be zero (2) Address family identifier (2) IP address (4) Must be zero (4) Metric (4) request 2 - Response 3 - Traceon 4 - Traceoff 5 - Reserved Address family identifier = 2 (IP) IP headerUDP Port=520

The RIP Protocol RIP Request ………………… …………………. RIP Response (Max 25 entries) Valid Class A, B or C? Net number =/ 127 or 0 Host number =/ broadcast Metric >/ 16 Metric = Metric+1 Update Routing table

RIP Neighbours RIP behaves promiscuously Ethernet RIP neighbours are defined Broadcast NetworksNBMA Networks ATM

RIP Version 2 Message Format Command(1) Version (1) Routing domain (2) Route tag (2) Address family identifier (2) IP address (4) Subnet mask (4) Next hop (4) Metric (4)

Slow Convergence AB CD NetworkHops A B C D NetworkHops A B C D Network Hops A B C D

Routing Loops AB D E C

Split Horizons AB D E C

Advantages of RIP RIP automatically creates and maintains a network of routes. Since RIP uses a single metric it is very easy to configure.

Disadvantages of RIP The diameter of the internetwork is limited to 15 router hops. Network administrators cannot take into account such factors as bandwidth or delay when configuring their routing systems using RIP. Each routing entry is updated every 30 seconds or so, regardless whether there has been a change in the network topology or not.