Scribd
Upload
6 views

Lecture 2 Routing Protocol

Uploaded by

Bushra Qadr
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
6 views

Lecture 2 Routing Protocol

Uploaded by

Bushra Qadr
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 19

Lecture 2

Introduction to
Dynamic Routing Protocols

Mr. Ababakr I Rasul

[email protected]
Introduction to Dynamic Routing Protocols

Introduction to
Dynamic Routing Protocols
Perspective and Background

• Dynamic routing protocols have evolved over several years.


• As networks have evolved and become more complex, new
routing protocols have emerged.
• The first version of RIP was released in 1982, but some of
the basic algorithms within the protocol were used on the
ARPANET as early as 1969.
Role of Dynamic Routing Protocol

• Exchange of routing information between routers.


• Dynamically learn information about remote networks and
add routes to routing tables.
• Determines the best path to each network.
• Automatically finds alternate paths if needed.
Network Discovery and Routing Table

• Components of Dynamic Routing Protocols:


• Data Structures:
• Tables or databases for their operations, kept in RAM.
• Algorithm:
• An algorithm is a finite list of steps used in
accomplishing a task.
• Used for processing routing information and for best-
path determination.
• Routing Protocol Messages:
• Discover neighboring routers.
• Exchange, learn and maintain accurate network
routing information.
Dynamic Routing vs Static Routing
Distance Vector and Link State

• Distance Vector:
• Routes are advertised as vectors of distance and
direction.
• Distance:
• Is defined in terms of a metric.
• Hop Count: The number of routers between the
source and destination networks.
• Direction:
• Is simply the next-hop router or exit interface.
• Routing updates usually consist of periodic updates of the
entire routing table.
Distance Vector and Link State

• Link State:
• A Link State routing protocol can create a complete map
of the network topology.
• A link-state router:
• Receives an update.
• Builds a topology database.
• Uses a Shortest Path First (SPF) algorithm to create
its view of the network.
• Builds the routing table.
• Routing updates (not the entire table) are only sent to
neighbouring routers when the topology changes.
Distance Vector and Link State

• Link State:
• The network design is
hierarchical, usually
occurring in large
networks.
• The administrators have
a good knowledge of the
implemented link-state routing protocol.
• Fast convergence of the network is crucial.
Classful and Classless

• Classful Protocols:
• Do not send subnet mask information in routing updates .
• The subnet mask must be the same throughout the entire topology.
• IP Addresses were first allocated based on classes (A, B or C).
• The first routing protocols (RIP) did not need to transmit the
subnet mask because of the address class distinction.
• Network mask could be determined based on value of first octet
of the network address.
• VLSM and CIDR are not possible.
Classful and Classless
• Classless Protocols:
• Include subnet mask information in routing updates .
• The subnet mask does not have to be the same throughout the
entire topology.
• Today’s networks are no longer allocated based on the
address class.
• The subnet mask can no longer be determined by the first
octet of the IP Address.
• VLSM and CIDR are possible.
Purpose of a Metric

To route to..

?
• There are times when a router will have multiple paths to the
same destination.
• Metrics are a way to measure and/or compare routes to
determine which route is the best path.
Purpose of a Metric

To route to..

?
• The route chosen will depend on two things:
• The routing protocol in use.
• The metric used by the routing protocol.
Metrics and Routing Protocols

172.16.2.0/24

Network
This172.16.2.0
is the is:
1 hopIvia
route willR2
use.
2 hops via R3

• Routing Information Protocol (RIP):


• Uses hop count as its metric. Lower is better.
Metrics and Routing Protocols

172.16.2.0/24

The route to network


172.16.2.0/24 is:the
This is
56 Kbps
route through
I will use.R2
1.54 Kbps through R3

• Open Shortest Path First (OSPF):


• Uses bandwidth as its metric. Faster is better.
Metric Filed in the Routing Table

• The routing table displays the metric for each dynamic and
static route.
• Dynamic routes with the lowest metric are installed by
routing protocols.
• Static routes always have a metric of 0.
Metric Field in the Routing Table

• All routers are running RIP.


• R2 has a route to 192.168.8.0 and is 2 hops away.
Load Balancing

• What happens when two or more routes to the same


destination have identical metric values?
• The router load balances among all equal-cost paths.
Purpose of Administrative Distance (AD)

• Administrative Distance is used to Route Source AD


determine which route is to be
installed in the routing table. Direct Connect 0
• The route that has the lower AD
will be preferred over the route with Static 1
the higher AD and will be added to
the routing table. Internal EIGRP 90

• The term trustworthy is OSPF 110


commonly used when defining
administrative distance. RIP 120
• The lower the administrative
distance value, the more
“trustworthy” the route.

You might also like