Standard

Stochastic game of data transmission in the presence of buffers of finite capacity. / Bure, V. M.; Parilina, E. M.

в: ВЕСТНИК САНКТ-ПЕТЕРБУРГСКОГО УНИВЕРСИТЕТА. ПРИКЛАДНАЯ МАТЕМАТИКА. ИНФОРМАТИКА. ПРОЦЕССЫ УПРАВЛЕНИЯ, Том 15, № 1, 2019, стр. 39-46.

Результаты исследований: Научные публикации в периодических изданиях › статья › Рецензирование

Harvard

Bure, VM & Parilina, EM 2019, 'Stochastic game of data transmission in the presence of buffers of finite capacity', ВЕСТНИК САНКТ-ПЕТЕРБУРГСКОГО УНИВЕРСИТЕТА. ПРИКЛАДНАЯ МАТЕМАТИКА. ИНФОРМАТИКА. ПРОЦЕССЫ УПРАВЛЕНИЯ, Том. 15, № 1, стр. 39-46. https://doi.org/10.21638/11702/spbu10.2019.103

APA

Bure, V. M., & Parilina, E. M. (2019). Stochastic game of data transmission in the presence of buffers of finite capacity. ВЕСТНИК САНКТ-ПЕТЕРБУРГСКОГО УНИВЕРСИТЕТА. ПРИКЛАДНАЯ МАТЕМАТИКА. ИНФОРМАТИКА. ПРОЦЕССЫ УПРАВЛЕНИЯ, 15(1), 39-46. https://doi.org/10.21638/11702/spbu10.2019.103

Vancouver

Bure VM, Parilina EM. Stochastic game of data transmission in the presence of buffers of finite capacity. ВЕСТНИК САНКТ-ПЕТЕРБУРГСКОГО УНИВЕРСИТЕТА. ПРИКЛАДНАЯ МАТЕМАТИКА. ИНФОРМАТИКА. ПРОЦЕССЫ УПРАВЛЕНИЯ. 2019;15(1):39-46. https://doi.org/10.21638/11702/spbu10.2019.103

Author

Bure, V. M. ; Parilina, E. M. / Stochastic game of data transmission in the presence of buffers of finite capacity. в: ВЕСТНИК САНКТ-ПЕТЕРБУРГСКОГО УНИВЕРСИТЕТА. ПРИКЛАДНАЯ МАТЕМАТИКА. ИНФОРМАТИКА. ПРОЦЕССЫ УПРАВЛЕНИЯ. 2019 ; Том 15, № 1. стр. 39-46.

BibTeX

@article{4db01c01a2434b569d41bfd4dfc02366,
title = "Stochastic game of data transmission in the presence of buffers of finite capacity",
abstract = "The game-theoretic model of data transmission in a network of a given topology is presented. Two players (network nodes) tend to send as many random data packagesas possible to the final nodes through one common node. Each playerhas a finite capacity buffer for storing data packages. A system of costs for sending and storing data packages andrewards for the successful package delivery is introduced. A dynamic conflict-controlled process is modelled as a stochastic gamewith a finite set of states. The existence of the Nash equilibrium and a cooperative solution is proved. The cooperative solution is a strategy profile which maximizes the total expected payoff. The price of anarchy in the network is calculated. The price comparesthe players{\textquoteright} payoffs in the Nash equilibrium and cooperative solution.",
keywords = "Data transmission, Slotted ALOHA, Stochastic game, The price of anarchy, data transmission, slotted ALOHA, the price of anarchy, stochastic game",
author = "Bure, {V. M.} and Parilina, {E. M.}",
year = "2019",
doi = "10.21638/11702/spbu10.2019.103",
language = "English",
volume = "15",
pages = "39--46",
journal = " ВЕСТНИК САНКТ-ПЕТЕРБУРГСКОГО УНИВЕРСИТЕТА. ПРИКЛАДНАЯ МАТЕМАТИКА. ИНФОРМАТИКА. ПРОЦЕССЫ УПРАВЛЕНИЯ",
issn = "1811-9905",
publisher = "Издательство Санкт-Петербургского университета",
number = "1",

}

RIS

TY - JOUR

T1 - Stochastic game of data transmission in the presence of buffers of finite capacity

AU - Bure, V. M.

AU - Parilina, E. M.

PY - 2019

Y1 - 2019

N2 - The game-theoretic model of data transmission in a network of a given topology is presented. Two players (network nodes) tend to send as many random data packagesas possible to the final nodes through one common node. Each playerhas a finite capacity buffer for storing data packages. A system of costs for sending and storing data packages andrewards for the successful package delivery is introduced. A dynamic conflict-controlled process is modelled as a stochastic gamewith a finite set of states. The existence of the Nash equilibrium and a cooperative solution is proved. The cooperative solution is a strategy profile which maximizes the total expected payoff. The price of anarchy in the network is calculated. The price comparesthe players’ payoffs in the Nash equilibrium and cooperative solution.

AB - The game-theoretic model of data transmission in a network of a given topology is presented. Two players (network nodes) tend to send as many random data packagesas possible to the final nodes through one common node. Each playerhas a finite capacity buffer for storing data packages. A system of costs for sending and storing data packages andrewards for the successful package delivery is introduced. A dynamic conflict-controlled process is modelled as a stochastic gamewith a finite set of states. The existence of the Nash equilibrium and a cooperative solution is proved. The cooperative solution is a strategy profile which maximizes the total expected payoff. The price of anarchy in the network is calculated. The price comparesthe players’ payoffs in the Nash equilibrium and cooperative solution.

KW - Data transmission

KW - Slotted ALOHA

KW - Stochastic game

KW - The price of anarchy

KW - data transmission

KW - slotted ALOHA

KW - the price of anarchy

KW - stochastic game

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

UR - http://vestnik.spbu.ru/html19/s10/s10v1/03.pdf

UR - http://www.mendeley.com/research/stochastic-game-data-transmission-presence-buffers-finite-capacity

U2 - 10.21638/11702/spbu10.2019.103

DO - 10.21638/11702/spbu10.2019.103

M3 - Article

AN - SCOPUS:85064711103

VL - 15

SP - 39

EP - 46

JO - ВЕСТНИК САНКТ-ПЕТЕРБУРГСКОГО УНИВЕРСИТЕТА. ПРИКЛАДНАЯ МАТЕМАТИКА. ИНФОРМАТИКА. ПРОЦЕССЫ УПРАВЛЕНИЯ

JF - ВЕСТНИК САНКТ-ПЕТЕРБУРГСКОГО УНИВЕРСИТЕТА. ПРИКЛАДНАЯ МАТЕМАТИКА. ИНФОРМАТИКА. ПРОЦЕССЫ УПРАВЛЕНИЯ

SN - 1811-9905

IS - 1

ER -

ID: 41873376