Self Avoiding Paths Routing Algorithm in Scale-Free Networks

TL;DR

This paper introduces a novel self avoiding paths routing algorithm for scale-free networks that improves traffic flow and congestion management by reducing path overlaps and maintaining low travel times.

Contribution

The paper presents a new routing algorithm that enhances traffic capacity and reduces congestion in scale-free networks by minimizing path overlaps with fewer iterations.

Findings

Significant increase in critical packet generation rate.

Improved network capacity compared to efficient routing.

Effective on both BA and real AS networks.

Abstract

In this paper, we present a new routing algorithm called "the Self Avoiding Paths Routing Algorithm". Its application to traffic flow in scale-free networks shows a great improvement over the so called "efficient routing" protocol while at the same time maintaining a relatively low average packet travel time. It has the advantage of minimizing path overlapping throughout the network in a self consistent manner with a relatively small number of iterations by maintaining an equilibrated path distribution especially among the hubs. This results in a significant shifting of the critical packet generation rate over which traffic congestion occurs, thus permitting the network to sustain more information packets in the free flow state. The performance of the algorithm is discussed both on a Bar\'abasi-Albert (BA) network and real autonomous system (AS) network data.