CCNA2

ROUTING

M.Menelaou
ROUTING
 Routing is the process that a router uses to
forward packets toward the destination
network. A router makes decisions based
upon the destination IP address of a packet
 When routers use dynamic routing, this
information is learned from other routers.
 When static routing is used, a network
administrator configures information about
remote networks manually
M.Menelaou
STATIC ROUTING

 Network administrator configures the route

 Router installs the route in the routing table
 Packets are routed using the static route
 Since a static route is manually configured,
the administrator must configure the static
route on the router using the ip route
command

M.Menelaou
STATIC ROUTING

M.Menelaou
STATIC ROUTING

M.Menelaou
STATIC ROUTING

 The method in Figure 1 specifies the next-

hop IP address of the adjacent router
 The method in Figure 2 specifies the
outgoing interface.

M.Menelaou
STATIC ROUTING
 The administrative distance is an optional
parameter that gives a measure of the
reliability of the route. A lower value for the
administrative distance indicates the more
reliable route.
 The default administrative distance when
using next-hop address is 1, while the default
administrative distance when using the
outgoing interface is 0.

M.Menelaou
STATIC ROUTING

 Default routes are used to route packets

with destinations that do not match any of
the other routes in the routing table
 ip route 0.0.0.0 0.0.0.0 [next-hop-address
| outgoing interface]
 If the packet does not match a more
specific route in the routing table, it will
be routed to the 0.0.0.0 network.

M.Menelaou
STATIC ROUTING

M.Menelaou
STATIC ROUTING
 In privileged mode enter the command show
running-config to view the active configuration.
 Verify that the static route has been correctly
entered. If the route is not correct, it will be
necessary to go back into global configuration mode
to remove the incorrect static route and enter the
correct one.
 Enter the command show ip route.
 Verify that the route that was configured is in the
routing table.

M.Menelaou
ROUTING Vs ROUTED Protocols

 A routing protocol is the communication used

between routers. A routing protocol allows
one router to share information with other
routers regarding the networks it knows
about as well as its proximity to other routers.
The information a router gets from another
router, using a routing protocol, is used to
build and maintain a routing table. 

M.Menelaou
ROUTING Vs ROUTED Protocols

 Examples of routing protocols are:

 Routing Information Protocol (RIP)
 Interior Gateway Routing Protocol (IGRP)
 Enhanced Interior Gateway Routing Protocol
(EIGRP)
 Open Shortest Path First (OSPF)

M.Menelaou
ROUTING Vs ROUTED Protocols

 A routed protocol is used to direct user traffic.

A routed protocol provides enough
information in its network layer address to
allow a packet to be forwarded from one host
to another based on the addressing scheme.

M.Menelaou
ROUTING Vs ROUTED Protocols

 Examples of routed protocols are:

 Internet Protocol (IP)
 Internetwork Packet Exchange (IPX)

M.Menelaou
ROUTING Vs ROUTED Protocols

M.Menelaou
Autonomous systems

 An autonomous system (AS) is a collection of

networks under a common administration
sharing a common routing strategy
 To the outside world, an AS is viewed as a
single entity.

M.Menelaou
Autonomous systems

M.Menelaou
DYNAMIC ROUTING
 The goal of a routing protocol is to build and
maintain the routing table. This table contains
the learned networks and associated ports
for those networks
 Routers use routing protocols to manage
information received from other routers,
information learned from the configuration of
its own interfaces, along with manually
configured routes.

M.Menelaou
DYNAMIC ROUTING

 The routing protocol learns all available

routes, places the best routes into the routing
table, and removes routes when they are no
longer valid. The router uses the information
in the routing table to forward routed protocol
packets.

M.Menelaou
DYNAMIC ROUTING

 When all routers in an internetwork are

operating with the same knowledge, the
internetwork is said to have converged
 Fast convergence is desirable because it
reduces the period of time in which routers
would continue to make incorrect routing
decisions

M.Menelaou
DYNAMIC ROUTING

 The routing algorithm is fundamental to

dynamic routing
 Whenever the topology of a network changes
because of growth, reconfiguration, or failure,
the network knowledgebase must also
change.

M.Menelaou
DYNAMIC ROUTING

 Most routing algorithms can be classified into

one of two categories:

 distance vector
 link-state

M.Menelaou
DYNAMIC ROUTING

 The distance vector routing approach

determines the direction (vector) and
distance to any link in the internetwork.
 The link-state approach, also called shortest
path first, recreates the exact topology of the
entire internetwork.

M.Menelaou
DYNAMIC ROUTING

 Distance vector routing algorithms pass

periodic copies of a routing table from router
to router
 Each router receives a routing table from its
directly connected neighbor routers

M.Menelaou
DYNAMIC ROUTING

 The algorithm eventually accumulates

network distances so that it can maintain a
database of network topology information.
 However, distance vector algorithms do not
allow a router to know the exact topology of
an internetwork as each router only sees its
neighbor routers

M.Menelaou
DYNAMIC ROUTING

 Each router that uses distance vector routing

