Scribd Logo
Upload

Welcome to Scribd!

  • 86 views

    Distance Vector Routing-Tut

    Uploaded by

    mahadev
    Distance vector routing requires routers to periodically inform their neighbors of topology changes. Each router maintains a distance vector table containing the distance to all destinations, calculated using the Bellman-Ford algorithm based on the costs of neighboring routers' routes. When a router receives an updated distance vector from a neighbor, it recalculates its own vector using the Bellman-Ford equation to determine the minimum cost route to each destination.

    Copyright:

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

    Distance Vector Routing-Tut

    Uploaded by

    mahadev
    86 views5 pages
    Distance vector routing requires routers to periodically inform their neighbors of topology changes. Each router maintains a distance vector table containing the distance to all destinations, calculated using the Bellman-Ford algorithm based on the costs of neighboring routers' routes. When a router receives an updated distance vector from a neighbor, it recalculates its own vector using the Bellman-Ford equation to determine the minimum cost route to each destination.

    Original Description:

    Distance Vector Routing

    Original Title

    Distance Vector Routing-tut

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Distance vector routing requires routers to periodically inform their neighbors of topology changes. Each router maintains a distance vector table containing the distance to all destinations, calculated using the Bellman-Ford algorithm based on the costs of neighboring routers' routes. When a router receives an updated distance vector from a neighbor, it recalculates its own vector using the Bellman-Ford equation to determine the minimum cost route to each destination.

    Copyright:

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

    Distance Vector Routing-Tut

    Uploaded by

    mahadev
    Distance vector routing requires routers to periodically inform their neighbors of topology changes. Each router maintains a distance vector table containing the distance to all destinations, calculated using the Bellman-Ford algorithm based on the costs of neighboring routers' routes. When a router receives an updated distance vector from a neighbor, it recalculates its own vector using the Bellman-Ford equation to determine the minimum cost route to each destination.

    Copyright:

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

    Distance vector routing

    A distance-vector routing (DVR) protocol requires that a router inform its neighbors of
    topology changes periodically. Historically known as the old ARPANET routing algorithm (or
    known as Bellman-Ford algorithm).

    Bellman Ford Basics – Each router maintains a Distance Vector table containing the distance
    between itself and ALL possible destination nodes. Distances,based on a chosen metric, are
    computed using information from the neighbors’ distance vectors.

    Information kept by DV router -


     Each router has an ID
     Associated with each link connected to a router,
     there is a link cost (static or dynamic).
     Intermediate hops

    Distance Vector Table Initialization -


     Distance to itself = 0
     Distance to ALL other routers = infinity number.

    Distance Vector Algorithm –


    1. A router transmits its distance vector to each of its neighbors in a routing packet.
    2. Each router receives and saves the most recently received distance vector from each of
    its neighbors.
    3. A router recalculates its distance vector when:
     It receives a distance vector from a neighbor containing different information than
    before.
     It discovers that a link to a neighbor has gone down.
    The DV calculation is based on minimizing the cost to each destination

    Dx(y) = Estimate of least cost from x to y


    C(x,v) = Node x knows cost to each neighbor v
    Dx = [Dx(y): y ∈ N ] = Node x maintains distance vector
    Node x also maintains its neighbors' distance vectors
    – For each neighbor v, x maintains Dv = [Dv(y): y ∈ N ]

     From time-to-time, each node sends its own distance vector estimate to neighbors.
     When a node x receives new DV estimate from any neighbor v, it saves v’s distance
    vector and it updates its own DV using B-F equation:
    Dx(y) = min { C(x,v) + Dv(y)} for each node y ∈ N
    Example – Consider 3-routers X, Y and Z as shown in figure. Each router have their routing
    table. Every routing table will contain distance to the destination nodes.

    Consider router X , X will share it routing table to neighbors and neighbors will share it routing
    table to it to X and distance from node X to destination will be calculated using bellmen- ford
    equation.
    Dx(y) = min { C(x,v) + Dv(y)} for each node y ∈ N
    As we can see that distance will be less going from X to Z when Y is intermediate node(hop) so
    it will be update in routing table X.
    Similarly for Z also –
    Finally the routing table for all –

    Advantages of Distance Vector routing –


     It is simpler to configure and maintain than link state routing.
    Disadvantages of Distance Vector routing –
     It is slower to converge than link state.
     It is at risk from the count-to-infinity problem.
     It creates more traffic than link state since a hop count change must be propagated to all
    routers and processed on each router. Hop count updates take place on a periodic basis,
    even if there are no changes in the network topology, so bandwidth-wasting broadcasts
    still occur.
     For larger networks, distance vector routing results in larger routing tables than link
    state since each router must know about all other routers. This can also lead to
    congestion on WAN links.

    Note – Distance Vector routing uses UDP(User datagram protocol) for transportation.
    Link State Routing –
     It is a dynamic routing algorithm in which each router shares knowledge of its neighbors
    with every other router in the network.
     A router sends its information about its neighbors only to all the routers through
    flooding.
     Information sharing takes place only whenever there is a change.
     It makes use of Dijkastra’s Algorithm for making routing tables.
     Problems – Heavy traffic due to flooding of packets.
    – Flooding can result in infinite looping which can be solved by using Time to leave
    (TTL) field.

    Comparison between Distance Vector Routing and Link State Routing:

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy