Welcome to Week 3

Static and Dynamic Routing

Nasir Faruk, Ph.D.

Department of Telecommunication Science
University of Ilorin, Ilorin, Nigeria
Email: [email protected]
 Course content/Lecture Schedule
Lect. No. Date Topic
1 Week 1 General Overview of the Course and Course Requirements
2 Week 2 Introduction to Routing and Packet Forwarding.
3 Week 3 Static Routing and Dynamic Routing Protocols
4 Week 4 Distance Vector and Link State Routing Algorithms
5 Week 5 Distance Vector Routing Protocols I
6 Week 6 Routing Information Protocol (RIP)
7 Week 7 (Test 1) RIPv1: Distance Vector, Classful Routing Protocol
8 Week 8 BUILDING and maintaining ROUTING TABLE using RIP
9 Week 9 Dealing With Failure & RIP Refinements, VLSM and CIDR
10 Week 10 Link-State Routing Protocols
11 Week 11 OSPF
12 Week 12 (Test 2) OSPF Packet Type, OSPF Adjacencies, Neighbor Establishment

P.S Topic Date Duration

No. Assigned

1 Introduction to Dynamic Routing Protocols Week 4 1 Week

2 BUILDING and maintaining ROUTING TABLE using RIP Week 8 1 week
2 Dealing With Failure & RIP Refinements, VLSM and CIDR Week 9 1 Week
4 Link-State Routing Protocols Week 11 1 week
2 5 OSPF Packet Type, OSPF Adjacencies, Neighbor Establishment Week 12 1 week
 Today’s Class
 In this week you will be introduce to:
 Routing table
 Routing table entries for directly connected and remote
networks.
 To understand how routing tables are maintained
 To understand the concept of distributed routing protocol
 To differentiate between static and dynamic routing

3
 Forwarding:
Network Specific vs Host Specific

4
 Routing Table I
 The routing table is at the heart of making routing decisions.
 A routing table is analogous to a distribution map in package
delivery.
 Whenever a node needs to send data to another node on a
network, it must first know where to send it.
 If the node cannot directly connect to the destination node, it has
to send it via other nodes along a route to the destination node.
 Each node needs to keep track of which way to deliver various
packages of data, and for this it uses a routing table.
 A routing table is a database that keeps track of paths, like a
map, and uses these to determine which way to forward
traffic.

5
 Routing Table II
 Directly connected routes—
These routes come from the
active router interfaces.
Routers add a directly
connected route when an
interface is configured with an
IP address and is activated.
 Remote routes—These are
remote networks connected to
other routers. Routes to these
networks can be either
statically configured or
dynamically learned through
dynamic routing protocols.

6
 Routing Table Sources I
Entries in the routing table can be added as follows:
 Local route interfaces—Added when an interface is configured
and active. This entry is only displayed in IOS 15 or newer for
IPv4 routes and all IOS releases for IPv6 routes.
 Directly connected interfaces—Added to the routing table
when an interface is configured and active.
 Static routes—Added when a route is manually configured and
the exit interface is active.
 Dynamic routing protocol—Added when routing protocols
that dynamically learn about the network, such as EIGRP and
OSPF, are implemented and networks are identified.

7
 Routing Table Sources II
 The sources of the routing table entries are identified by a code. The
code identifies how the route was learned. For instance, common codes
include the following:
i. L—Identifies the address assigned to a router’s interface. This allows
the router to efficiently determine when it receives a packet for the
interface instead of being forwarded.
ii. C—Identifies a directly connected network.
iii. S—Identifies a static route created to reach a specific network.
iv. D—Identifies a dynamically learned network from another router
using EIGRP.
v. R—Identifies a dynamically learned network from another router
using RIP
vi. O—Identifies a dynamically learned network from another router
using the OSPF routing protocol.

8
 Routing Table Entries
 A host or router has a routing table with an entry for
each destination
 A routing table entry refers to a reachable subnetwork
 Each entry includes
 Subnet prefix (and usually prefix length)
 Metric to subnet from local router
 Next hop router address + interface to that router
 Routing Process
I. The router uses its routing table to determine the best path to
forward the packet.
II. When the router receives a packet, it examines its destination
IP address and searches for the best match with a network
address in the router's routing table.
III. The routing table also includes the interface to be used to
forward the packet.
IV. Once a match is found, the router encapsulates the IP
packet into the data link frame of the outgoing or exit interface,
and the packet is then forwarded toward its destination.

10
 Load balancing in Routing
 Individual routing protocols uses metrics to determine the
best route to the destination.
 So what happens when two or more routes to the same
destination have identical metric values?
 How will the router decide which path to use for packet
forwarding?
 In this case, the router does not choose only one route.
Instead, the router "load balances" between these
equal cost paths.
 The packets are forwarded using all equal-cost paths.

