Routing Information Protocol. RIP application. RIP version 1

Similar documents
Routing Information Protocol

Routing Information Protocol. A simple distance vector scheme

Routing Information Protocol. RIP application. RIP version 1

Routing Information Protocol

RIP Configuration. RIP Overview. Operation of RIP. Introduction. RIP routing table. RIP timers

TDC 363 Introduction to LANs

Distance vector and RIP

CHAPTER 4: ROUTING DYNAMIC. Routing & Switching

Basic Idea. Routing. Example. Routing by the Network

Routing by the Network

Routing Protocols Classification

RIP Version 2. The Classless Brother

Determining IP Routes. 2000, Cisco Systems, Inc. 9-1

Distance Vector Routing Protocols

Chapter 7: Routing Dynamically. Routing & Switching

Chapter 5 RIP version 1

EECS 122, Lecture 16. Link Costs and Metrics. Traffic-Sensitive Metrics. Traffic-Sensitive Metrics. Static Cost Metrics.

Default & Static Routes and Routing Information Protocol. Presented by : Mohammed Hamad

Chapter 7 Routing Protocols

SEMESTER 2 Chapter 4 Distance Vector Routing Protocols V 4.0 RIP, IGRP, EIGRP

Internet Routing Protocols Tuba Saltürk

Introduction to Local and Wide Area Networks

Routing Protocols of IGP. Koji OKAMURA Kyushu University, Japan

Building the Routing Table. Introducing the Routing Table Directly Connected Networks Static Routing Dynamic Routing Routing Table Principles

RFC Compliance Test Report. Release 3.0

Operation Manual IPv4 Routing H3C S3610&S5510 Series Ethernet Switches. Table of Contents

Network Protocols. Routing. TDC375 Autumn 03/04 John Kristoff - DePaul University 1

Configuring RIP. RIP Configuration Task List

BTEC Level 3 Extended Diploma

Chapter 3. Introduction to Dynamic Routing Protocols. CCNA2-1 Chapter 3

Network Protocols. Routing. TDC375 Winter 2002 John Kristoff - DePaul University 1

Table of Contents 1 Static Routing Configuration RIP Configuration 2-1

Configuring EIGRP. Finding Feature Information

Section 6. Implementing EIGRP ICND2

IP Routing Volume Organization

Routing Protocol Type Primarily IGP or EGP RIP Distance-Vector IGP EIGRP OSPF IS-IS BGP

shortcut Tap into learning NOW! Visit for a complete list of Short Cuts. Your Short Cut to Knowledge

Configuring EIGRP. Overview CHAPTER

Introduction to Routing

Keywords RIP, OSPF, IGP, EGP, AS, LSA

Network Working Group Request for Comments: 2080 Category: Standards Track Ipsilon Networks January 1997

The most simple way to accelerate a Router is at 9.8 m/sec/sec.

Introduction to Dynamic Routing Protocols

CS118 Discussion Week 7. Taqi

RIPv2. Routing Protocols and Concepts Chapter 7. ITE PC v4.0 Chapter Cisco Systems, Inc. All rights reserved. Cisco Public

EIGRP. About EIGRP. CLI Book 1: Cisco ASA Series General Operations CLI Configuration Guide, 9.7 1

Exam : : Building Scalable Cisco Internetworks (BSCI) Title. Ver :

EIGRP. Routing Protocols and Concepts Chapter 9. Video Frank Schneemann, MS EdTech

Routing with a distance vector protocol - EIGRP

Top-Down Network Design

9.1. Routing Protocols

CompSci 356: Computer Network Architectures. Lecture 12: Dynamic routing protocols: Link State Chapter Xiaowei Yang

Chapter 5. RIP Version 1 (RIPv1) CCNA2-1 Chapter 5

RIP Commands. output-delay, page 32 passive-interface (RIP), page 33 poison-reverse, page 35 receive version, page 37 redistribute (RIP), page 39

Configuring RIP. Information About RIP CHAPTER

Draft Manuscript Draft M. Manuscript Draft Ma. t Manuscript Draft Manu. ipt Draft Manuscript Dra. anuscript Draft Manuscri

Part II. Chapter 3. Determining IP Routes

Routing in the Internet

Computer Networks ICS 651. IP Routing RIP OSPF BGP MPLS Internet Control Message Protocol IP Path MTU Discovery

