Flooding in Computer Networks: Complete Guide with Examples

Introduction

Flooding in computer networks is one of the very basic and straightforward routing techniques used in computer networks. It works on a simple idea. When a node receives the data packet, it sends that packet through its entire outgoing links other than the link from which the packet was initially received.

Unlike advanced routing algorithms, flooding does not try to calculate the best possible path or the least cost path. It does not store routing tables or network maps. Instead, it relies on a brute force transmission protocol. Because of this, flooding guarantees that the packet will reach its destination even if only one path exists in the network.

Flooding is very easy to understand, easy to implement, and very reliable. However, it also creates many duplicate packets and consumes a large bandwidth. Due to this reason, flooding is rarely used alone in large networks. But it is still very important for understanding the concept of routing.

Before getting into more details let us understand what flooding in computer networks is.

What is Flooding in Computer Networks?

Flooding in computer networks is a static routing technique. Static means that the routing behavior does not change based on network conditions like traffic load and congestion.

The working principle of flooding can be summed up in one simple statement:

“When a packet reaches a router, the router forwards it through all outgoing links except the one from where it arrived”.

This rule is applied repeatedly at every router in the network. As a result, the same packet spreads throughout the network and reaches all possible nodes.

Flooding does not require:

• Routing tables
• Path cost information
• Network topology knowledge
• Link state data

Because of this, flooding is called a non-adaptive routing algorithm.

Now that we have a good understanding of “What is flooding in computer networks?” Let us move on to our next section where we will discuss the purpose of flooding.

Why Is Flooding Used?

Flooding in computer networks may look inefficient, but it has some substantial advantages. The most important one is guaranteed delivery. If a destination node is reachable at all, flooding will ensure that the packet reaches it.

Flooding is commonly used in situations where:

• Network reliability is more important than efficiency
• Network topology changes frequently
• Routing information is unavailable
• Broadcasting or discovery is required

For example, flooding is used in routing protocols like OSPF, in peer-to-peer systems, and in network discovery processes.

Types of Flooding in Computer Networks

Flooding in computer networks is broadly classified into three types:

1. Uncontrolled Flooding
2. Controlled Flooding
3. Selective Flooding

Each type handles packet duplication differently.

Uncontrolled Flooding

Uncontrolled flooding is the simplest form of flooding.

Characteristics of Uncontrolled Flooding

• Every packet is forwarded to all neighbors
• No checks are applied
• No packet history is maintained

Problems with Uncontrolled Flooding

• Generates excessive duplicate packets
• Causes broadcast storms
• Consumes a large amount of bandwidth
• Can bring down the network

Due to these problems, uncontrolled flooding is rarely used in real networks.

Controlled Flooding

Controlled flooding introduces rules to limit packet duplication. It improves efficiency while keeping the reliability of flooding.

There are two main controlled flooding techniques:

A. Sequence Number Controlled Flooding (SNCF)

In this method:

• Each packet contains a unique sequence number
• Each router stores recently received packets
• If a packet arrives again, it is discarded

This ensures that each packet is forwarded only once by a router.

Advantages of SNCF

• Reduces duplicate packets
• Prevents infinite looping
• Improves network efficiency

B. Reverse Path Forwarding (RPF)

Reverse Path Forwarding works based on the expected path of a packet.

How RPF Works

• A router forwards a packet only if it arrives on the correct incoming link
• If the packet arrives from the wrong direction, it is dropped

This ensures that packets move outward from the source without unnecessary loops.

Benefits of RPF

• Reduces network traffic
• Limits unnecessary forwarding
• Maintains reliability

Selective Flooding

Selective flooding is an improved version of flooding.

How Selective Flooding Works?

• Routers do not forward packets on all links
• Packets are sent only in the general direction of the destination
• Unnecessary paths are ignored

Selective flooding reduces bandwidth usage while still maintaining delivery assurance.

How Does Flooding in Computer Networks Work?

To understand flooding clearly, let us look at how it works step by step.

1. A source node creates a data packet.
2. The packet is sent to all neighboring nodes.
3. Each neighboring node receives the packet.
4. Each node forwards the packet to all of its neighbors except the sender.
5. This process continues until:
   • The packet reaches the destination, or
   • The packet is discarded due to control limits.

Because every router forwards the packet to multiple routers, the number of packets increases rapidly. This creates many duplicate packets in the network.

Example of Flooding in Computer Networks

