DISTANCE VECTOR ROUTING Flashcards
Describe Distance Vector Routing Protocols
- Advertise networks as vectors of distance
and direction
What are the divisions of Distance Vector Routing Protocols
− Classful routing protocols do not include a subnet
mask in the routing update
− Classless routing protocols include a subnet mask in the routing update
What are the General Characteristics of DV Routing Protocols
- Periodic Updates
* Updates to the routing tables are sent at the end of a certain time
period e.g. 90 seconds for IGRP, 30 seconds for RIP - Triggered Updates
* when changes occur in the topology the router immediately sends
out an update without waiting for the end of the periodic update
interval - Full Routing Table Update
* the entire routing table (not only entries which change) is sent to
their neighbors - Route invalidation timers
* They use various timers to invalidate routing table entries if they
are not refreshed
* e.g. for RIP if no update is received from a specific neighbor
within the 30 seconds, it will use various timers to invalidate the
entries as it waits for a valid update - Have an incomplete view/ knowledge of the network
topology
* Routers do not know the details about the network’s topology
beyond a neighboring router
* “routing by rumor” - They are generally prone to routing loops
* Generally distance vector protocols take longer to converge due to the time taken to calculate routes and forward updates, thus updates about changes may not be processed
in a timely manner.
Describe the routing table and its table entries
- Each router maintains a routing table, where
each node/router in the network has an entry in
the table - Each table entry contains two parts:
1. the outgoing line (interface) for the destination (node)
and
2. the distance (time, cost, whatever metric is used) to
the destination - Each router knows the distance to its neighbors
What is the first step of how DV Protocols build routing tables
. Initialization – each node knows only the distance
between itself and immediate neighbor (those directly
connected to it
* At this point only directly connected networks are initially
placed in the routing table
*See 6
What is the second step of how DV Protocols build routing tables
- Initial Exchange of Routing Information
* If a distance vector routing protocol is configured then the
routers will exchange routing information (each router
passes its routing table to the neighbor)
* Routing updates will be received from other directly
connected routers
What happens at the initial exchange if there is new information
- If there is new information:
the metric is re-calculated to determine the new minimum distance
the outgoing link for the destination is also recorded
and the new information is stored in routing table - If multiple routes to the same destination network exist, the router
chooses the route with the lowest metric
What is the third step of how DV Protocols build routing tables
- Exchange of more Routing Information
* Routers continue to exchange routing information
* If no new information is found then convergence is
reached
What is the third step of how DV Protocols build routing tables
- Exchange of more Routing Information
* Routers continue to exchange routing information
* If no new information is found then convergence is
reached
When is a network said to be converged
The network is converged when all routers have
complete and accurate information about the
entire network:
A network is not completely operable until the
network has converge
What is convergence time
Convergence time is the time it takes routers to
share information, calculate best paths, and
update their routing tables.
What does achieving convergence depend on
a) The speed of propagation of routing information
and
* The speed of propagation refers to the amount
of time it takes for routers within the network to
forward routing information
b) The speed of calculation of optimal paths
Describe Router Information Protocol (RIP)
- Was among the first IGP used over the Internet
- Is designed as an IGP to be used among routers
within an autonomous system - Is a distance vector protocol
What are the various versions of RIP
- RIP version 1-for IP version 4 networks
- RIP version 2- for IP version 4 networks
- RIPng - for IP version 6 networks
What are some common Characteristics of RIP v1 RIP v2 and RIPng:
- Used for routing within an autonomous system
(intradomain routing) - Metric used is - hop count only - i.e. RIP measures
distance in network hops - Maximum hop count is 15 hops - thus is ideal for small
networks - Has a default administrative distance (AD) of 120
− AD measures the preference of one source of routing information
as opposed to another.
− The lower the AD the preferable the source - Marks a network as unreachable if the hop count
reaches16
− Also known as ‘route poisoning’ - Uses Bellman Ford’s Algorithm/Ford Fulkerson’s
Algorithm - Uses two message types: request and response
− Request - used to ask neighboring nodes (routers) for an update
− Response - contains an update - Rely on periodic updates i.e. they periodically send updates every 30 seconds
- Use invalidation timers “garbage collection” timers to
flash unreachable networks from the routing tables