Network Routing:

An Introduction to
Routing algorithms Dr.Shiny Duela J
Associate Professor
 ○ Network routing - ability of an electronic communication 2

network to send a unit of information from point A to point B

by determining a path through the network, and by doing so
efficiently and quickly.
Network Routing ○ The determination of an efficient path depends on a number of
factors
○ key and necessary factor-addressing
◦ addressing and how it is structured and used plays a
critical role
◦ addressing in a communication network has similarities
to postal addressing in the postal system.
○ address hierarchy
 3

Network Routing ○ In an electronic communication network, how does addressing

work for routing a unit of information from one point to
another
○ is there any relation to the postal addressing hierarchy that we
have just discussed?
○ Secondly, how is service delivery provided?
 4
 Internet addressing = postal addressing system
 Addressing in the Internet - Internet Protocol (IP) addressing
Internet  An IP address defines two parts:
Addressing  one part =the postal code and the other part = the house
Overview address;
 In Internet terminology, they are known as the netid and the
hostid, to identify a network and a host address
 A host is the end point of communication in the Internet
 Communication starts here
 Eg: web server, an email server, and certainly a desktop or
laptop, or a hand-held device use for accessing the Internet.
 5
 Need delivery model for the Internet.
 For example, in the postal system, one can request
Internet guaranteed delivery for an additional fee
Addressing  The Internet’s conceptual framework-TCP/IP (Transmission
Overview Control Protocol/Internet Protocol), relies on a delivery model
in which TCP - reliable delivery of information, while IP -
routing, using the IP addressing mechanism.
 IP protocol doesn’t worry about reliable delivery or loss of
data packets
 A key difference in the Internet, as opposed to the postal system 6
 sending host first sends a beacon to the destination address
(host) to see if it is reachable
Internet  waits for an acknowledgment back before sending the actual
Addressing message.
Overview  beacon also uses the same transmission mechanism,i.e., IP
 it is possible that it may not reach the destination
 another mechanism known as a timer is used-sent repeatedly
until ack comes-limit on the maximum number of attempts.
 when the sending host sends its beacon, it must also include its
source IP address.
 packet or datagram-Maximum Transmission Unit (MTU).
 7
 Eg: a group of one hundred friends wanting to go to a game
 Each packet is then labeled with both the destination and the
Internet source address
Addressing  IP delivery mechanism is assumed to be unreliable-packet
Overview possibly get lost-retransmitted if the timer associated with this
packet expires
 reassembled in the proper order before delivering the
document.
 acknowledgment and retransmission mechanism is used for
most well-known applications on the Internet such as web or
email.
 8
 The whole world is digitalized and connected over the
network
 Packets - the atomic unit of information in packet-switched
Introduction to communication networks, are exchanged between the nodes
Routing
 The process of transferring these packets of information from
their source node to the destination node with one or more
hops in between along the most optimum path is called as
‘Routing’.
 Routers and switches are the devices that are used for the
purpose
 routing protocols and algorithms they are configured with.
 The routing of packets is taken care of by the L3 layer or the
network layer of the OSI Reference Model.
 a network link that connects two routers - limited by how much data it
can transfer per unit of time-bandwidth or capacity of a link. represented 9
by a data rate, such as 1.54 Megabits per sec (Mbps)

Introduction to
Routing

Cross Points

read the destination address marked in an incoming IP packet, consult its

traffic in a internal information to identify an outgoing link to which the packet is to
be forwarded, and then to forward the packet.
network refers to
packets
generated by Traffic increases, packets are queued at routers or even dropped-router
different maintains finite amount of space-buffer-temporarily store backlogged
applications packets-possible to reach the buffer limit
  a data packet is possibly corrupted - an electrical signaling problem on a
10
communication link - garbling of a packet- same as a lost packet
 for efficient delivery of packets:

Introduction 1) routers with a reasonable amount of buffer space,

to Routing 2) links with adequate bandwidth,
3) actual transmission having minimal error (to minimize packets
being garbled), and
4) the routers being very efficient in switching a packet to the
appropriate outgoing link.
 two netids - look close in their actual numbering -geographically far
away, core routers in the Internet -keep an explicit list of all valid netids
along with - identified outgoing link -when a packet arrives - router
knows which way to direct the packet
  The list of valid netids (IP prefixes) - 650,000 entries.
11
 Thus, to minimize switching time at a router-mechanisms are needed to
look up an address, identify the appropriate outgoing link (direction), and
process the packet quickly - processing delay can be as minimal as
Introduction possible.
to Routing  routing table
 routing protocol
 Routing Algorithm
 forwarding table
 Forwarding Information Base (FIB)
 traffic engineering
 architecting a network
 Classification of Routing Algorithm 12

Adaptive Routing algorithm

◦ Non Adaptive routing algorithm is also known as a static routing algorithm.
◦ When booting up the network, the routing information stores to the routers.
◦ Non Adaptive routing algorithms do not take the routing decision based on
the network topology or network traffic.
Non-adaptive Routing algorithm
◦ An adaptive routing algorithm is also known as dynamic routing algorithm.
◦ This algorithm makes the routing decisions based on the topology and
network traffic.
◦ The main parameters related to this algorithm are hop count, distance and
estimated transit time.
Basis Of Comparison Adaptive Routing algorithm Non-Adaptive Routing algorithm
13

Define Adaptive Routing algorithm is an algorithm The Non-Adaptive Routing algorithm

that constructs the routing table based on the is an algorithm that constructs the static
network conditions. table to determine which node to send
the packet.

Usage Adaptive routing algorithm is used by The Non-Adaptive Routing algorithm

dynamic routing. is used by static routing.

Routing decision Routing decisions are made based on Routing decisions are the static tables.
topology and network traffic.

Categorization The types of adaptive routing algorithm, are The types of Non Adaptive routing
Centralized, isolation and distributed algorithm are flooding and random
algorithm. walks.

Complexity Adaptive Routing algorithms are more Non-Adaptive Routing algorithms are
complex. simple.
14