Lecture 12. Introduction to IP Routing. Why introduction? Routing

RIP version 1. Routing Protocols and Concepts Chapter 5. Version Cisco Systems, Inc. All rights reserved. Cisco Public 1

Unit 3: Dynamic Routing

Routing, Routing Algorithms & Protocols

Network Working Group. Obsoletes: 1723, 1388 November 1998 STD: 56 Category: Standards Track

Chapter 4: VLSM and Classless Inter Domain Routing. ITE PC v4.0 Chapter Cisco Systems, Inc. All rights reserved.

CIS 83 Midterm Spring 2004 Answer Sheet Name Score Grade Question Answer Question Answer

Why dynamic route? (1)

EIGRP 04/01/2008. Routing Protocols and Concepts Chapter 9 Modified by Tony Chen

Routing Protocols and

COMPARATIVE ANALYSIS OF ROUTING PROTOCOLS

2008 NDP Lectures 7 th Semester

Network Working Group. Obsoletes: 1388 November 1994 Updates: 1058 Category: Standards Track

ITE PC v4.0. Chapter Cisco Systems, Inc. All rights reserved. Cisco Public

EIGRP. Finding Feature Information

Routing Dynamically. 3.0 Routing Dynamically. Chapter Introduction Class Activity How Much Does This Cost?

FiberstoreOS IP Routing Configuration Guide

Link State Routing. Link State Packets. Link State Protocol. Link State Protocols Basic ideas Problems and pitfalls

Chapter 6 Reading Organizer

Routing Protocol. Seiya Tsubone. Apr The University of Tokyo. Seiya Tsubone (The University of Tokyo) Routing Protocol Apr. 25.

IP Protocols. ALTTC/Oct

A study of WAN design, routing protocols and connectivity between Head office to Branch office

FSOS IP Routing Command Line Reference

Claim desired outcome

IP Enhanced IGRP Commands

HP FlexFabric 5700 Switch Series

Routing & Protocols 1

ICS 351: Today's plan. netmask exercises network and subnetwork design dynamic routing RIP distance-vector routing

Top-Down Network Design, Ch. 7: Selecting Switching and Routing Protocols. Top-Down Network Design. Selecting Switching and Routing Protocols

Redesde Computadores(RCOMP)

Routing Protocol. RIPv1

Cisco CCNA 2 Exploration - Routing

Allows IGRP or Enhanced IGRP exterior routes to be advertised in updates.

Configuring Networking Protocols

Chapter 5. RIP Version 1 (RIPv1)

FiberstoreOS IP Routing Configuration Guide

Routing Protocol comparison

FiberstoreOS IP Routing Command Line Reference

(Refer Slide Time: 01:08 to 01:25min)

Chapter 4: Manipulating Routing

FSOS IP Routing Configuration Guide

Transcription:

Routing Information Protocol A simple distance vector scheme dr. C. P. J. Koymans Informatics Institute University of Amsterdam (version 1.1, 2010/02/19 12:38:50) Wednesday, February 24, 2010 RIP version 1 Origin and application Basic RIPv1 operation RIPv1 packets RIP version 1 and subnetting Protocol extensions IGRP EIGRP RIP version 2 Extensions with respect to version 1 Summary of changes with respect to version 1 RIP Next Generation and RIP variants RIP version 1 RIP application RFC 1058 Charles Hedrick, Rutgers University, 1988 Based on the Bellman-Ford distance vector algorithm Also used as the first ARPANET routing protocol Many implementations were already present differing in details (timers... ) available before the specification itself Inside homogeneous networks with a moderate size An interior routing protocol Maximum diameter is 15 hops Based on a uniform cost (weight) of 1

Basic operation Timers Keep a table of routes to destination networks with distance (metric), gateway (next hop) Periodically send out a complete table to all neighbors Update your table with newly collected information The distance can only decrease (become better) unless the information comes from the gateway itself, thereby overriding the old information Updates are sent every 30 seconds Routes time out after 180 seconds Unreachable networks may be included in updates Infinity = = 16 Triggered updates An update is being sent as soon as the table changes RIP packets RIPv1 packet format Packets are broadcast to 255.255.255.255 or to a directed broadcast address or to an individual host as a response to a request Works on top of UDP and uses 520 as its well-known port The maximum size is 512 bytes (including 8 bytes UDP header) so: there is room for 25 route updates (of 20 bytes each) Command Version Reserved (must be 0) Address Family Identifier Reserved (must be 0) IP Address (network) Reserved (must be 0) Metric Repeated maximally 25 times

