Standard

Satisfying the Cost Constraints in a Network System Operating by the Consensus Protocol with Different Task Priorities. / Amelina, Natalia; Granichin, Oleg; Granichina, Olga; Ivanskiy, Yury; Jiang, Yuming.

In: IFAC-PapersOnLine, Vol. 51, No. 32, 2018, p. 367-372.

Research output: Contribution to journal › Article › peer-review

Harvard

Amelina, N, Granichin, O, Granichina, O, Ivanskiy, Y & Jiang, Y 2018, 'Satisfying the Cost Constraints in a Network System Operating by the Consensus Protocol with Different Task Priorities', IFAC-PapersOnLine, vol. 51, no. 32, pp. 367-372. https://doi.org/10.1016/j.ifacol.2018.11.411

APA

Amelina, N., Granichin, O., Granichina, O., Ivanskiy, Y., & Jiang, Y. (2018). Satisfying the Cost Constraints in a Network System Operating by the Consensus Protocol with Different Task Priorities. IFAC-PapersOnLine, 51(32), 367-372. https://doi.org/10.1016/j.ifacol.2018.11.411

Vancouver

Amelina N, Granichin O, Granichina O, Ivanskiy Y, Jiang Y. Satisfying the Cost Constraints in a Network System Operating by the Consensus Protocol with Different Task Priorities. IFAC-PapersOnLine. 2018;51(32):367-372. https://doi.org/10.1016/j.ifacol.2018.11.411

Author

Amelina, Natalia ; Granichin, Oleg ; Granichina, Olga ; Ivanskiy, Yury ; Jiang, Yuming. / Satisfying the Cost Constraints in a Network System Operating by the Consensus Protocol with Different Task Priorities. In: IFAC-PapersOnLine. 2018 ; Vol. 51, No. 32. pp. 367-372.

BibTeX

@article{599847ff6c6f4a79bdcf1de7c93b1d96,
title = "Satisfying the Cost Constraints in a Network System Operating by the Consensus Protocol with Different Task Priorities",
abstract = "A multi-agent network system of different computing nodes processing tasks of different priority levels is considered. Agents balance their loads for each priority level by achieving consensus of their load values. Agents operate by local voting protocol and exchange information about their states in presence of noise in communication channels in the system with switching topology. The network usage for task exchange is limited by the constraints on average cost of utilized links. A way to meet the constraints by randomization of link usage is considered. Simulation illustrating the considered approach is provided.",
keywords = "Consensus achievement, Cost constraints, Multi-Agent Systems, consensus achievement, stochastic approximation, mult-agent systems, TOPOLOGY, STOCHASTIC-APPROXIMATION",
author = "Natalia Amelina and Oleg Granichin and Olga Granichina and Yury Ivanskiy and Yuming Jiang",
year = "2018",
doi = "10.1016/j.ifacol.2018.11.411",
language = "Английский",
volume = "51",
pages = "367--372",
journal = "IFAC-PapersOnLine",
issn = "2405-8971",
publisher = "Elsevier",
number = "32",
note = "null ; Conference date: 15-10-2018 Through 19-12-2018",
url = "https://www.ipu.ru/node/43678",

}

RIS

TY - JOUR

T1 - Satisfying the Cost Constraints in a Network System Operating by the Consensus Protocol with Different Task Priorities

AU - Amelina, Natalia

AU - Granichin, Oleg

AU - Granichina, Olga

AU - Ivanskiy, Yury

AU - Jiang, Yuming

N1 - Conference code: 17

PY - 2018

Y1 - 2018

N2 - A multi-agent network system of different computing nodes processing tasks of different priority levels is considered. Agents balance their loads for each priority level by achieving consensus of their load values. Agents operate by local voting protocol and exchange information about their states in presence of noise in communication channels in the system with switching topology. The network usage for task exchange is limited by the constraints on average cost of utilized links. A way to meet the constraints by randomization of link usage is considered. Simulation illustrating the considered approach is provided.

AB - A multi-agent network system of different computing nodes processing tasks of different priority levels is considered. Agents balance their loads for each priority level by achieving consensus of their load values. Agents operate by local voting protocol and exchange information about their states in presence of noise in communication channels in the system with switching topology. The network usage for task exchange is limited by the constraints on average cost of utilized links. A way to meet the constraints by randomization of link usage is considered. Simulation illustrating the considered approach is provided.

KW - Consensus achievement

KW - Cost constraints

KW - Multi-Agent Systems

KW - consensus achievement

KW - stochastic approximation

KW - mult-agent systems

KW - TOPOLOGY

KW - STOCHASTIC-APPROXIMATION

UR - http://www.scopus.com/inward/record.url?scp=85058212475&partnerID=8YFLogxK

U2 - 10.1016/j.ifacol.2018.11.411

DO - 10.1016/j.ifacol.2018.11.411

M3 - статья

AN - SCOPUS:85058212475

VL - 51

SP - 367

EP - 372

JO - IFAC-PapersOnLine

JF - IFAC-PapersOnLine

SN - 2405-8971

IS - 32

Y2 - 15 October 2018 through 19 December 2018

ER -

ID: 35254382