Computer Networks _22CS008
Static and Dynamic Routing Algorithms
Lecture 31-33 (Theory)
Prepared by:
Department of Computer Science and Engineering,
Chitkara University, Punjab
Index
1. Routing Algorithm
2. Types of Routing Protocols
3. Static Routing
4. Dynamic Routing
5. Distance Vector Routing
Routing Algorithm
Routing: The process of selecting best
path among the various options
available.
It is of various types: Static, Dynamic
and Default. Routers will maintain
intelligence of the network topology and
forward packets based on destinations,
selecting the best path across that
topology.
Figure: 1 Source to destination Delivery of packets across
different networks
Figure: 2 Router and Bridge Figure: 3 Path Determination
Types of Routing Protocols
Figure: 4 Routing Protocol Classification
Static vs Dynamic Routing
Static vs Dynamic Routing
Static vs. dynamic routes
• Static routes:
▪ For hiding parts of an internetwork.
▪ To test a particular link in a network.
▪ For maintaining routing tables whenever there is only one path
to a destination network.
• Dynamic routes:
▪ Maintenance of routing table.
▪ Timely distribution of information in the form of routing
updates.
▪ Relies on routing protocol to share knowledge.
▪ Routers can adjust to changing network conditions.
Static Routing:Configuration
Figure: 5 Static Routes built by using IP Route Command
Dynamic Routing
Dynamic Routing is a network routing procedure that facilitates the routers to pick
and choose the routing paths depending on the network structure’s logical changes in
real-time. This is opposite to the typical traditional static network routing.
Figure: 6 SCIP-MR1 Dynamic Routing
Dynamic Routing
Dynamic routing, sometimes called adaptive routing, is more complex than static routing because
it creates more possible routes to send packets across a network. Dynamic routes are typically used
in larger, fluid networks where static routes would be cumbersome to maintain and frequently
reconfigure. Because dynamic routing is more complicated, it consumes more bandwidth than
static routing..
Dynamic routing uses algorithms to compute multiple possible routes and determine the best path
for traffic to travel through the network. It uses two types of complex algorithms: distance vector
protocols and link state protocols..
Both distance vector and link state protocols create a routing table within the router that includes
an entry for each possible destination of a network, group of networks or specific subnet. Each
entry specifies which network connection to use to send out a received packet.
Dynamic Routing
Functions of Dynamic Routing Protocols:-
• Dynamically share information between routers.
• Automatically update routing table when topology changes.
• Determine best path to a destination.
Figure: 7 Routers Dynamically Pass Updates
Dynamic Routing
The purpose of dynamic routing protocols includes the following:
• Discovery of remote networks
• Maintaining up-to-date routing information
• Choosing the best path to destination networks
• Ability to find a new best path if the current path is no longer available
Figure: 8 Routing Protocol Operation
Dynamic Routing : Classifying
Classifying Routing Protocols
▪ Dynamic routing protocols are grouped according to
characteristics. Examples include:
✔ RIP
✔ IGRP
✔ EIGRP
✔ OSPF
✔ IS-IS
✔ BGP
Figure: 9 Dynamic Routing Protocols
▪ Autonomous System is a group of routers under the
control of a single authority.
Dynamic Routing : IGP & EGP
Types of routing protocols:
- Interior Gateway Protocols (IGP)
- Exterior Gateway Protocols (EGP)
Figure: 10 IGP vs. EGP Routing
Classifying Routing Protocols Protocols
▪ Interior Gateway Routing Protocols (IGP) –
o Used for routing inside an autonomous system & used to
route within the individual networks themselves –
o Examples: RIP, EIGRP, OSPF
▪ Exterior Routing Protocols (EGP)
o Used for routing between autonomous systems
o Example: BGPv4
IGRP & EIGRP
• Cisco proprietary.
• Interior Gateway Protocol.
• Distance Vector Protocol.
• Metric is compose of bandwidth, load, delay
and reliability.
• Maximum number of hops is 255.
• Updates every 90 seconds.
• EIGRP is an advanced version of IGRP, that is
hybrid routing protocol.
Classification #2: IGP and EGP
• Dynamic routes.
• Interior Gateway Protocols (RIP, IGRP, EIGRP, OSPF):
o Be used within an autonomous system, a network of
routers under one administration, like a corporate
network, a school district's network, or a government
agency's network.
• Exterior Gateway Protocols (EGP, BGP):
o Be used to route packets between autonomous
systems.
Distance Vector Routing
a) The least-cost route between any two nodes is the route
with minimum distance.
b) Each node maintains a vector(table) of minimum distances
to every node.
c) The table at each node also guides the packets to the desired
node by showing the showing the next hop routing.
Example: Assume each node as the cities. Lines as the roads Figure: 11 Distance Vector Routing
connecting them.
Distance Vector Routing
Protocols
Characteristics
• Periodic updates
• Triggered updates
• Exchange information with
Neighbors
• Entire routing table is included
with routing update
Distance Vector Routing
Characteristics of Distance Vector routing protocols:
▪ Periodic updates
• Periodic Updates sent at regular intervals (30 seconds for RIP). Even if the topology
has not changed in several days,
▪ Neighbors
• The router is only aware of the network addresses of its own interfaces and the
remote network addresses it can reach through its neighbors.
• It has no broader knowledge of the network topology
▪ Broadcast updates
• Broadcast Updates are sent to [Link].
• Some distance vector routing protocols use multicast addresses instead of broadcast
addresses.
▪ Entire routing table is included with routing update
• Entire Routing Table Updates are sent, with some exceptions to be discussed later,
periodically to all neighbors.
• Neighbors receiving these updates must process the entire update to find pertinent
information and discard the rest.
• Some distance vector routing protocols like EIGRP do not send periodic routing
table updates.
Hold-Down Timers
Figure: 12 Hold-Down Timers
Dijkstra Algorithm: Shortest path
What does it mean to be the shortest (or optimal) route?
a. Minimize mean packet delay
b. Maximize the network throughput
c. Minimize the number of hops along the path
Dijkstra algorithm:
• Each node is labeled (in parentheses) with its distance from the source node along the
best known path.
• Initially, no paths are known, so all nodes are labeled with infinity.
• As the algorithm proceeds and paths are found, the labels may change, reflecting
better paths.
• A label may be either tentative or permanent.
• Initially, all labels are tentative.
• When it is discovered that a label represents the shortest possible path from the
source to that node, it is made permanent and never changed thereafter.
Now lets see the algorithm which describes this procedure to develop shortest path from
source to destination.
Computer Networks Dr. Veeramanickam M.R.M
Dijkstra Algorithm
Routing table for node A
Figure: 13 Dijkstra Algorithm
Example of formation of shortest path
tree
Figure: 14 Shortest Path Tree
Areas in an autonomous system
Figure: 15 Areas in an autonomous system
Types of links
Figure: 16 Links Classification
Figure: 17 Point-to-Point Link
Contd..
Figure: 18 Transient Link
Figure: 19 Stub Link
Example of an AS and its graphical
representation in OSPF
Figure: 20 Autonomous System
OSPF
• Open Shortest Path First.
• Interior Gateway
Protocol.
• Link State Protocol.
• Metric is compose of
Figure: 21 Graphical Representation cost, speed, traffic,
reliability, and security
• Event-triggered updates.
Path vector routing
Figure: 22 Initial routing tables in path vector routing
Stabilized tables for three autonomous
systems
Figure: 23 Stabilized tables for three autonomous systems
Figure: 24 Internal & external BGP
sessions
DVP (RIP) vs LSP (OSPF)
Classification #3: DVP and LSP
• Distance-Vector Protocols (RIP, IGRP):
o View network topology from neighbor's
perspective.
o Add distance vectors from router to router.
o Frequent, periodic updates.
o Pass copy of routing tables to neighbor routers.
• Link State Protocols (OSPF):
o Gets common view of entire network topology.
o Calculates the shortest path to other routers.
o Event-triggered updates.
o Passes link state routing updates to other routers.
RIP
• Interior Gateway Protocol.
• Distance Vector Protocol.
• Only metric is number of hops.
• Maximum number of hops is 15.
• Updates every 30 seconds.
• Doesn’t always select fastest path.
• Generates lots of network traffic.
Practice Questions
Which of the following routes may be found in a routing table? (Choose all
that apply.)
• directly connected networks
• static routes
• dynamic routing protocol routes
• default route
What action will a router take on a packet with a destination IP address that
is on a remote network?
• It will forward the packet directly to the device with the destination IP address
of the packet.
• It will forward the packet to a next-hop router.
• It will forward the packet to an Ethernet switch.
• It will drop the packet.
What type of routing is typically used with a stub network?
• static routes
• dynamic routing protocol
Practice Questions
True or False? A default route can only be a static route.
• True
• False
Which routing table principle is not correct?
• Every router makes its decision alone, based on the information it has in its own
routing table.
• The fact that one router has certain information in its routing table does not mean
that other routers have the same information.
• Routing information about a path from one network to another also provides
routing information about the reverse, or return, path.
Which type of routing automatically adapts to topology changes?
• static routes
• dynamic routing protocols
• both static routes and dynamic routing protocols
What term is used to describe routing over two or more paths to a destination
with equal cost metrics?
• equal path selection
• oqual packot forward
• equal cost load balancing
• cqual cost routing