11
 Administrative Distances (AD)
 Routers learn about adjacent networks that are directly connected and about remote networks by using
static routes and dynamic routing protocols.
 In fact, a router might learn of a route to the same network from more than one source.
 The router must choose which route to install. So, how does a router determine which route to install in
the routing table when it has learned about the same network from more than one routing source? This is
the purpose of AD
 AD defines the preference of a routing source. AD is an integer value from 0 to 255. The lower the value
the more preferred the route source. An AD of 0 is the most preferred. Only a directly connected network
has an AD of 0, which cannot be changed.
.
 Anatomy of Remote Network Entry

D 192.168.6.0/24 [90/2172416] via 192.168.2.1, 00:00:24, Serial0/0/0

A1 A2 A3 A4 A5 A6 A7
Legend Name Description
A1 Route Source Identifies how the route was learned.
A2 Destination Network Identifies the IPv4 address of the remote network.
A3 Administrative Identifies the trustworthiness of the route source.
Distance Lower values indicate preferred route source.
A4 Metric Identifies the value assigned to reach the remote network. Lower
values indicate preferred routes.
A5 Next Hop Identifies the IPv4 address of the next router to forward the packet
to.
A6 Route Timestamp Identifies how much time has passed since the route was learned.
A7 Outgoing Interface Identifies the exit interface to use to forward a packet toward the
13 final destination.
 Locating and Maintaining
Routing Tables
 Routing decisions can be made by a central routing process
 Called centralized routing
 Sometimes used in connection oriented public networks

 Or they can be made by a routing process in each router

 Called distributed routing
 Common to most connectionless network protocols

 Two main methods of maintaining the routing table

 Statically: manually configuring static routes
 Administrator tracks topology changes
 Dynamically: using a dynamic routing protocol
 Routing protocol tracks topology changes
 Distributed Dynamic Routing
 Maintain local copy of routing table in ‘real time’
 Updating routing table contents to reflect topology changes
 Exchange routing information with neighbouring routers
 Called routing advertisements
 Algorithms (and protocols) vary
 Use different updating policies
 Keep different amounts of routing information (state
information)
 Use different metrics to compare network paths
 Route Convergence
Convergence is when all routers' routing tables are at a state
of consistency.
The network has converged when all routers have complete
and accurate information about the network.
 Convergence time is the time it takes routers to share
information, calculate best paths, and update their routing
tables.
A network is not completely operable until the network has
converged; therefore, most networks require short
convergence times.

16
 Static vs. Dynamic Routing

S/N Static routing Dynamic routing

Dynamic routing
protocol:
1 Initial table population Manual
initial neighbour
exchange
Routing table Dynamic routing
2 Manual
maintenance protocol
Slow – owing to need
Response to topology Can be fast – depending
3 for manual
change on routing algorithm
intervention
Processing overhead
Routing algorithm
4 incurred by routing None
executes on router
process
Network bandwidth Protocol messages sent
5 None
used by routing process by routing algorithm
 Tutorial Notes
1. What fields do you expect to see in a routing table entry?
2. What is a routing metric, what is it used for and how do RIP and OSPF routing metrics differ?
3. Explain route Convergence
4. Why is load balancing important in Routing?
5. Differentiate between static and dynamic routing
6. The sources of the routing table entries are identified by a code, LIST and explain any THREE of these codes
7. Why is static routing response to topology change slow?
8. Considering the routing table entry in TABLE 1, below, sketch the network topology for the network:

10.0.0.0/24 is subnetted, 2 subnets

D 10.1.1.0/24 [90/2170112] via 209.165.200.226, 00:01:30, Serial0/0/0
D 10.1.2.0/24 [90/2170112] via 209.165.200.226, 00:01:30, Serial0/0/0
192.168.10.0/24 is variably subnetted, 2 subnets, 2 masks
C 192.168.10.0/24 is directly connected, GigabitEthernet0/0
L 192.168.10.1/32 is directly connected, GigabitEthernet0/0
192.168.11.0/24 is variably subnetted, 2 subnets, 2 masks
C 192.168.11.0/24 is directly connected, GigabitEthernet0/1
L 192.168.11.1/32 is directly connected, GigabitEthernet0/1
209.165.200.0/24 is variably subnetted, 2 subnets, 2 masks
C 209.165.200.224/30 is directly connected, Serial0/0/0
L 209.165.200.225/32 is directly connected, Serial0/0/0
 Further Reading
Topics that will NOT be
Author Chapters and main topics examined from these
sections
Forouzan 21 Network Layer: Delivery,
(4th edition) Forwarding and Routing

Tanenbaum
5.2 Routing Algorithms
(4th edition) Multicast Routing
(covered in 400 Level)

Stallings
12. Routing in Switched Networks
(7th edition)