Local voting protocol for decentralized load balancing of network with switched topology and noise in measurements

Abstract

The applicability of local voting protocol for the nonstationary problem of load balancing in a decentralized network with switched topology and measurement noise is investigated. The obtained theoretical results are illustrated by simulation models. The system is considered with and without the redistribution of tasks. It is shown that an adaptive multiagent strategy with the redistribution of tasks among the neighbors is better for handling the distribution of tasks than a strategy in which tasks are sent to random nodes and are not redistributed after arrival.