Routing Protocol & Algorithms

ROUTING PROTOCOL & ALGORITHMS
NETWORK LAYER
Delivery
Forwarding
Routing
NETWORK LAYER
DELIVERY
Way a packet is handled by the underlying networks under the control of the
network layer.
FORWARDING
Way a packet is delivered to the next station.
ROUTING
Way routing tables are created to help in forwarding.
DELIVERY
In networks Delivery is of two types
DIRECT DELIVERY
Occurs when the source and destination of the packet are located
on the same physical network or when the delivery is between the last
router and the destination host.
INDIRECT DELIVERY
Destination host is not on the same network as the deliverer.
The packet goes from router to router
DIRECT VS INDIRECT DELIVERY
FORWARDING
Forwarding means to place the packet in its route to its destination.
Forwarding requires a host or a router to have a routing table.
It is impossible in the Internet because the number of entries needed
in the routing table will be more.
SOLUTION
Next-Hop Method Versus Route Method
Network-Specific Method Versus Host-Specific Method
Default Method
NEXT HOP METHOD Vs ROUTE METHOD

Reduce the contents of a routing table.
The routing table holds only the address of the next hop instead of
information about the complete route (route method).
The entries of a routing table must be consistent with one another.
Next-Hop Method Versus Route Method
NETWORK VS HOST SPECIFIC METHOD

A second technique to reduce the routing table
Simplifies the searching process.
Instead of having an entry for every destination host connected to the
same physical network (host-specific method), we have only one entry
that defines the address of the destination network itself.
Network-Specific Versus Host-Specific Method
DEFAULT METHOD
ROUTING TABLE
A host or a router has a routing table with an entry for each
destination, or a combination of destinations, to route IP packets.
Two classifiaction of routing table are
-STATIC
-DYNAMIC
STATIC ROUTING TABLE

A static routing table contains information entered manually by the
administrator.
It cannot update automatically when there is a change in the Internet.
Must be manually altered by the administrator.
A static routing table can be used in a small internet.
DYNAMIC ROUTING TABLE

A dynamic routing table is updated periodically .
Whenever there is a shutdown of a router or breaking of a link, the
dynamic routing protocols update all the tables
Eg.
RIP
OSPF
BGP
- Routing Information Protocol

- Open Shortest Path First Protocol
- Border Gateway Protocol
UNICAST ROUTING PROTOCOLS

Routing protocols have been created in response to the demand for
dynamic routing tables.
A routing protocol is a combination of rules and procedures that lets
routers in the internet inform each other of changes.
It allows routers to share whatever they know about the internet or
their neighborhood.
OPTIMIZATION
Assign a metric(cost) for passing through a network.
The metric assigned to each network depends on the type of protocol.
In RIP - Hop count.
OSPF - Throughput , Delay
BGP - Policy Defined by administrator
INTRA AND INTERDOMAIN ROUTING

An internet can be so large that one routing protocol cannot handle the
task of updating.
Internet is divided into autonomous systems.
An autonomous system (AS) is a group of networks and routers under
the authority of a single administration.
Routing inside an autonomous system is referred to as intradomain
routing
Routing between autonomous systems is referred to as interdomain
routing.
AUTONOMOUS SYSTEM
POPULAR ROUTING PROTOCOLS
DISTANCE VECTOR ROUTING

( Bellman-Ford)
The least-cost route between any two nodes is the route with
minimum distance.
Each node maintains a vector (table) of minimum distances to every
node.
Steps Involved
- Initialization
- Sharing
- Updating
Distance Vector Routing Tables
INITIALISATION
Each node knows how to reach any other node and the cost.
At the beginning each node can know only the distance between itself
and its immediate neighbor.
Each node can send a message to the immediate neighbors and find
the distance.
The distance for any entry that is not a neighbor is marked as infinite
(unreachable).
Initialization In Distance Vector Routing
SHARING
The whole idea of distance vector routing is the sharing of
information between neighbours.
Each node sends its entire table to the neighbor and let the neighbor
decide what part to use.
In distance vector routing, each node shares its routing table with its
immediate neighbors periodically and when there is a change.
UPDATING
When a node receives a two-column table from a
neighbor, it needs to update its routing table.
The receiving node needs to add the cost between
itself and the sending node
Add the name of the sending node to each row as the
third column if the receiving node uses information
Updating In Distance Vector Routing
WHEN TO SHARE
The table is sent both periodically and when there is a change in the
table.
Periodic Update : A node sends its routing table, normally every 30 s.
Triggered Update : When there is a change in routing table.
It is due to failure in the neighboring links.
Two-node instability
Three-node instability
ROUTING INFORMATION PROTOCOL

Intradomain routing protocol.
Based on distance vector routing.
The destination in a routing table is a network.
Distance is defined as the number of links (networks) to reach the
destination. Metric Hop Count
Infinity is defined as 16.
Example of a domain using RIP
LINK STATE ROUTING

Each node in the domain has the entire topology of the domain- the
list of nodes and links, how they are connected including the type, cost
(metric), and condition of the links (up or down).
The node can use Dijkstra's algorithm to build a routing table.
The whole topology can be compiled from the partial knowledge of
each node.
Concept Of Link State Routing
BUILDING ROUTING TABLE

1. Creation of the states of the links by each node, called the link state
packet (LSP).
2. Dissemination of LSPs to every other router, called flooding, in an
efficient and reliable way.
3. Formation of a shortest path tree for each node.
4. Calculation of a routing table based on the shortest path tree.
Dijkstra algorithm
Example of formation of shortest path tree
Routing table for node A
OPEN SHORTEST PATH FIRST OR OSPF PROTOCOL

Intradomain routing protocol based on link state routing.
OSPF divides an autonomous system into areas.
An area is a collection of networks, hosts, and routers all contained
within an autonomous system.
Among the areas inside an autonomous system is a special area called
the backbone to which all areas are connected.
OSPF PROTOCOL
At the border of an area, special routers called area border routers
summarize the information about the area and send it to other areas.
The routers inside the backbone are called the backbone routers. Note
that a backbone router can also be an area border router.
If the connectivity between a backbone and an area is broken, a virtual
link between routers must be created by an administrator to allow
continuity of the functions
Metric Delay or Throughput.
Areas in an autonomous system
In OSPF terminology, a connection is called a link.
Point-to-point link
Transient link
Stub link
Example of an AS and its graphical representation in OSPF

Routing Protocol & Algorithms

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Routing Protocol & Algorithms

Uploaded by

Copyright:

Available Formats

ROUTING PROTOCOL & ALGORITHMS

DIRECT VS INDIRECT DELIVERY

NEXT HOP METHOD Vs ROUTE METHOD

Next-Hop Method Versus Route Method

NETWORK VS HOST SPECIFIC METHOD

Network-Specific Versus Host-Specific Method

STATIC ROUTING TABLE

DYNAMIC ROUTING TABLE

- Routing Information Protocol

UNICAST ROUTING PROTOCOLS

INTRA AND INTERDOMAIN ROUTING

POPULAR ROUTING PROTOCOLS

DISTANCE VECTOR ROUTING

Distance Vector Routing Tables

Initialization In Distance Vector Routing

Updating In Distance Vector Routing

ROUTING INFORMATION PROTOCOL

Example of a domain using RIP

LINK STATE ROUTING

Concept Of Link State Routing

BUILDING ROUTING TABLE

Example of formation of shortest path tree

Routing table for node A

OPEN SHORTEST PATH FIRST OR OSPF PROTOCOL

Areas in an autonomous system

In OSPF terminology, a connection is called a link.

Example of an AS and its graphical representation in OSPF

You might also like