begins by identifying its own neighbors
 As the distance vector network discovery
process proceeds, routers discover the best
path to destination networks based on the
information they receive from each neighbor

M.Menelaou
DYNAMIC ROUTING

 An analogy of distance vector could be the

signs found at a highway intersection. A sign
points towards a destination and indicates
the distance to the destination. Further down
the highway, another sign points toward the
destination, but now the distance is shorter.
As long as the distance is shorter, the traffic
is following the best path.

M.Menelaou
DYNAMIC ROUTING

M.Menelaou
DYNAMIC ROUTING

 The second basic algorithm used for routing

is the link-state algorithm. Link-state
algorithms are also known as Dijkstras
algorithm or as SPF (shortest path first)
algorithms.
 A link-state routing algorithm maintains full
knowledge of distant routers and how they
interconnect.

M.Menelaou
DYNAMIC ROUTING

 Link-state advertisements (LSAs) – A link-

state advertisement (LSA) is a small packet
of routing information that is sent between
routers.
 Topological database – A topological
database is a collection of information
gathered from LSAs.

M.Menelaou
DYNAMIC ROUTING

 SPF algorithm – The shortest path first

(SPF) algorithm is a calculation performed on
the database resulting in the SPF tree.
 Routing tables – A list of the known paths
and interfaces.

M.Menelaou
DYNAMIC ROUTING

 Each router in parallel with the others

constructs a topological database consisting
of all the exchanged LSAs.
 The SPF algorithm computes network
reachability. The router constructs this logical
topology as a tree, with itself as the root,
consisting of all possible paths to each
network in the link-state protocol internetwork

M.Menelaou
DYNAMIC ROUTING

 When the router receives an LSA, the

database is updated with the most recent
information and computes a map of the
internetwork using the accumulated data and
calculates the shortest path to other networks
using the SPF algorithm.

M.Menelaou
DYNAMIC ROUTING

 Link-state concerns:

– Processor overhead
– Memory requirements
– Bandwidth Consumption

M.Menelaou
Path determination

 A router determines the path of a

packet from one data link to another,
using two basic functions:
– A path determination function
– A switching function

M.Menelaou
Path determination

 The router uses the routing table to

determine the best path and proceeds to
forward the packet using the switching
function.
 The switching function is the internal process
used by a router to accept a packet on one
interface and forward it to a second interface
on the same router.

M.Menelaou
Path determination

 An example of a routing configuration is:

 GAD(config)#router rip
GAD(config-router)#network 172.16.0.0

M.Menelaou
Path determination

 Examples of IP routing protocols include:

– RIP – A distance vector interior routing protocol
– IGRP – Cisco's distance vector interior routing
protocol
– OSPF – A link-state interior routing protocol
– EIGRP – Cisco’s advanced distance vector
interior routing protocol
– BGP – A distance vector exterior routing protocol

M.Menelaou
Path determination
 Routing Information Protocol (RIP) was
originally specified in RFC 1058. Its key
characteristics include the following:
– It is a distance vector routing protocol.
– Hop count is used as the metric for path selection.
– If the hop count is greater than 15, the packet is
discarded.
– Routing updates are broadcast every 30 seconds,
by default.

M.Menelaou
Path determination
 Interior Gateway Routing Protocol (IGRP) is
a proprietary protocol developed by Cisco.
Some of the IGRP key design characteristics
emphasize the following:
– It is a distance vector routing protocol.
– Bandwidth, load, delay and reliability are used to
create a composite metric.
– Routing updates are broadcast every 90 seconds,
by default.

M.Menelaou
Path determination
 Open Shortest Path First (OSPF) is a nonproprietary
link-state routing protocol. The key characteristics of
OSPF are as follows:
– It is a link-state routing protocol.
– Open standard routing protocol described in RFC 2328.
– Uses the SPF algorithm to calculate the lowest cost to a
destination.
– Routing updates are flooded as topology changes occur.

M.Menelaou
Path determination
 EIGRP is a Cisco proprietary enhanced distance
vector routing protocol. The key characteristics of
EIGRP are as follows:
– It is an enhanced distance vector routing protocol.
– Uses load balancing.
– Uses a combination of distance vector and link-state
features.
– Uses Diffused Update Algorithm (DUAL) to calculate the
shortest path.
– Routing updates are broadcast every 90 seconds or as
triggered by topology changes.

M.Menelaou
Path determination

 Border Gateway Protocol (BGP) is an

exterior routing protocol. The key
characteristics of BGP are as follows:
– It is a distance vector exterior routing protocol.
– Used between ISPs or ISPs and clients.
– Used to route Internet traffic between
autonomous systems.

M.Menelaou
Path determination

 Interior routing protocols are designed for

use in a network whose parts are under the
control of a single organization.
 The design criteria for an interior routing
protocol require it to find the best path
through the network

M.Menelaou
Path determination

 An exterior routing protocol is designed for

use between two different networks that are
under the control of two different
organizations.

M.Menelaou
Path determination

M.Menelaou