Scribd Logo
Upload

Welcome to Scribd!

  • 5 views

    RIP Routing Information Protocol

    Uploaded by

    Arixson

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd

    RIP Routing Information Protocol

    Uploaded by

    Arixson
    5 views3 pages

    Copyright

    © © All Rights Reserved

    Available Formats

    TXT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Download as txt, pdf, or txt
    5 views3 pages

    RIP Routing Information Protocol

    Uploaded by

    Arixson

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Download as txt, pdf, or txt
    You are on page 1of 3

    RIP Routing Information Protocol

    Rip stands for routing information protocol and it's one of the oldest dynamic
    routing protocols around.

    Now just because it's old I don't think people don't use it.

    It's still used quite a bit but usually only in small networks ones that don't
    change very often.

    So let's get a few basics down.

    Number one rip is an interior gateway protocol no gate so you're not going to be
    using it to connect

    autonomous systems.

    And secondly it's a distance vector protocol.

    Now what I'm going to talk about is the first version of rip or ripped one.

    OK.

    So to explain Ripp I've got three routers X Y and Z and I've got three networks A B
    and C..

    And what we're going to do is we have just made these three connections between
    these three routers

    and we're going to watch what happens with RIP.

    So as these routers connect.

    Now keep in mind in order for it to work all of these routers have to be configured
    for Ripp and they

    have to be Ripp capable and they are so the first thing that's going to happen.

    This router already has a route to network see this router already has a route to
    network a.

    And this router already has a route to network b so its routing tables each one of
    these has one route

    built into it.

    They don't know about each other yet.

    Now they're connected so they know they can start talking and over a given fixed
    interval they'll begin

    to speak and they will start showing each other their routing tables.

    So what's going to happen on the first swipe and let's concentrate right over here
    with router Z.

    So router Z knows how to get to network C.

    So he's going to go ahead and send that to these two routers in turn these routers
    are going to send

    their connections to the other guys.

    So in the first click of the clock this router right here he knows how to get to
    network see through

    himself.

    He knows how to get to network a router X and he knows how to get to network B
    through router y.

    So he has three routes built into him in that first sequence.

    Now overate the same fixed amount of time these routers will talk again.

    Now think about this for a minute.

    Here's router x.

    He knows how to get to network B through router y correct.

    Z knows how to get to network B through router y.

    But using this connection.

    So the next time they compare notes suddenly routers he has two different ways to
    get to network B.

    He can do it through X or he can do it through Y.

    And that's why Ripp uses the hop count as part of the metric.

    So with Ripp he's going to take a look it'll go yes I can get to network B through
    router X but it's

    going to take me one or two hops to get to it.

    I can get to network B through router y with only one hop.

    So this guy right here now that he has two different ways to get to network B he's
    going to simply delete

    the one with the longer hop count.

    So that works out pretty well and that's the basics of how Ripp works.

    The downside to rip is that it takes a while to get convergence because it has a
    fixed time interval

    between the individual times that they start comparing each other's routing tables.

    The other issue that comes into play is that version 1 had some real limitations.

    For example version one could only deal with class a class B or Class C networks.

    So if we used cyder rules for example if we had a 28 network it just didn't work
    with Ripp version 1.
    So Ripp version 2 came along and reversion to took care of two big problems.

    Number one it can handle cyder based network.

    So I will deal with whac 28 29 networks.

    And secondly it has security built into it so it's not that easy for bad guys to
    come in and mess that

    stuff up.

    So that's Ripp in a nutshell.

    And remember it's easy to find Ripp and network.

    Plus was going to ask you some good questions on it.

    Make sure you understand the big issues.

    One other big thing Ritt had a maximum Hopp count of 15 hops.

    So you couldn't have a network bigger than 15 hops between two network IDs or it
    simply didn't work.

    RIP is a distance vector protocol that uses a hop count to determine routes

    RIP1 used only classfull networks

    RIP's maximum hop count is 15

    You might also like