RIPv1 packet fields Subnets RIPv1 fields Command Request(1) or Response(2) Version 1 AFI IP(2) IP Address Destination Network Metric Distance (max 16= ) RIPv1 supports fixed length, one level deep, subnet masks RIPv1 uses heuristics to derive the uniform subnet mask in use from its own directly connected subnets RIPv1 differentiates between neighbors for updates about subnets being part of that same subnetted network being part of another network Subnet Behaviour IGRP (1) IGRP stands for Interior Gateway Routing Protocol It is a Cisco proprietary protocol IGRP is a distance vector protocol The basics are the same as with RIP Find out how RIPv1 operates differently for C than for A and B.

IGRP (2) IGRP (3) Division into independent domains Uses three types of network routes: Interior route (with implicit subnet info) System route (summarized) Exterior route (candidate default) RIP The only metric is the hop count IGRP The metric is composite, based on Delay, Bandwidth, Reliability and Load The hop count is still communicated as a separate field MTU information about the path is also communicated EIGRP (1) EIGRP (2) EIGRP stands for Enhanced Interior Gateway Routing Protocol Remembers all paths, not only the best path It carries explicit subnet information (VLSM) It uses the DUAL (Diffusing Update Algorithm) algorithm for loop free routing and fast convergence It can take the MTU into account It uses no regular (periodic) routing table updates Updates happen only when the routing table changes It uses hello packets to discover neighbors It uses ack(nowledgement)s for reliable communication It can summarize on arbitrary bit boundaries

RIP version 2 RIPv2 packet format Specified in RFC 2453 by Gary Malkin, Bay Networks, 1998 It has extensions for subnet masks an optional alternate next hop authentication multicasting route tags Command Version Reserved (must be 0) Address Family Identifier Route Tag IP Address (network) Subnet Mask Next Hop Metric Repeated maximally 25 times RIPv2 packet fields First-routing-entry-as-authentication hack RIPv2 fields Command Request(1) or Response(2) Version 2 AFI IP(2) Route Tag Identification of route origin IP Address Destination Network Subnet Mask CIDR support Next Hop Gateway (if different from advertising router) Metric Distance (max 16= ) Address Family Identifier (=0xFFFF) Authentication Authentication Type Authentication type 2 means use of a plaintext password Authentication type 3 (RFC 4822) means use of Keyed-MD5 or HMAC-SHA-{1,256,384,512}

Summary of changes (1) Summary of changes (2) Authentication fields First AFI is 0xFFFF Simple password (type 2) 16 bytes Pointer (type 3) to a variable length authentication trailer Route tag field This is simply carried along It differentiates between internally and externally generated routes Subnet mask field net/subnet/host route differentiation Next Hop field Used when best next hop does not speak RIP itself Multicast (not a field) replaces broadcast The destination of updates is 224.0.0.9 (which is not forwarded) Next Hop scenario RIPng (for IPv6) A and B speak RIP internally. E and F speak some other protocol over the external network. E can speak RIP to A and B on behalf of F, setting the Next Hop as F as appropriate. Specified in RFC 2080 It still runs over UDP It uses port number 521 Packets can be any length that fits inside the network unfragmented Supports IPv6 prefix, route tags, next hop No authentication (which can be done at the IP level) It uses FF02::9, the all-rip-routers multicast address

RIPng packet format RTE-with-big-metric-as-next-hop hack Command Version Reserved (must be 0) Next Hop IPv6 Prefix Route Tag Prefix Length Metric As many as can fit in a packet unfragmented 0x0000 0x00 Metric(=0xFF) The next hop must be a link local address Using :: as next hop means use originator as next hop Next Hop remains valid until next next-hop-rte RIP variants There are also (incompatible) variants for RIP in other protocol stacks, for instance RIP-IPX Other timers (60 update / 180 timeout) Triggered updates, split horizon with poison reverse are obligatory Uses two metrics ticks (for path selection) hops (for counting to )