Data Communications

(ELE 17 & ELE 17L)

Online Kamustahan
Sunday | August 9, 2020 | 9pm

Prepared by:
Engr. Jepp Quijano | TUP - ECE
1
 Part I
Introduction to Routing
Fundamentals

2
Routing
• The process of informing a local router about
all the remote network addresses and the
routes how to get to those remote networks.
Router2

Router1 INTERNET

Router3
4
Router
• A device that routes or
forward packets.
• Contains and connect the
internal network from the
outside network (the Internet).
• Every port is a broadcast
domain.
5
Router

6
Default Gateway
• acts as the gateway of a certain network to
send traffic outside its own subnet.
• is usually the first usable IP of a network
subnet configured on the interface of a
router facing the LAN.

7
Default Gateway

8
 How do
routers work?
9

Hi Router! I want to send a
message destined to this IP
address: 192.168.7.21. Can
you help me?
Hi PC_A! I just received
your request through your
default gateway. Sure that I
can help you, let me check
in my routing table.
10
11
Aha! Based on my routing table,
192.168.7.21 belongs to
192.168.7.0/24 network with a
default gateway of 192.168.7.1 Gotcha! Already received the
connected via interface request of PC_A. Thanks to you
GigabitEthernet 0/1. router! ^_^

12
Why do we need routers?

VS

13
Why do we need routers?

14
Why do we need routers?

15
Routing Sources

• Connected
interfaces
• Static routes
• Dynamic routes or
Routing Protocols

17
Administrative Distance
• the numerical identifier used by a router to
determine which is the best path it will take to
forward traffic to its destination when several
routing protocols are present in the
configuration.
• The router will decide the best path according
to the lowest administrative distance.
18
Administrative Distance
ROUTING DEFAULT ADMINISTRATIVE
PROTOCOLS DISTANCE
Directly connected 0
Static route 1
EIGRP 90
OSPF 110
RIP 120
Unknown 255

19
Metrics
• another numerical identifier in which the
router use when there are two or more
possible paths going to a destination
network with the same routing protocols.
• With the same routing protocol, the router
will choose the best path with the lowest
metrics.
20
Metrics

ROUTING
METRICS
PROTOCOLS
RIP hop counts (routers in between)
EIGRP bandwidth & delay
OSPF cost

21
22
Directly connected routes

• these are routes learned and added to the

routing table as certain networks or
subnets are configured directly on router
interfaces.

23
Directly connected routes

24
Directly connected routes

25
Static routes

• these are routes learned by the router

because we force or manually instruct
the router to go on this path going to its
destination.
• unchanged or fixed route.

26
Static routes

27
Default routes

• one type of static routing.

• used to route network or IP’s into a certain
destination that is not in the routing
table.
• used only by stub routers.

28
Floating Static/Default routes
• Backup static or default route.

30
Dynamic routes

• learned routes because of routing

protocols.
• Route entries in the routing table are added
dynamically and automatically because of
the routing protocol implemented on the
router itself.
31
 Part II
Introduction to Different
Routing Protocols

32
Routing Protocols
• are the means by which routers
automatically and dynamically exchange
next-hop reachability information with
each other.
• Routing protocols are either distance
vector routing protocols, link-state
routing protocols or hybrid.
33
Interior and Exterior Gateway
Routing Protocols

34
Interior Gateway Protocol

• Routing protocols used to disseminate

information to maintain routing tables and
establish pathways inside an
autonomous system.
• Such routing protocols are RIP, EIGRP,
and OSPF routing protocols.
35
Exterior Gateway Protocol

• designed to route packets in between

these different autonomous systems or
routing protocols designed to route
packets outside your network
infrastructure.
• BGP and IS-IS are the most common EGP.
37
38
AS23930

39
Distance Vector and Link-
State Routing Protocols

40
Distance Vector Routing Protocol

• concerned with the direction (vector) in

which the destination lies and some
means of measurement (metric) it takes to
reach that destination.
• Only knows what the neighbor tells it.
• Loop prevention mechanisms needed.
41
Distance Vector Routing Protocol

RIP
BGP
EIGRP

42
Link-State Routing Protocol

• as the name implies, designed to advertise

the state and metrics of all the links in the
network.
• faster network convergence because it
maintains a map of the network system.
• maintains loop free by nature.
43
44
Link-State Routing Protocol

OSPF
IS-IS

45
Table Summary
ROUTING
IGP EGP DV LS
PROTOCOLS
RIP √ √
EIGRP √ √ (adv)
OSPF √ √
BGP √ √ (adv)
IS-IS √ √

46
RIP Routing Protocol
• Routing Information Protocol (RIP) is a
true distance-vector routing protocol.
• Administrative Distance is 120.
• RIP permits a hop count of up to 15, so
anything that requires 16 hops is deemed
unreachable.
47
RIP Routing Protocol

• RIP sends the complete routing table out

to all active interfaces every 30 seconds
(RIP updates occur every 30 seconds).
• RIP version 2 does send subnet mask
information with the route updates. This is
called classless routing.
48
RIP Routing Protocol
• RIP only uses hop count to determine the
best way to a remote network (a hop is a
router).
• Supports VLSM & discontiguous
networks.
• RIP needs loop prevention mechanisms.
49
RIP Routing Protocol

