New differentiated consensuses problem for stochastic networks with priorities
Abstract
In this paper, a new consensus problem, termed differentiated consensuses, is studied. This consensus problem is that, in a system with multiple classes, consensus is targeted for each class, which may be different among classes. Specifically, we investigate differentiated consensuses in a distributed stochastic network system of nodes (or agents), where tasks, classified with different priorities, are serviced. The network system is assumed to have switched topology, noise and delay in measurement, and cost on the topology. The goal is to reach/maintain balanced (equal) load, i.e. consensus, across the network and at the same time to meet the topology cost constraint, both for every priority class. A control protocol is proposed. With this protocol, network resources are allocated in a randomized way with probabilities corresponding to each priority class. We prove that the proposed control protocol is able to meet the topology cost constraint and achieve approximate consensus for each of the priority classes in the network. Refs 14. Figs 1.Keywords:
differentiated consensus, switched topology, load balancing
Downloads
Download data is not yet available.
Downloads
Published
2015-11-01
How to Cite
Amelina, N. O., & Ivanskiy, Y. V. (2015). New differentiated consensuses problem for stochastic networks with priorities. Vestnik of Saint Petersburg University. Mathematics. Mechanics. Astronomy, 2(4), 495–506. Retrieved from https://math-mech-astr-journal.spbu.ru/article/view/11186
Issue
Section
Mathematics
License
Articles of "Vestnik of Saint Petersburg University. Mathematics. Mechanics. Astronomy" are open access distributed under the terms of the License Agreement with Saint Petersburg State University, which permits to the authors unrestricted distribution and self-archiving free of charge.