For example, let’s say a network has six routers: A, B, C, D, E, and F.

• A sends the packet to B, C, and D
• B sends it to C and E
• C sends it to B, D, and F
• D sends it to C and F
• E sends it to F
• F sends it back to C and E

In this example:

• The same packet appears multiple times
• Routers receive duplicate copies
• The network becomes busy very quickly

This example shows both the strength and weakness of flooding.

Flooding and Packet Duplication

One major problem with flooding in computer networks is packet duplication.

Since each router forwards packets to all neighbors:

• The same packet reaches a node multiple times
• Duplicate packets waste bandwidth
• Network congestion increases

Without control mechanisms, flooding can create an infinite number of packets. This makes flooding unsuitable for large networks unless restrictions are applied.

Hop Count in Flooding

To control packet duplication, flooding uses a mechanism called hop count.

What is Hop Count?

Hop count is a number attached to each packet. It represents how many times the packet is allowed to be forwarded.

How Hop Count Works?

• The source sets an initial hop count value
• Each router reduces the hop count by one
• When the hop count reaches zero, the packet is discarded

This ensures that packets do not circulate forever in the network.

Hop count helps reduce:

• Infinite looping
• Network congestion
• Excessive packet duplication

What is a Flooding Attack?

In a flooding attack:

• A large number of packets are sent to a server
• The server receives more requests than it can handle
• System resources such as memory and CPU are exhausted

As a result:

• Legitimate users cannot access the service
• The network becomes slow or unresponsive

Flooding attacks can be performed using:

• ICMP flood
• SYN flood
• Ping flood

This shows how a simple routing technique can become a security threat.

Characteristics of Flooding

Flooding in computer networks has several essential characteristics:

• Every possible route is explored
• At least one shortest path exists
• All connected nodes are reached
• No routing information is required
• Works even with partial network failure

These characteristics make flooding robust and reliable.

Advantages of Flooding

Flooding in computer networks offers several advantages:

1. Guaranteed delivery of packets
2. Automatically finds the shortest path
3. Highly reliable
4. Works even if some routers fail
5. Simple to implement
6. No routing tables needed

These advantages make flooding useful in special cases.

Disadvantages of Flooding

Flooding in computer networks also has serious disadvantages:

1. Generates duplicate packets
2. Wastes network bandwidth
3. Causes congestion
4. Inefficient for single destinations
5. Increases processing load on routers
6. Can be used for DoS attacks

Because of these drawbacks, flooding is rarely used as a primary routing method. Flooding becomes impractical as network size increases.

Applications of Flooding

Flooding is used in several real-world scenarios:

• OSPF routing protocol
• Peer-to-peer networks
• Network discovery
• Broadcasting services
• Routing initialization

Flooding is often used as a supporting technique rather than a primary routing method.

Flooding vs Broadcasting

Flooding is similar to broadcasting, but there is a difference.

• Broadcasting sends packets to all nodes intentionally
• Flooding sends packets everywhere as part of routing

Flooding may result in broadcasting, but its goal is routing, not communication.

Frequently Asked Questions

Q1. What is flooding algorithm in Computer Networks?

The flooding algorithm is a routing method where each router forwards packets to all outgoing links except the incoming one.

Q2. Are routing algorithms and flooding algorithms the same?

No, routing algorithms choose optimal paths, while flooding sends packets on all paths without path selection.

Q3. Why is flooding called a simple routing technique in networking?

Flooding is called simple because it does not require any routing intelligence. Routers do not store network topology, path costs, or routing tables.

Q4. How does flooding guarantee packet delivery?

Flooding in computer networks relies on brute force. It does not require all possible ways of routing; even with a single path to link, it can take packets from its host to all the links in the network.

Conclusion

Flooding in computer networks is a simple and powerful routing technique. It works by sending packets through all outgoing links without using routing tables or network information. This ensures guaranteed delivery and automatic shortest path discovery.

Although flooding creates duplicate packets, it also wastes bandwidth and can overload networks. Because of this, it is rarely used alone in modern networks. Controlled and selective flooding techniques are preferred to reduce inefficiency.

Despite its limitations, flooding remains an important concept in computer networking. It forms the foundation for the many routing and discovery protocols. It helps students understand how data can move reliably across a network. These essential networking principles are covered in CCNA (Cisco Certified Network Associate) courses, making CCNA an ideal choice for anyone looking to build strong, industry-relevant networking skills.