An adaptive strategy based on linear prediction of queue length to minimize congestion in Barabási—Albert scale-free networks

Abstract

In this paper, we propose an adaptive strategy based on the linear prediction of queue length to minimize congestion in Barabási—Albert (BA) scale-free networks. This strategy uses local knowledge of traffic conditions and allows nodes to be able to self-coordinate their accepting probability to the incoming packets. We show that the strategy can delay remarkably the onset of congestion and systems avoiding the congestion can benefit from hierarchical organization of accepting rates of nodes. Furthermore, with the increase of prediction orders, we achieve larger values for the critical load together with a smooth transition from free-flow to congestion.