Reviewing Routing

Operations

Medium-Sized Routed Network Construction

© 2007 Cisco Systems, Inc. All rights reserved. ICND2 v1.0—3-1

Module Overview

 Overview routing.
 What Is a Routing Protocol?
 Static vs. Dynamic Routes
 Concepts: AS, AD, Classful, Classless, Distance
Vector, Link State, Hybrid.
 Benefits and Drawbacks of Link-State Routing
 Solutions to Routing Loops

© 2007 Cisco Systems, Inc. All rights reserved. ICND2 v1.0—3-2

What Is a Routing Protocol?

 Routing protocols
are used between
routers to determine
paths and maintain
routing tables.
 After the path is
determined, a router
can route a routed
protocol.

© 2007 Cisco Systems, Inc. All rights reserved. ICND2 v1.0—3-3

Routing Protocol
Routing Protocol
(Giao thưc định tuyến

Định tuyến Nội Định tuyến Ngoại

Interior Gateway Exterior Gateway
protocol Protocol

Tĩnh Động BGP

Static Dynamic Border Gateway
Protocol

Bỏder
Distance Vector Link State Hybrid IBGP EBGP

RIPv1, RIPv2 OSPF EIGRP

© 2007 Cisco Systems, Inc. All rights reserved. ICND2 v1.0—3-4

Overview routing

© 2007 Cisco Systems, Inc. All rights reserved. ICND2 v1.0—3-5

Static vs. Dynamic Routes

Static Route Dynamic Route

 Uses a route that a  Uses a route that a
network administrator network routing protocol
enters into the router adjusts automatically for
manually topology or traffic changes
 Example: ip route  Example: RIP, OSPF,…

© 2007 Cisco Systems, Inc. All rights reserved. ICND2 v1.0—3-6

Autonomous Systems: Interior or
Exterior Routing Protocols

 An autonomous system is a collection of networks under a

common administrative domain.
 IGPs operate within an autonomous system.
 EGPs connect different autonomous systems.

© 2007 Cisco Systems, Inc. All rights reserved. ICND2 v1.0—3-7

Administrative Distance:
Ranking Routes

Routers choose the routing source with the

best administrative distance:
 RIP has an administrative distance of 120.
 OSPF has an administrative distance of 110.
 EIGRP has an administrative distance of 90.

© 2007 Cisco Systems, Inc. All rights reserved. ICND2 v1.0—3-8

Classful Routing Protocol

 Classful routing protocols do not include the subnet mask with the
route advertisement.
 Within the same network, consistency of the subnet masks is
assumed.
 Summary routes are exchanged between foreign networks.
 These are examples of classful routing protocols:
– RIPv1
– IGRP (not now)

© 2007 Cisco Systems, Inc. All rights reserved. ICND2 v1.0—3-9

Classless Routing Protocol
 Classless routing protocols include the subnet mask with the
route advertisement.
 Classless routing protocols support a variable-length subnet
mask (VLSM).
 Summary routes can be manually controlled within the network.
 These are examples of classless routing protocols:
– RIPv2
– EIGRP
– OSPF
– IS-IS

© 2007 Cisco Systems, Inc. All rights reserved. ICND2 v1.0—3-10

Distance Vector Routing Protocols

 Routers pass periodic copies of their routing table to neighboring

routers and accumulate distance vectors

© 2007 Cisco Systems, Inc. All rights reserved. ICND2 v1.0—3-11

Sources of Information and Discovering
Routes

 Routers discover the best path to destinations from each neighbor.

© 2007 Cisco Systems, Inc. All rights reserved. ICND2 v1.0—3-12

Link-State Routing Protocols

After an initial flood of LSAs, link-state routers pass small,

event-triggered link-state updates to all other routers.

© 2007 Cisco Systems, Inc. All rights reserved. ICND2 v1.0—3-13

Hybrid

EIGRP

 Advanced distance vector  Flexible network design

 Rapid convergence  Multicast and unicast instead of broadcast
 100% loop-free classless routing address
  Support for VLSM and discontiguous subnets
Easy configuration
  Manual summarization at any point in the
Incremental updates
internetwork
 Load balancing across equal-
 Support for multiple network layer protocols
and unequal-cost pathways

© 2007 Cisco Systems, Inc. All rights reserved. ICND2 v1.0—3-14

Benefits and Drawbacks of Link-State Routing
 Benefits of link-state routing:
– Fast convergence:
 Changes are reported immediately by the affected source
– Robustness against routing loops:
 Routers know the topology
 Link-state packets are sequenced and acknowledged
– Hierarchical network design enables optimization of resources.

 Drawbacks of link-state routing:

– Significant demands for resources:
 Memory (three tables: adjacency, topology, forwarding)
 CPU (Dijkstra’s algorithm can be intensive, especially when there are many
instabilities)
– Requires very strict network design
– Configuration can be complex when tuning various parameters and
when design is complex

© 2007 Cisco Systems, Inc. All rights reserved. ICND2 v1.0—3-15

Selecting the Best Route Using Metrics

© 2007 Cisco Systems, Inc. All rights reserved. ICND2 v1.0—3-16

Maintaining Routing Information

Updates proceed step by step from router to router.

© 2007 Cisco Systems, Inc. All rights reserved. ICND2 v1.0—3-17

Inconsistent Routing Entries:
Counting to Infinity and Routing Loops

Each node maintains the distance from itself

to each possible destination network.

© 2007 Cisco Systems, Inc. All rights reserved. ICND2 v1.0—3-18

Counting to Infinity

Slow convergence produces inconsistent routing.

© 2007 Cisco Systems, Inc. All rights reserved. ICND2 v1.0—3-19

Counting to Infinity (Cont.)

Router C concludes that the best path to

network 10.4.0.0 is through router B.

© 2007 Cisco Systems, Inc. All rights reserved. ICND2 v1.0—3-20

Counting to Infinity (Cont.)

Router A updates its table to reflect

the new but erroneous hop count.

© 2007 Cisco Systems, Inc. All rights reserved. ICND2 v1.0—3-21

Counting to Infinity (Cont.)

The hop count for network 10.4.0.0 counts to infinity.

© 2007 Cisco Systems, Inc. All rights reserved. ICND2 v1.0—3-22

Solution to Counting to Infinity:
Defining a Maximum

A limit is set on the number of hops to prevent infinite loops.

© 2007 Cisco Systems, Inc. All rights reserved. ICND2 v1.0—3-23

Routing Loops

Packets for network 10.4.0.0 bounce

(loop) between routers B and C.

© 2007 Cisco Systems, Inc. All rights reserved. ICND2 v1.0—3-24

Solution to Routing Loops: Split Horizon

It is never useful to send information about a route back

in the direction from which the original information came.

© 2007 Cisco Systems, Inc. All rights reserved. ICND2 v1.0—3-25

Solution to Routing Loops:
Route Poisoning and Poison Reverse

Routers advertise the distance of routes

that have gone down to infinity.

© 2007 Cisco Systems, Inc. All rights reserved. ICND2 v1.0—3-26

Solution to Routing Loops:
Route Poisoning and Poison Reverse (Cont.)

Poison reverse overrides split horizon.

© 2007 Cisco Systems, Inc. All rights reserved. ICND2 v1.0—3-27

Solution to Routing Loops:
Hold-Down Timers

The router keeps an entry for the “possibly down” state in the network,
allowing time for other routers to recompute for this topology change.

© 2007 Cisco Systems, Inc. All rights reserved. ICND2 v1.0—3-28

Triggered Updates

The router sends updates when a change in its routing table occurs.

© 2007 Cisco Systems, Inc. All rights reserved. ICND2 v1.0—3-29

Eliminating Routing Loops

© 2007 Cisco Systems, Inc. All rights reserved. ICND2 v1.0—3-30

Eliminating Routing Loops (Cont.)

© 2007 Cisco Systems, Inc. All rights reserved. ICND2 v1.0—3-31

Eliminating Routing Loops (Cont.)

© 2007 Cisco Systems, Inc. All rights reserved. ICND2 v1.0—3-32

Benefits and Drawbacks of Link-State Routing
 Benefits of link-state routing:
– Fast convergence:
 Changes are reported immediately by the affected source
– Robustness against routing loops:
 Routers know the topology
 Link-state packets are sequenced and acknowledged
– Hierarchical network design enables optimization of resources.

 Drawbacks of link-state routing:

– Significant demands for resources:
 Memory (three tables: adjacency, topology, forwarding)
 CPU (Dijkstra’s algorithm can be intensive, especially when there are many
instabilities)
– Requires very strict network design
– Configuration can be complex when tuning various parameters and
when design is complex

© 2007 Cisco Systems, Inc. All rights reserved. ICND2 v1.0—3-33

Summary

 Dynamic routing requires administrators to configure either a

distance vector or link-state routing protocol.
 Distance vector routing protocols incorporate solutions such as
split horizon, route poisoning, and hold-down timers to prevent
routing loops.
 Link-state routing protocols scale to large network infrastructures
better than distance vector routing protocols, but they require
more planning to implement.

© 2007 Cisco Systems, Inc. All rights reserved. ICND2 v1.0—3-34

© 2007 Cisco Systems, Inc. All rights reserved. ICND2 v1.0—3-35