Flood Routing Technique for Data Networks

TL;DR

This paper introduces a novel flooding-based routing algorithm that efficiently explores optimal network paths without pre-established tables, offering robustness, load sharing, and reduced overhead for data networks.

Contribution

The paper presents a new flooding technique with an efficient control algorithm that improves routing robustness and load balancing without relying on traditional routing tables.

Findings

Reduces network saturation compared to traditional flooding.

Provides automatic load sharing across multiple routes.

Enhances robustness against network configuration changes.

Abstract

In this paper, a new routing algorithm based on a flooding method is introduced. Flooding techniques have been used previously, e.g. for broadcasting the routing table in the ARPAnet [1] and other special purpose networks [3][4][5]. However, sending data using flooding can often saturate the network [2] and it is usually regarded as an inefficient broadcast mechanism. Our approach is to flood a very short packet to explore an optimal route without relying on a pre-established routing table, and an efficient flood control algorithm to reduce the signalling traffic overhead. This is an inherently robust mechanism in the face of a network configuration change, achieves automatic load sharing across alternative routes and has potential to solve many contemporary routing problems. An earlier version of this mechanism was originally developed for virtual circuit establishment in the experimental Caroline ATM LAN [6][7] at Monash University.