Page 156 - Computer_Science_F5

Distributed routing destination eventually, it can be
Imagine multiple traffic control centers inefficient and create unnecessary
communicating with each other to share network traffic. Multiple copies
local traffic information. Here, network of the same packet can circulate, Chapter Three: Advanced Computer Networks
devices exchange information about potentially overwhelming network
FOR ONLINE READING ONLY
their neighbors and the costs of reaching resources.
different destinations. Each device then (b) Random walks: Imagine taking
iteratively calculates the best path based random turns at each intersection
on the collected information, building a until you reach your destination.
network-wide picture without a central In random walks, a packet is sent
authority. to one of its neighboring devices

Non-adaptive routing algorithms randomly. While this approach can
explore alternative routes, it lacks
These algorithms rely on pre-defined any direction and may not be the
routing tables that remain static. They most efficient way to reach the target.
are simpler to implement but may not
be as efficient in dynamic network
environments. Imagine a fixed travel route Differences between adaptive and non-
you plan, without considering real-time adaptive routing algorithms
traffic conditions. They rely on a static When it comes to moving data across
routing table programmed into routers a network, routing algorithms play a
during network setup. This table defines crucial role in choosing the best path for
the path each packet should take to reach its data packets. Use Activity 3.5 to explore
destination, regardless of current network the differences between adaptive and
conditions. Non-adaptive algorithms are non-adaptive routing algorithms.
relatively simple to configure and manage.
However, they cannot adapt to changes
in network traffic or topology (layout Activity 3.5:
changes, link failures). This can lead to
inefficient routing if optimal paths become Exploring adaptive and non-
congested or unavailable. adaptive routing algorithms

Types of non-adaptive routing Aim:
There are two main types of non- To understand the differences between
adaptive routing algorithms: adaptive and non-adaptive routing
(a) Flooding: Imagine sending a lost algorithms through research and
person a copy of a map with every practical analysis.
street highlighted. Flooding sends Materials:
every incoming data packet to all 1. Computer with Internet access or
connected network devices except Library access
the one from which it arrived. While 2. Network simulation software (Such
this ensures the packet reaches its

147
Student’s Book Form Five

Computer Science Form 5.indd 147 23/07/2024 12:33