RESOURCE NETWORKS WITH LIMITATIONS ON VERTEX CAPACITIES-Reference-Cited by-同舟云学术

RESOURCE NETWORKS WITH LIMITATIONS ON VERTEX CAPACITIES

Published:2017-11-15 Issue: Volume: Page:
ISSN:
Container-title:
language:
Short-container-title:

Author:

Жилякова Людмила¹,Zhilyakova Liudmila²

Affiliation:

1. ИПУ РАН

2. ICS RAS

Abstract

Work is continuation of studies whose results are published in the monograph "Theory of resource networks" — M.: RIOR: INFRA-M, 2017. The resource network is a dynamic graph model in which vertices at discrete time homogeneous resource exchange through channels with limited bandwidth capabilities. At each step, the vertices give the resource to one of the two rules with the threshold switch, depending on its quantity. In the original model all the vertices have an unlimited capacity. Ie can take and store an arbitrary amount of the resource. In the model proposed in the present work, the vertices, the storage resource (attractors) have limitations on capacity. This creates the possibility of accumulation of the resource in the set of vertices, called secondary attractors. Investigated the inhomogeneous Markov chain generated by the process of redistribution of the resource. The book is intended for specialists in graph theory and operations research, students, masters and post-graduate students studying in various areas of discrete mathematics and computer science.

Publisher

Publishing Center RIOR

Reference30 articles.

1. Агаев Р.П., Чеботарев П.Ю. Метод проекции в задаче о консенсусе и регуляризованный предел степеней стохастической матрицы // Автоматика и телемеханика. – 2011. – №12. – С. 38–59., Agaev R.P., Chebotarev P.Yu. Metod proekcii v zadache o konsensuse i regulyarizovannyy predel stepeney stohasticheskoy matricy // Avtomatika i telemehanika. – 2011. – №12. – S. 38–59.

2. Агаев Р.П., Чеботарев П.Ю. Сходимость и устойчивость в задачах со-гласования характеристик (обзор базовых результатов) // Управление большими системами. – 2010. – №30.1 – С. 470–505., Agaev R.P., Chebotarev P.Yu. Shodimost' i ustoychivost' v zadachah so-glasovaniya harakteristik (obzor bazovyh rezul'tatov) // Upravlenie bol'shimi sistemami. – 2010. – №30.1 – S. 470–505.

3. Адельсон-Вельский Г.М., Диниц Е.А., Карза¬нов А.В. Потоковые алгоритмы. – М.: Наука, 1975. – 119 с., Adel'son-Vel'skiy G.M., Dinic E.A., Karza¬nov A.V. Potokovye algoritmy. – M.: Nauka, 1975. – 119 s.

4. Ананько Е.А., Колпаков Ф.А., Подколодная О.А., Игнатьева Е.В., Го-рячковская Т.Н., Степаненко И.Л., Колчанов Н.А. Генные сети. 1999. – [Электронный ресурс] – URL: http://www.bionet.nsc.ru/ICIG/session/1999/rus/part1/1_18.pdf (дата обращения 09.01.2017)., Anan'ko E.A., Kolpakov F.A., Podkolodnaya O.A., Ignat'eva E.V., Go-ryachkovskaya T.N., Stepanenko I.L., Kolchanov N.A. Gennye seti. 1999. – [Elektronnyy resurs] – URL: http://www.bionet.nsc.ru/ICIG/session/1999/rus/part1/1_18.pdf (data obrascheniya 09.01.2017).

5. Базенков Н.И., Губанов Д.А. Обзор информационных систем анализа социальных сетей // Управление большими системами. – 2013. – №41. – С. 357–394., Bazenkov N.I., Gubanov D.A. Obzor informacionnyh sistem analiza social'nyh setey // Upravlenie bol'shimi sistemami. – 2013. – №41. – S. 357–394.

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Resource Network with Limitations on Vertex Capacities: A Double-Threshold Dynamic Flow Model;Communications in Computer and Information Science;2018