Sulaimani Polytechnic University

Technical College of Informatic (TCI)

IT Department

Computer Networks II
By: Rebeen Rebwar
Agenda

• Introducing routers and routing

• Router vs. L3 Switch

• Types of Routing
 Static Routing

 Default Routing

 Dynamic Routing
What is a Router?

• A router is a layer 3 device

• Used for interconnecting networks at layer 3

• A router generally has at least two interfaces

What is a Router?
The Routing Table

• Each router/host has a routing table, indicating the path or the next hop for
a given destination host or a network

• The router tries to match the destination address of a packet against entries
in the routing table

• If there is a match, the router forwards it to the corresponding gateway

router or directly to the destination host

• Default route is taken if no other entry matches the destination address

The Routing Table
Router vs. L3 Switch
Attribute Layer 3 Switch Router
WAN for office, data center and campus
Scope LAN for office, data center and campus environment
environment

Routes across different networks across WAN are

Key Functionality Routes across different subnets or VLANs on a campus LAN
communicated and routed by a router

Edge Technologies
Not supported NAT, firewalling, tunneling, IPSec
Support
Considerably bigger to support multiple route
Size of Routing Table Smaller routing table compared to router
entries
Ethernet ports (copper/fiber), interfaces like SONT,
Interface Support Ethernet ports (copper/fiber)
OC-N, T1/T3 etc.
Throughout High throughput Lower than Layer 3 switches

Switching Capacity High switching capacity Lower than Layer 3 switches

Cost Low cost High cost

Port Density High Low

Types of Routing

• Types of Routing
• Static Routing

• Default Routing

• Dynamic Routing
Types of Routing
Static Routing

• static routes are mainly configured when routing from a particular network
to a stub network.
• Router(config)# ip route 192.168.3.0 255.255.255.0 [next-hop ip address / exit interface]
Static Routing Example

• R1(config)# ip route 192.168.3.0 255.255.255.0 192.168.2.4

• R1(config)# ip route 192.168.4.0 255.255.255.0 192.168.2.4

Default Route

• static routes are mainly configured when routing from a particular network
to a stub network.
• Router(config)# ip route 0.0.0.0 0.0.0.0 [next-hop ip address/ exit interface]
Default Route Example

• R1(config)# ip route 0.0.0.0 0.0.0.0 12.145.3.2

• Or
• R1(config)# ip route 0.0.0.0 0.0.0.0 s0/0/0
Dynamic Routing
Dynamic Routing

• Dynamic routing makes automatic adjustment of the routes according to the

current state of the route in the routing table. Dynamic routing uses
protocols to discover network destinations and the routes to reach it.

Dynamic protocol have following features:

 The routers should have the same dynamic protocol running in order to exchange routes.

 When a router finds a change in the topology then router advertises it to all other routers.
Routing Protocols Timeline
• 1982 – EGP

• 1985 – IGRP

• 1988 – RIPv1

• 1990 – IS-IS

• 1991 – OSPFv2

• 1992 – EIGRP

• 1994 – RIPv2

• 1995 – BGP

• 1997 – RIPng

• 1999 – BGPv6 and OSPFv3

• 2000 – IS-ISv6
Distance Vector
Distance Vector Routing Protocol
• Distance Vector Protocols advertise their routing table to every directly connected neighbor at specific time
intervals using lots of bandwidths and slow converge. In the Distance Vector routing protocol, when a route
becomes unavailable, all routing tables need to be updated with new information.

 Advantages:

• Updates of the network are exchanged periodically, and it is always broadcast.

• This protocol always trusts route on routing information received from neighbor routers.

 Disadvantages:

• As the routing information are exchanged periodically, unnecessary traffic is generated, which consumes
available bandwidth.
Distance Vector Example RIP

• Routing Information Protocol or RIP is one of the first routing protocols to be

created. There are multiple versions of RIP including RIPv1 and RIPv2. The original
version or RIPv1 determines network paths based on the IP destination and the
hop count of the journey.

• RIPv2 is a little more sophisticated than this and sends its routing table on to a
multicast address. RIPv2 also uses authentication to keep data more secure and
chooses a subnet mask and gateway for future traffic. The main limitation of RIP is
that it has a maximum hop count of 15 which makes it unsuitable for larger
networks.
RIP Configuration

• R1#configure terminal

• R1(config)#router rip

• R1(config-router)#network 192.168.1.0

• R1(config-router)#network 192.168.2.0

• R1(config-router)#end
EIGRP

• Enhanced Interior Gateway Routing Protocol or EIGRP is an advanced

distance vector routing protocol. EIGRP was a Cisco proprietary protocol (till
2013) that was designed to follow on from the original IGRP protocol. When
using EIGRP, a router takes information from its neighbors’ routing tables and
records them.
EIGRP Configuration

• R1(config)#router eigrp 1

• R1(config-router)#no auto-summary

• R1(config-router)#network 192.168.1.0

• R1(config-router)#network 192.168.2.0
Additional Information

• Administrative distance: is the feature that routers use in order to select the
best path when there are two or more different routes to the same
destination from two different routing protocols. Administrative distance
defines the reliability of a routing protocol. Each routing protocol is
prioritized in order of most to least reliable (believable) with the help of an
administrative distance value.
Administrative Distance Table
Route Source Default Distance Values
Connected interface 0
Static route 1

Enhanced Interior Gateway Routing Protocol (EIGRP) summary route 5

External Border Gateway Protocol (BGP) 20

Internal EIGRP 90
IGRP 100
OSPF 110
Intermediate System-to-Intermediate System (IS-IS) 115

Routing Information Protocol (RIP) 120

