routing protocol,router,computer networks,basic routing protocols figures intra domain and inter domain system autonomus system based protocols.

2. A Routing protocols is a
combination of rules and
procedures that lets router in the
internet inform each other of
changes. it allows routers to
share whatever they know about
the internet of their
neighborhood.

3. INTRADOMAIN INTERDOMAIN
DISTANCE
VECTOR
LINK STATE
PATH
VECTOR
RIP OSPF BGP

4. AUTONOMUS SYSTEM

5.  In distance vector routing, the least-cost
route between any two nodes is the route
with minimum distance.
 In this protocol , as name implies, each node
maintains a vector(table) of minimum
distance to every node
 The table at each node also guides the
packets to the desired node by showing the
next stop in the route(next-hope routing).

6. INITIALIZING
-From table each node knows how to reach any other node and the
cost.
-Each node can send a message to the immediate neighbors and find
the distance between itself and these neighbors.
-the distance for any entry that is NOT a NEIGHBOUR is marked as
infinite(unreachable).
SHARING
-In distance vector routing , each node shares its routing table with its immediate
neighbors periodically and when there is a chnge.
updating
-The table needs to be updated when as soon as there is a change in the internet.
-They need to be updated when a router is down,and whenever a better router has
been found.

7. RIPROUTING INFORMATION PROTOCOL
The routing information protocol(RIP) is an
intradomain routing protocol used inside an
autonomous system. It is very simple protocol
used inside an autonomous system. It is very
simple protocol based on distance vector routing
directly with some consideration.
-Any route in an autonomous system using RIP
can not have more than 15 hopes. so INFINITE is
defined as 16.

8. EXAMPLE OF DOMAIN USING RIP

9.  In link state routing each node in the domain
has the entire topology of the domain like the
list of NODE and LINKS(up or down).
 If there are changes in any point in the
network, the topology must be updated for
each node.

10. CONCEPT OF LINK STATE ROUTING

11. LINK STATE KNOWLEDGE

12. DIJKSTRA ALGORITHM
START
SET ROOT TO LOCAL
NODE AND MOVE IT TO
TENTATIVE LIST.
TENTATVE LIST IS
EMPTY STOP
AMONG NODES IN TENTATVE LIST,MOVE THE ONE
WITH ONE WITH THE SHORTEST PATH TO
PERMANENT LIST.
ADD EACH UNPROCESSED NEIGHBOR OF LAST MOVED NODE TO TENTATIVE
LIST IF NOT ALREADY THERE.IF NEIGHBOR IS IN THE TENTATIVE LIST WITH
LARGER CUMULATIVE COST,REPLACE IT WITH NEW ONE

13. OSPF
OPEN SHORTEST PATH FIRST
The OSPF PROTOCOL is an intradomain routing protocol based
on link state routing. Its domain also an autonomous system.
-AREA
-AREA BORDER ROUTER
-BACKBONE ROUTER
-METRIC(COST)

14. THE AREA IN AUTONOMUS
SYSTEM

15. AN AS AND EXAMPLE OF GRAPHICAL
REPRESANTATION OF OSPF

16. THANK
YOU.