Abstract
In this work the load balancing problem is studied for decentralized stochastic network with unknown but bounded noise in measurements and varying productivities of agents. The load balancing problem is formulated as a consensus problem in a stochastic network. Consideration of Laplasian potential function corresponded to the network graph allows to introduce a new randomized local voting protocol with constant step-size which is based on simultaneous perturbation stochastic approximation algorithm. The conditions are formulated for the approximate consensus achievement which corresponds to achieving of a suboptimal level of agents' load. The new algorithm is illustrated by simulations.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
