A description and overview of basic routing algorithms such as Link State, Distance Vector and Path Vector Algorithms. Feel free to copy it 

1. Routing Protocols
Group SY4

2. Overview
Routing is a process of selecting the path along which the data can be
transferred from source to the destination. Routing is performed by a
special device known as a router.
Routing metrics and costs are used for determining the best route to the
destination. The factors used by the protocols to determine the shortest
path, these factors are known as a metric.

3. Metrics
The most common metrics are:
● Hop Count
● Delay
● Bandwidth
● Load
● Reliability

4. Example of a Network

5. Default Routing

6. Default Routing
Default Routing is a technique in which a router is configured to send all the
packets to the same hop device, and it doesn't matter whether it belongs to a
particular network or not. A Packet is transmitted to the device for which it is
configured in default routing.

7. Static Routing

8. Static Routing
Static routing is a form of routing that occurs when a router uses a
manually configured routing entry, rather than information from a
dynamic routing traffic. Static routing can be used in stub networks,
or to provide a gateway of last report.

9. Features
● Minimal Load on CPU
● Full Administrative Control
● Easier to Configure
● Not Suitable for Larger Networks
● Time Consuming to Manage
● Problems on Link Failure

10. Uses:
● Static routing can be used for small networks that require only one or
two routes
● Static routing is often used to help transfer routing information from
one routing protocol to another( routing redistribution ).
● Complement to Dynamic Routing.

11. Example

12. Dynamic/Adaptive Routing

13. Dynamic/Adaptive Routing
Dynamic routing, also called adaptive routing, is a process where a router can
forward data via a different route or given destination based on the current
conditions of the communication circuits within a system
Dynamic routing protocols can be classified in several ways.:
● Interior and exterior gateway routing protocols
● Distance vector, path vector and link state routing protocols
● Classful and classless

14. Link State
Two phases
● Reliable Flooding
● Path calculation

15. Flooding
Link State Messages Used:
● Hello
● Database description
● Link-state request
● Link-state update
● Link-state acknowledgement

19. Distance Vector
A distance-vector routing (DVR) protocol in data networks determines the best route for
data packets based on distance. A DVR protocol requires that a router inform its
neighbors of topology changes periodically.
Bellman Ford – Each router maintains a Distance Vector table containing the distance
between itself and ALL possible destination nodes. Distances,based on a chosen metric,
are computed using information from the neighbors’ distance vectors.
Dx(y) = min { C(x,v) + Dv(y), Dx(y) } for each node y ∈ N

20. Algorithm
1. A router transmits its distance vector to each of its neighbors in a routing packet.
2. Each router receives and saves the most recently received distance vector from each of
its neighbors.
3. A router recalculates its distance vector when it receives a distance vector from a
neighbor containing different information than before.

21. Characteristics
● Periodic Updates
● Asynchronous
● Distributed
● Iterative

22. Distance Vector Table

23. B sends vector to A..

24. Until Convergence...

25. Path Vector
Path Vector Routing is a routing algorithm in unicast routing protocol of
network layer, and it is useful for interdomain routing.
The principle of path vector routing is similar to that of distance vector
routing. It assumes that there is one node in each autonomous system that
acts on behalf of the entire autonomous system, and is called Speaker node.

26. Functions
● Prevention Of Loop
● Policy Routing
● Optimum Path

27. Initial routing tables in path vector routing

28. BOOT TIME PATH VECTORS

29. UPDATING THE PATH VECTORS

30. Thank You