50
OSPF Routing Protocol
• Open Shortest Path First (OSPF) is a
complex link-state routing protocol.
• Most widely used IGP routing protocol in
the industry.
• Non-proprietary routing protocol.
• Designed for IPv4 (OSPFv2) and IPv6
(OSPFv3).
51
OSPF Routing Protocol
• It uses the Dijkstra SPF Algorithm.
• It works for simple (Single Area) networks
and advanced (Multi- Area) networks.
• Faster network convergence as it
maintains the map of the whole
topology of the network (maintains
LSDB).
52
DIJKSTRA SPF ALGORITHM
100 𝑚𝑏𝑝𝑠
𝐶𝑜𝑠𝑡 =
𝑏𝑎𝑛𝑑𝑤𝑖𝑑𝑡ℎ

53
Single Area OSPF

54
Multi-Area OSPF

55
NEIGHBOR RELATIONSHIP
1. Determine your own Router ID.
• The router ID is simple the router’s name
in the OSPF process.
• It is the highest active interface IP
address when OSPF starts.
• Note: Loopbacks beat physical interfaces.
Router ID can also be hardcoded.
56
NEIGHBOR RELATIONSHIP
2. Creates link-state databases.
• Add interfaces to the link-state databases.
• Dictated by the ‘network’ command

57
NEIGHBOR RELATIONSHIP
3. Send a ‘hello’ message on chosen
interfaces.
• Once every 10 seconds on broadcast/p2p
networks.
• Once every 30 seconds on NBMA
networks.
58
59
NEIGHBOR RELATIONSHIP
3. Send a ‘hello’ message on chosen
interfaces.
• Contains all sort of information such as:
- Router ID - Neighbors
- Hello and Dead Timers* - Router Priority
- Network Mask* - DR/BDR IP
- Area ID* - Authentication pwd
60
NEIGHBOR RELATIONSHIP

4. Receiving the ‘hello’ message.

• Check the hello/dead intervals.
• Check the subnet masks.
• Check the Area ID.
• Check the authentication passwords.
61
NEIGHBOR RELATIONSHIP

5. Send ‘reply hello’ (acknowledgement).

• The router confirms if it is already listed as
a neighbor.
• If yes, reset the dead timer.
• If no, add as new neighbor.
62
NEIGHBOR RELATIONSHIP
6. Determination of Master-Slave
relationship.
• determined by “priority”; Router ID breaks
the tie.
• Master sends database description
(DBD) packet.
• Slave sends its DBD packet.
63
NEIGHBOR RELATIONSHIP

7. DBDs are acknowledged and reviewed.

• Slave requests details (LSR)
• Master sends updates (LSU)
• Master requests details (LSR)
• Slave sends updates (LSU)
64
NEIGHBOR RELATIONSHIP

65
NEIGHBOR RELATIONSHIP

Initialize / Sends to
Link Change neighbor
Router creates LS Neighbor updates
database / LS LS database
advertisements

Forwards
Routers are in full LSA to other
state.
neighbors

66
OSPF SAMPLE LAB

67
EIGRP Routing Protocol
• Enhanced Interior Gateway Routing
Protocol (EIGRP) is an advanced
distance vector routing protocol.
• EIGRP is classified also by the industry
community as hybrid routing protocol.
• Cisco proprietary standard until 2013.
68
EIGRP Routing Protocol
• Supports VLSM and discontiguous
networks.
• It chooses the best path using the
Diffusing Update Algorithm (DUAl)
which guarantees loop-free paths and
backup paths throughout the routing
domain.
69
70
EIGRP Routing Protocol
• Supports VLSM and discontiguous
networks.
• It chooses the best path using the
Diffusing Update Algorithm (DUAl)
which guarantees loop-free paths and
backup paths throughout the routing
domain.
71
EIGRP Routing Protocol

• Uses bandwidth and delay in calculating

the metrics through the diffusing update
algorithm.

100 𝑚𝑏𝑝𝑠 𝑠𝑢𝑚 𝑜𝑓 𝑑𝑒𝑙𝑎𝑦(𝜇𝑠𝑒𝑐)

𝑚𝑒𝑡𝑟𝑖𝑐𝑠 = + ∗ 256
𝑠𝑙𝑜𝑤𝑒𝑠𝑡 𝑏𝑎𝑛𝑑𝑤𝑖𝑑𝑡ℎ 𝑘𝑏𝑝𝑠 10

72
EIGRP Routing Protocol

Router(config)# router eigrp <AS number>

Router(config-router)#network <network add>
Router(config-router)#no auto-summary

73
BGP Routing Protocol
• Border Gateway Protocol (BGP) is the
slowest yet the biggest routing protocol in
the world.
• BGP is the routing protocol of the
Internet.
• BGP is a distance vector routing protocol
and an exterior gateway protocol.
74
BGP Routing Protocol
• Forms neighbor relationship through
autonomous system (AS) peering.
• It requires an IGP to advertise routes to
another autonomous systems.

75
BGP Routing Protocol

76
 Thank you!
Stay safe and God bless,
Future Electronics / Network Engineers!
☺

- Sir Jepp

77