CCNA Explorer 2 Distance Vector Routing Protocols

From Teknologisk videncenter
Revision as of 21:49, 26 October 2011 by Rael (talk | contribs) (→‎Split Horixon with Poison Reverse or Route Poisoning)
Jump to: navigation, search

Introduction to Distance Vector Routing Protocols

Distance Vector Routing Protocols

Huge Network

RIP

  • 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.

IGRP

  • Bandwidth, delay, load and reliability are used to create a composite metric.
  • Routing updates are broadcast every 90 seconds, by default.
  • IGRP is the predecessor of EIGRP and is now obsolete.

EIGRP

  • It can perform unequal cost load balancing.
  • It uses Diffusing Update Algorithm (DUAL) to calculate the shortest path.
  • There are no periodic updates as with RIP and IGRP. Routing updates are sent only when there is a change in the topology.

Distance Vector technology

The Meaning of Distance Vector

Periodic Updates are sent at regular intervals (30 seconds for RIP and 90 seconds for IGRP). Even if the topology has not changed in several days, periodic updates continue to be sent to all neighbors.


Neighbors are routers that share a link and are configured to use the same routing protocol. The router is only aware of the network addresses of its own interfaces and the remote network addresses it can reach through its neighbors. It has no broader knowledge of the network topology. Routers using distance vector routing are not aware of the network topology.


Broadcast Updates are sent to 255.255.255.255. Neighboring routers that are configured with the same routing protocol will process the updates. All other devices will also process the update up to Layer 3 before discarding it. Some distance vector routing protocols use multicast addresses instead of broadcast addresses.


Entire Routing Table Updates are sent, with some exceptions to be discussed later, periodically to all neighbors. Neighbors receiving these updates must process the entire update to find pertinent information and discard the rest. Some distance vector routing protocols like EIGRP do not send periodic routing table updates.

Routing Protocol Characteristics

  • Time to Convergence
  • Scalability
  • Classless (Use of VLSM) or Classful
  • Resource Usage
  • Implementation and Maintenance

Network Discovery

Cold Start

Network Cold Start

Convergence

Hvor lang tid vil convergeringen tage?

Routing Table Maintenance

Periodic Updates: RIPv1 and IGRP

Periodic Updates Every 30 Sec

Timers:

  • Invalid Timer - Hvis der ikke er kommet en update indenfor 180 sekunder. Bliver routen markeret som invalid ved at sætte metric til 16.
  • Flush Timer - Er sat til 240 sekunder. Mår den udløber fjernes routen fra route tabellen.
  • Holddown Timer - For at undgå Loops skal en unreachable eller muligvis unreachable route blive i holddown i 180 sekunder. Hvor routeren ikke modtager updateringer med den samme eller dårligere metric

Bounded Update: EIGRP

EIGRP Sender ikke periodiske opdateringer, men kun nyt information til dem der har behov for det.

Triggered Updates

  • An interface changes state (up or down)
  • A route has entered (or exited) the "unreachable" state
  • A route is installed in the routing table

Synchronized Updates

To avoid repeated collisions on HUB networks Cisco IOS uses a random variable called RIB_JItter. It subtracts rendomly 0-15% from the hello timer.

Routing Loops

Grunde til Routing Loops:

  • Incorrectly configured static routes
  • Incorrectly configured route redistribution (redistribution is a process of handing the routing information from one routing protocol to another routing protocol and is discussed in CCNP-level courses)
  • Inconsistent routing tables not being updated due to slow convergence in a changing network
  • Incorrectly configured or installed discard routes

Effekten af routing loops

  • Link bandwidth will be used for traffic looping back and forth between the routers in a loop.
  • A router's CPU will be strained due to looping packets.
  • A router's CPU will be burdened with useless packet forwarding that will negatively impact the convergence of the network.
  • Routing updates may get lost or not be processed in a timely manner. These conditions would introduce additional routing loops, making the situation even worse.
  • Packets may get lost in "black holes."

Count to Infinity

Count to Infinity

Løsning: Lav et maks på metric(16 RIP)

Prevent Routing Loops with Holddown Timers

Holddown Timers

Modtager ikke updateringer omkring et netværk der er gået ned.
Hvis man modtager en update med en ringere metric omkring netværket bliver den ikke installeret.

Split Horizon Rule

Man sender ikke information tilbage til hvor det kom fra.

Split Horizon with Poison Reverse or Route Poisoning

Poison reverse
  1. Network 10.4.0.0 becomes unavailable due to a link failure.
  2. R3 poisons the metric with a value of 16 and then sends out a triggered update stating that 10.4.0.0 is unavailable.
  3. R2 processes that update. Because the metric is 16, R2 invalidates the routing entry in its routing table.
  4. R2 then sends the poison update to R1, indicating that route is unavailable, again by setting the metric value to 16.
  5. R1 processes the update and invalidates the routing entry for 10.4.0.0 in its routing table.

Distance Vector Routing Protocols today

Features of RIP:

  • Supports split horizon and split horizon with poison reverse to prevent loops.
  • Is capable of load balancing up to six equal cost paths . The default is four equal cost paths.

RIPv2 introduced the following improvements to RIPv1:

  • Includes the subnet mask in the routing updates, making it a classless routing protocol.
  • Has authentication mechanism to secure routing table updates.
  • Supports variable length subnet mask (VLSM).
  • Uses multicast addresses instead of broadcast.
  • Supports manual route summarization.

EIGRP features include:

  • Triggered updates (EIGRP has no periodic updates).
  • Use of a topology table to maintain all the routes received from neighbors (not only the best paths).
  • Establishment of adjacencies with neighboring routers using the EIGRP hello protocol.
  • Support for VLSM and manual route summarization. These allow EIGRP to create hierarchically structured large networks.

Advantages of EIGRP:

  • Although routes are propagated in a distance vector manner, the metric is based on minimum bandwidth and cumulative delay of the path rather than hop count.
  • Fast convergence due to Diffusing Update Algorithm (DUAL) route calculation. DUAL allows the insertion of backup routes into the EIGRP topology table, which are used in case the primary route fails. Because it is a local procedure, the switchover to the backup route is immediate and does not involve the action in any other routers.
  • Bounded updates mean that EIGRP uses less bandwidth, especially in large networks with many routes.
  • EIGRP supports multiple Network layer protocols through Protocol Dependent Modules, which include support for IP, IPX, and AppleTalk.
Retrieved from "http://mars.merhot.dk/w/index.php?title=CCNA_Explorer_2_Distance_Vector_Routing_Protocols&oldid=19925"