Scribd
Upload
7 views2 pages

Routing Fundamentals and Protocols Explained

Routing fundamentals involve directing data packets from a source to a destination in a network. Routers determine the best path and transmit packets along the chosen route, adjusting paths for network changes and distributing traffic optimally. Static routing uses manually configured routes that remain unchanged, while routing protocols enable dynamic route adaptation through automated sharing of network topology information between routers. Open Shortest Path First (OSPF) is a link-state routing protocol that finds the shortest paths between routers using Dijkstra's algorithm and allows quick response to network changes through hierarchical routing areas and link state advertisements.

Uploaded by

Ryan Czar Jacob Rayray
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
7 views2 pages

Routing Fundamentals and Protocols Explained

Routing fundamentals involve directing data packets from a source to a destination in a network. Routers determine the best path and transmit packets along the chosen route, adjusting paths for network changes and distributing traffic optimally. Static routing uses manually configured routes that remain unchanged, while routing protocols enable dynamic route adaptation through automated sharing of network topology information between routers. Open Shortest Path First (OSPF) is a link-state routing protocol that finds the shortest paths between routers using Dijkstra's algorithm and allows quick response to network changes through hierarchical routing areas and link state advertisements.

Uploaded by

Ryan Czar Jacob Rayray
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

Charlie Jake G.

Rojas
BS Info Tech 3C

 ROUTING FUNDAMENTALS
- is the process of directing data packets from a source to a destination in a
network.

FUNCTIONS:
[Link] Determination: Find the best route based on destination addresses.
[Link] Forwarding: Transmit packets along the chosen path.
[Link] Routing: Adjust routes based on network changes.
[Link] Balancing: Distribute traffic for optimal performance.
[Link] Enforcement: Implement access controls for protection.

EXAMPLE:
When you send a request, routers determine the path for data packets to
reach the destination, ensuring efficient and reliable communication.

 STATIC ROUTING
- is a method of network routing where a network administrator manually
configures the routing table in routers and switches. It involves manually specifying
the paths that data packets should take to reach their destination.

FUNCTIONS:
[Link] Configuration: Routes are manually entered into the router's
routing table by the network administrator.
[Link]: Routes remain unchanged until manually modified, providing
stability in network configurations.
[Link] Overhead: It requires less processing power and memory compared to
dynamic routing protocols, making it suitable for small, stable networks.

EXAMPLE:
In a small office network, the administrator manually configures the router to
send data packets destined for the internet directly through the ISP gateway, and
internal network packets through the local switch. These routes remain unchanged
unless modified manually.

 ROUTING PROTOCOL
- is a set of rules and conventions used by routers to determine the best path
for forwarding data packets between networks. It enables routers to share
information about network topology and make dynamic decisions about how to
route data.
FUNCTIONS:
[Link] Exchange: Routers communicate with each other to exchange
information about network status, available routes, and link metrics.
[Link] Calculation: Based on the received information, routers use
algorithms to calculate the optimal paths for data packets to reach their
destinations.
[Link] Adaptation: Routing protocols continuously update routing tables
to respond to changes in network conditions, such as link failures or traffic
congestion.

EXAMPLE:
Consider a large enterprise network with multiple routers. They use a
protocol like OSPF (Open Shortest Path First) or BGP (Border Gateway Protocol) to
share information about available routes. If a link between two routers fails, OSPF
will quickly recalculate the best paths, ensuring uninterrupted communication. This
dynamic adaptation is a key function of routing protocols.

 OSPF(Open Shortest Path First)


- is a link-state routing protocol used in computer networking. It is designed
to find the shortest path for data packets to travel through a network, based on the
state of links between routers.

FUNCTIONS:
[Link]-State Advertisements (LSAs): OSPF routers exchange information
about their directly connected links, creating a detailed network map. This
information is used to build a topological database.
[Link]'s Algorithm: OSPF uses Dijkstra's algorithm to calculate the
shortest path to reach each network in the topology.
[Link] Design: OSPF allows networks to be divided into areas, which
reduces the size of the routing table and improves scalability.
[Link] Routing Updates: OSPF routers exchange information about
network changes, allowing for quick adaptation to link failures or additions.

EXAMPLE:
In a large corporation, OSPF is used. Routers share link information, creating
a topological database. Using Dijkstra's algorithm, routers find the shortest paths to
networks. If a link fails, routers promptly update routes. OSPF's hierarchical design
efficiently manages the network.

You might also like