Exterior Gateway Protocol (EGP) 140
On Demand Routing (ODR) 160
External EIGRP 170
Internal BGP 200
Unknown* 255
Administrative distance vs. Metrics

• As opposed to administrative distance, metrics involve a single routing

protocol. They have nothing to do with multiple sources for routes. Different
routing protocols calculate their metric in different ways. RIP uses hops,
OSPF uses bandwidth, and EIGRP uses a combination of bandwidth, delay,
load, and reliability.
Metrics

Protocol Type
Type of Metric Used

Hop count
RIP

Hop count
RIPv2

Bandwidth, Delay
IGRP

OSPF Bandwidth
Chosen by administrator
BGP

EIGRP Bandwidth, Delay

IS-IS
Chosen by administrator
Link State
Link State Routing Protocols

• Link state protocols find the best routing path by sharing information with
other routers in proximity. The route is calculated based on the speed of the
path to the destination and the cost of resources.

• One of the key differences to a distance vector protocol is that link state
protocols don’t send out routing tables, instead, routers notify each other
when route changes are detected.
Link State Routing Protocols

Distance Vector Link State

Distance Vector protocol sends the entire routing table. Link State protocol sends only link-state information.

It is susceptible to routing loops. It is less susceptible to routing loops.

Updates are sometimes sent using broadcast. Uses only multicast method for routing updates.

It is simple to configure. It is hard to configure this routing protocol.

Does not know network topology. Know the entire topology.

Example RIP, IGRP. Examples: OSPF IS-IS.

OSPF

• Open Shortest Path First (OSPF) is a standard routing protocol supported by practically every routing
vendor and open source community, OSPF is one of the few protocols in the IT industry you can count on
being available just about anywhere you might need it. defined in RFC 2328, is an Interior Gateway Protocol
used to distribute routing information within a single Autonomous System.

• The OSPF protocol is a link-state routing protocol, which means that the routers exchange topology
information with their nearest neighbors. The topology information is flooded throughout the AS, so that
every router within the AS has a complete picture of the topology of the AS.
OSPF Concepts: Area

• Areas in OSPF are collections of routers grouped together. With the exception of area
border routers, OSPF routers in one area don’t neighbor with routers in other areas. Among
other reasons, areas were once used to scale large OSPF networks.

• The most important area in OSPF is the backbone area, also known as area 0. The backbone
area is the area that all OSPF areas must traverse to get to other OSPF areas.
OSPF Concepts: DR & BDR

• Designated Router (DR) and a Backup Designated Router (BDR) is to act as a central point
for exchanging of OSPF information between multiple routers on the same network. Each
non-DR and non-BDR router only exchanges routing information with the DR and BDR,
instead of the exchanging updates with every router on the segment. This significantly
reduces the amount of OSPF routing updates sent across the network..
OSPF Concepts: DR & BDR Election

• Upon the segment, each router will go through an election process, to elect a DR and BDR.
There are two rules used to determine who is elected:

 Priority - Router with the highest wins the election. The default priority is 1. This is
configured on a per-interface level.

 Router ID - If there is a tie, the highest router ID wins the election.

OSPF Concepts: Cost

• Open Shortest Path First (OSPF) uses "Cost" as the value of metric and uses a Reference
Bandwidth of 100 Mbps for cost calculation. The formula to calculate the cost is Reference
Bandwidth divided by interface bandwidth. For example, in the case of 10 Mbps Ethernet ,
OSPF Metric Cost value is 100 Mbps / 10 Mbps = 10.
OSPF Concepts: Cost
Line Bandwidth Metric calculation Cost
56 Kbps line 56Kbps 100000000/56000 = 1785.71 1785

64 Kbps line 64Kbps 100000000/64000 = 1562.5 1562

128 Kbps line 128Kbps 100000000/128000 = 781.25 781

512 Kbps line 512 Kbps 100000000/512000 = 195.31 195

1 Mbps line 1Mbps 100000000/1000000 = 100 100

10 Mbps line 10Mbps 100000000/10000000 = 10 10

100 Mbps line 100Mbps 100000000/100000000 = 1 1

1 Gbps line 1Gbps 100000000/100000000 0= 0.1 1

10 Gbps line 10Gbps 100000000/10000000000 = 0.01 1

OSPF Implementation Single Area

• R1(config)#router ospf 1

• R1(config-router)#network 192.168.2.0 0.0.0.255 area 0

• R1(config-router)#network 192.168.1.0 0.0.0.255 area 0

• R2(config)#router ospf 1

• R2(config-router)#network 192.168.2.0 0.0.0.255 area 0

• R2(config-router)#network 192.168.3.0 0.0.0.255 area 0

OSPF Path Cost Calculation
OSPF network types

• Point-to-Point

• Broadcast

• Non-Broadcast

• Non-Broadcast Multi-Access (NBMA)

• Point-to-Multipoint
Broadcast
By default, OSPF considers the network type as broadcast. On a broadcast
network, hello, LSU, and LSA packets are multicast to 224.0.0.5 that identifies
all OSPF routers or to 224.0.0.6 that identifies the DR and BDR.
Point-to-Point
A Point-to-Point network type is a connection between two specific points (or
OSPF routers). On a point-to-point link, a packet delivered from one of the
routers will always have precisely one recipient. It does not maintain a DR/BDR
relationship, and it has a 10-second hello and 40-second dead timer. Leased
lines running Point-to-Point Protocol (PPP) and High-Level Data Link Control
(HDLC) are some examples of point-to-point links.
 Sulaimani Polytechnic University
Technical College of Informatic (TCI)
IT Department

Computer Networks II
By: Rebeen Rebwar