0% found this document useful (0 votes)
10 views11 pages

Module 7-Routing Fundamentals

The document discusses routing fundamentals and types of routing including static and dynamic routing. It describes Open Shortest Path First (OSPF) and Enhanced Interior Gateway Routing Protocol (EIGRP), comparing their features and advantages.

Uploaded by

John Ivan Maurat
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
10 views11 pages

Module 7-Routing Fundamentals

The document discusses routing fundamentals and types of routing including static and dynamic routing. It describes Open Shortest Path First (OSPF) and Enhanced Interior Gateway Routing Protocol (EIGRP), comparing their features and advantages.

Uploaded by

John Ivan Maurat
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 11

ROUTING

FUNDAMENTALS
ROUTING

Routing is a crucial aspect of


computer networking that
involves determining the path
that data packets should take to
reach their destination.
TYPES OF ROUTING:
Static Route:
This is a special route that is manually configured by a
network administrator. This can be an effective method for
networks with small and simple structures and reduce the
effect of bandwidth and CPU resource consumption that
occurs when other protocols are implemented.
TYPES OF ROUTING:
Dynamic Route:
This route uses routingprotocols to talk to other routers and
find out what networks they are attached to. Also, the
information is responsive to changes in the network so that it
is constantly being updated. Larger networks require the
dynamic routing method because there are usually too many
addresses and constant changes, which, if not acted on
immediately, will result in loss of connectivity.
OPEN SHORTEST PATH FIRST (OSPF)

It is highly scalable and converges


quickly, making it suitable for
enterprise-level networks.
OSPF calculates the shortest path to
each network using Dijkstra's
(dike·struhz al·)algorithm
OSPF is a link-state routing protocol
designed for large and complex
networks.
OPEN SHORTEST PATH FIRST (OSPF)
OPEN SHORTEST PATH FIRST (OSPF)
EIGRP (ENHANCED INTERIOR GATEWAY ROUTING PROTOCOL)

is known for its fast convergence and


efficient use of bandwidth.
Uses a metric called "composite metric,"
which takes into account bandwidth,
delay, reliability, and load.
also uses a reliable transport
mechanism to guarantee the ordered
delivery of all EIGRP packets to its
neighbors.
EIGRP USES FIVE PACKAGE TYPES

1. HELLO packets. Sent out at regular intervals to facilitate the


neighbor discovery process.
2. QUERY packets. Used by a router to advertise that a route is in an
active state and to request alternate path information from
neighbors.
3. REPLY packets. Sent after an entire QUERY packet has been
received to acknowledge that packet's receipt.
4. REQUEST packets. Used to request specific information from one or
more neighbors, similar to QUERY packets but sent unreliably -- no
notification if delivery fails.
5. UPDATE packets. Convey information about destinations and their
reachability.
ADVANTAGES OF EIGRP

1. increases availability through faster convergence, helping to avoid


disruptions in the event of a link outage;
2. improves voice and video quality by avoiding routing loops and
supporting almost immediate convergence;
3. simplifies operations and lowers costs because administrators
don't need to manually update the routing design to accommodate
changes;
4. minimizes network resource usage during normal operations
because only HELLO packages are transmitted when the network is
stable;
5. reduces the protocol's load on the network because only changes to
the routing table are propagated, rather than the entire routing
table; and
6. uses links more efficiently by utilizing equal-cost multipath and
unequal-cost load balancing.
THANK YOU!

You might also like