Scribd Logo
Upload

Welcome to Scribd!

  • 5 views

    CN Lecture 05 Routing RIP

    Uploaded by

    Surid

    Copyright:

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

    CN Lecture 05 Routing RIP

    Uploaded by

    Surid
    5 views23 pages

    Copyright

    © © All Rights Reserved

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Copyright:

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

    CN Lecture 05 Routing RIP

    Uploaded by

    Surid

    Copyright:

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

    Routing

    Course Code: CSC 3116 Course Title: Computer Networks

    Dept. of Computer Science


    Faculty of Science and Technology

    Lecturer No: 5 Week No: 5 Semester: Fall 23-24


    Lecturer: Nusrat Jahan Anannya, [email protected]
    Lecture Outline

    1. Introduction
    2. Static routing vs dynamic routing
    3. Dynamic routing
    4. Routing information protocol (RIP)
    Introduction

     Routing
     routing is the act of forwarding network packets
    from a source
    network to a destination networks by a router based on
    its routing table [2].

    Fig. A simplified routing table [2]


    Introduction

     How is the routing table created?


     Static routing
     If it is done manually by inputting information for
    each destination network by a network engineer,
     Suitable for very small network
     Dynamic routing
     If the table is created and modified automatically
    depending on the network condition by a routing
    protocol
     Dynamic routing can be deployed on small to
    large size network.
    Dynamic Routing
    Features

    • Facilitates the exchange of routing information


    between routers
    • Allow routers to dynamically learn information
    about remote networks and automatically add
    this information to their own routing tables
    • Determines the best path to each network
    Dynamic Routing….
    Ways to classify routing protocols

    • Interior Gateway Protocols or Exterior Gateway


    protocols
    • Distance vector or Link state
    Dynamic Routing….
    IGP

     IGP
     Routing inside an autonomous system (AS),
    where, AS is a collection of networks under a
    common administrator
     Example
    o Routing Information Protocol (RIP) version 1
    o Interior Gateway Routing Protocol (IGRP)
    o Enhanced IGRP (EIGRP)
    o Open Shortest Path First (OSPF)
    o Intermediate System (IS)-IS
    Dynamic Routing….
    EGP

    EGP
    Routing between autonomous
    systems(AS)
    Example
    o Border Gateway Protocol (BGP)
    Dynamic Routing….
    Classification

    Autonomous systems

    An autonomous system (AS) is a very large


    network or group of networks with a single
    routing policy.
    P, EIGRP

    Dynamic Routing….
    Distance vector routing

    • A router communicates with its neighbors only for


    populating its routing table
    • Distance vector means that routes are advertised as
    vectors of distance and direction
    • Distance is defined in terms of a metric such as hop
    count, and direction is simply the next hop router or exit
    interface.
    • Bellman-Ford algorithm is used for the best-path route
    determination.
    • Some distance vector protocols periodically send
    complete routing tables to all connected neighbors.
    • In large networks, these routing updates can become
    enormous, causing significant traffic on the links.
    Example
    Dynamic Routing….
    Link state routing

    • A router configured with a linkstate routing protocol can


    create a “complete view,” or topology, of the network
    by gathering information from all the other routers.
    • A router communicates with all other routers of the
    network
    • Only send update (partial) when there is any change in
    the network topology
    • Example
    OSPF
    Dynamic Routing….
    Administrative Distance

    • The term trustworthiness is


    commonly used when defining
    administrative distance.
    • Administrative distance (AD) defines
    the preference of a routing source.
    • Administrative distance is an integer
    value from 0 to 255.
    • The lower the value, the more
    preferred the route source.
    • An administrative distance of 0 is the
    most preferred.
    • Only a directly connected network has
    an administrative distance of 0, which
    cannot be changed.
    RIP
    Features

    • Distance vector routing protocol


    • Hop count is used as the metric for path selection.
    • If the hop count for a network is greater than 15,
    RIP cannot supply a route to that network.
    • Routing updates are broadcast or multicast every
    30 seconds, by default.
    • If for some reason, an update for a particular route
    is not received within a period of 180 seconds then
    that specific route is declared as invalid and the
    router which identified that, informs all its
    neighbors about this invalid route.
    • Has two versions: RIPv1 & RIPv2
    RIP
    RIP v1-vs-RIPv2

    • Uses Classless addressing


    RIPv1 uses classful addressing, RIPv2 uses VLSM
    • Multicasting vs Broadcasting
    Version 1 of RIP uses broadcasting (255.255.255.255) to
    send RIP messages to every neighbor. In this way, all the
    routers on the network receive the packets, as well as the
    hosts. RIP version 2, on the other hand, uses the all-router
    multicast address (224.0.0.9) to send the RIP messages
    only to RIP routers in the network.
    • Updates
    RIPv2 sends and receives version 2 updates only. RIPv1
    sends version 1 updates and receives both 1 and 2,
    however, version 2 information is ignored.
    • Authentication
    RIPv2 ensures authentication, while RIPv1 does not
    RIP
    Routing table update

    Cold Start
    Topic Heading..
    Routing table update

    Initial Exchange of Information


    Topic Heading..
    Routing table update

    Table Updating
    Topic Heading..
    Routing table update

    Next Update
    Topic Heading..
    Another Example
    Topic Heading..
    New route
    Topic Heading..
    Removing a route
    References

    Graziani and A. Johnson, Routing Protocols and Concepts, 2n


    co Systems, Inc., USA, 2008, pp. 148-173.
    Macfarlane, Network Routing Basics, Wiley Publications. Inc.,
    2006, USA, pp. 70-104.
    Books

    1. Official Cert Guide CCNA 200-301 , vol. 1, W. Odom, Cisco Press,


    First Edition, 2019, USA.

    2. CCNA Routing and Switching, T. Lammle, John Wily & Sons, Second
    Edition, 2016, USA.

    You might also like