Springer

54823

Автор(ы): 

Автор(ов): 

2

Параметры публикации

Тип публикации: 

Доклад

Название: 

Modeling and Reliability Analysis of a Redundant Transport System in a Markovian Environment

ISBN/ISSN: 

978-3-030-36613-1

DOI: 

10.1007/978-3-030-36614-8_23

Наименование конференции: 

  • 22nd International Conference on Distributed Computer and Communication Networks: Control, Computation, Communications (DCCN-2019, Moscow)

Наименование источника: 

  • Proceedings of the 22nd International Conference on Distributed Computer and Communication Networks: Control, Computation, Communications (DCCN-2019, Moscow)

Обозначение и номер тома: 

vol 11965

Город: 

  • Cham

Издательство: 

  • Springer

Год издания: 

2019

Страницы: 

302-314
Аннотация
We consider the multipath communication between a client and a server that is established at the transport and session layers of an SDN/NFV protocol stack in a fog computing scenario. We analyze the reliability function of an associated redundant transport system comprising two logical channels that are susceptible to failures. The failure processes of both channels are described by Markov-modulated failure times that are driven by the transitions of a common Markovian environment. We model the error-prone system with repair and independent phase-type distributed repair times by a continuous-time Markov chain. We identify its generator matrix in terms of Kronecker products of the underlying parameter matrices that are determined by the interarrival times driven by Markov-modulated failure processes and the independent phase-type distributed repair times. We show that the steady-state distribution of the restoration model can be eectively calculated by an iterative aggregation-disaggregation method for block matrices and compute the associated reliability function of the transport system by a uniformization method.

Библиографическая ссылка: 

Маркович Н.М., Krieger U. R. Modeling and Reliability Analysis of a Redundant Transport System in a Markovian Environment / Proceedings of the 22nd International Conference on Distributed Computer and Communication Networks: Control, Computation, Communications (DCCN-2019, Moscow). Cham: Springer, 2019. vol 11965. С. 302-314.

54821

Автор(ы): 

Автор(ов): 

1

Параметры публикации

Тип публикации: 

Доклад

Название: 

On Estimation of Weibull-Tail and Log-Weibull-tail Distributions for Modeling End-to-end Delay

ISBN/ISSN: 

978-3-030-36624-7

DOI: 

10.1007/978-3-030-36625-4_24

Наименование конференции: 

  • 22nd International Conference on Distributed Computer and Communication Networks: Control, Computation, Communications (DCCN-2019, Moscow)

Наименование источника: 

  • Proceedings of the 22nd International Conference on Distributed Computer and Communication Networks: Control, Computation, Communications (DCCN-2019, Moscow)

Обозначение и номер тома: 

V. 1141

Город: 

  • Cham, Switzerland

Издательство: 

  • Springer

Год издания: 

2019

Страницы: 

302-314
Аннотация
We model the distribution tails of the end-to-end delay of services with the help of two-parameter Weibull-tail and log-Weibull-tail distributions. First we discuss the role of the Weibull-tail and log-Weibull-tail distributions in statistics of extremes. Then we propose the statistical procedure based on the largest observations of a sample to decide between these two tail models and to estimate the parameters of the selected model. The proposed procedure allows us to estimate the extreme quantiles from the Weibull-tail and log-Weibull-tail distributions in an unified way. The efficiency of the introduced methods is illustrated on a small simulation study.

Библиографическая ссылка: 

Родионов И.В. On Estimation of Weibull-Tail and Log-Weibull-tail Distributions for Modeling End-to-end Delay / Proceedings of the 22nd International Conference on Distributed Computer and Communication Networks: Control, Computation, Communications (DCCN-2019, Moscow). Cham, Switzerland: Springer, 2019. V. 1141. С. 302-314.

54805

Автор(ы): 

Автор(ов): 

2

Параметры публикации

Тип публикации: 

Доклад

Название: 

On Optimal Control Policy of MAP(t)/M/2 Queueing System with Heterogeneous Servers and Periodic Arrival Process

ISBN/ISSN: 

978-3-030-36613-1

DOI: 

10.1007/978-3-030-36614-8

Наименование конференции: 

  • 22nd International Conference on Distributed Computer and Communication Networks: Control, Computation, Communications (DCCN-2019, Moscow)

Наименование источника: 

  • Proceedings of the 22nd International Conference on Distributed Computer and Communication Networks: Control, Computation, Communications (DCCN-2019, Moscow)

Обозначение и номер тома: 

LNCS 11965

Город: 

  • Cham

Издательство: 

  • Springer

Год издания: 

2019

Страницы: 

179-194
Аннотация
In this paper we consider an optimal control problem for the MAP(t)/M/2 queueing system with heterogeneous servers is introduced. The Markov arrival process (MAP) has time-dependent and periodic rates for phase transitions.We built a continuous time finite-horizon Markov decision process (MDP) with the aim to minimize a cost function. We solve a Bellman equation as a system of ordinary differential equations with time-dependent coefficients. We show that the optimal policy is of threshold type with threshold levels depending on the phases of arrival process. Moreover, the periodic variation of arrival attributes makes a threshold control policy piecewise constant time-dependent and periodic. We study numerically the speed of convergence of the policy to a periodic pattern. For the fixed control policy we calculate a transient solution. and provide a sensitivity analysis to determine how sensitive the performance measures are to changes in parameter values and in inter-arrival time correlation.

Библиографическая ссылка: 

Ефросинин Д.В., Степанова Н.В. On Optimal Control Policy of MAP(t)/M/2 Queueing System with Heterogeneous Servers and Periodic Arrival Process / Proceedings of the 22nd International Conference on Distributed Computer and Communication Networks: Control, Computation, Communications (DCCN-2019, Moscow). Cham: Springer, 2019. LNCS 11965. С. 179-194.

54803

Автор(ы): 

Автор(ов): 

2

Параметры публикации

Тип публикации: 

Доклад

Название: 

Distributed Data Compression Algorithm for Low-Power Wide-Area Networks

ISBN/ISSN: 

978-3-030-36625-4

DOI: 

10.1007/978-3-030-36625-4_14

Наименование конференции: 

  • 22nd International Conference on Distributed Computer and Communication Networks: Control, Computation, Communications (DCCN-2019, Moscow)

Наименование источника: 

  • Proceedings of the 22nd International Conference on Distributed Computer and Communication Networks: Control, Computation, Communications (DCCN-2019, Moscow)

Обозначение и номер тома: 

v. 1141

Город: 

  • Москва

Издательство: 

  • Springer

Год издания: 

2019

Страницы: 

163-173
Аннотация
A distributed data compression algorithm for low-power wide-aria networks is proposed. The algorithm is based on prediction of observed process on server side with controlling prediction error on the end device side. The prediction is completed by recursive linear prediction algorithm using Levinson-Durbin recursion. The algorithm provides obtaining the estimated values in real time on server side with no sending any data through the network until prediction error exceeded threshold. It allows to use wireless transceiver less intensively saving the battery budget this way, and to reduce number of packets and its length saving the wireless channel capacity. The efficiency of algorithm is investigated on end device and server models using the real data collected by CO2, humidity and light sensors.

Библиографическая ссылка: 

Душин С.В., Фролов С.А. Distributed Data Compression Algorithm for Low-Power Wide-Area Networks / Proceedings of the 22nd International Conference on Distributed Computer and Communication Networks: Control, Computation, Communications (DCCN-2019, Moscow). М.: Springer, 2019. v. 1141. С. 163-173.

54798

Автор(ы): 

Автор(ов): 

2

Параметры публикации

Тип публикации: 

Доклад

Название: 

Reliability analysis of systems with hybrid recovery and imperfect built-in-test

ISBN/ISSN: 

978-3-030-36625-4/1865-0929

DOI: 

10.1007/978-3-030-36625-4_33

Наименование конференции: 

  • 22nd International Conference on Distributed Computer and Communication Networks: Control, Computation, Communications (DCCN-2019, Moscow)

Наименование источника: 

  • Proceedings of the 22nd International Conference on Distributed Computer and Communication Networks: Control, Computation, Communications (DCCN-2019, Moscow)

Город: 

  • Cham

Издательство: 

  • Springer

Год издания: 

2019

Страницы: 

413-423
Аннотация
The paper describes approach to reliability analysis of systems with cyclic mode of operation, in which recovery actions after failures become possible only in offline mode. Theoretical basis of this investigation is continuous-time discrete state Markov processes. Complex reliability measure which is both cumulative and instantaneous is created for investigation of operative availability of such systems. Step by step schema for calculating operative availability index is suggested. Results of analysis of main redundant configurations of these systems with imperfect fault coverage are presented.

Библиографическая ссылка: 

Степанянц А.С., Викторова В.С. Reliability analysis of systems with hybrid recovery and imperfect built-in-test / Proceedings of the 22nd International Conference on Distributed Computer and Communication Networks: Control, Computation, Communications (DCCN-2019, Moscow). Cham: Springer, 2019. С. 413-423.

54481

Автор(ы): 

Автор(ов): 

6

Параметры публикации

Тип публикации: 

Глава в книге

Название: 

Pharmaceutical Policy in Russia

Сведения об издании: 

1-e изд.

ISBN/ISSN: 

978-3-319-51672-1

DOI: 

10.1007/978-3-319-51673-8_13

Наименование источника: 

  • Pharmaceutical Policy in Countries with Developing Healthcare Systems

Город: 

  • Babar

Издательство: 

  • Springer

Год издания: 

2017

Страницы: 

261-285

Библиографическая ссылка: 

Хабриев Р.У., Мешков Д.О., Безмельницына Л.Ю., Черкасов С.Н., Берсенева Е.А., Scahill S.N. Pharmaceutical Policy in Russia / Pharmaceutical Policy in Countries with Developing Healthcare Systems. Babar: Springer, 2017. С. 261-285.

54126

Автор(ы): 

Автор(ов): 

1

Параметры публикации

Тип публикации: 

Статья в журнале/сборнике

Название: 

A System with Warm Standby

ISBN/ISSN: 

ISBN 978-3-030-21952-9

DOI: 

https://doi.org/10.1007/978-3-030-21952-9_28

Наименование источника: 

  • Computer Networks (Proceedings of the 26th International Conference (CN 2019, Kamień Śląski, Poland)

Город: 

  • Cham

Издательство: 

  • Springer

Год издания: 

2019

Страницы: 

387-399
Аннотация
Рассмотрена математическая модель восстанавливаемой системы с теплым резервом, в случае, когда все рабочие и ремонтные времена ограничены экспоненциальной случайной величиной (сверху и снизу), а рабочие и ремонтные времена могут быть зависимыми. Показано, что оценка сверху границы скорости сходимости распределения этой системы экспоненциальны. Оценены границы скорости сходимости коэффициента готовности.

Библиографическая ссылка: 

Зверкина Г.А. A System with Warm Standby / Computer Networks (Proceedings of the 26th International Conference (CN 2019, Kamień Śląski, Poland). Cham: Springer, 2019. С. 387-399.

53940

Автор(ы): 

Автор(ов): 

3

Параметры публикации

Тип публикации: 

Статья в журнале/сборнике

Название: 

The average covering tree value for directed graph games

ISBN/ISSN: 

1573-2886

DOI: 

10.1007/s10878-019-00471-5

Наименование источника: 

  • Journal of Combinatorial Optimization

Обозначение и номер тома: 

Т. 39, вып. 2

Город: 

  • New York

Издательство: 

  • Springer

Год издания: 

2020

Страницы: 

315-333
Аннотация
We introduce a single-valued solution concept, the so-called average covering tree value, for the class of transferable utility games with limited communication structure represented by a directed graph. The solution is the average of the marginal contribution vectors corresponding to all covering trees of the directed graph. The covering trees of a directed graph are those (rooted) trees on the set of players that preserve the dominance relations between the players prescribed by the directed graph. The average covering tree value is component efficient, and under a particular convexity-type condition it is stable. For transferable utility games with complete communication structure the average covering tree value equals to the Shapley value of the game. If the graph is the directed analog of an undirected graph the average covering tree value coincides with the gravity center solution.

Библиографическая ссылка: 

Хмельницкая А.Б., Selçuk Ö., Talman A. J. J. The average covering tree value for directed graph games // Journal of Combinatorial Optimization. 2020. Т. 39, вып. 2. С. 315-333.

53847

Автор(ы): 

Автор(ов): 

3

Параметры публикации

Тип публикации: 

Статья в журнале/сборнике

Название: 

Caristi-Like Condition and the Existence of Minima of Mappings in Partially Ordered Spaces

Наименование источника: 

  • Journal of Optimization Theory and Applications

Обозначение и номер тома: 

Vol. 180, Iss. 1

Город: 

  • New York

Издательство: 

  • Springer

Год издания: 

2019

Страницы: 

48-61
Аннотация
В этой статье исследованы отображения, действующие в частично упорядоченных пространствах. Для этих отображений введено условие, аналогичное условию Каристи, используемое для функций, определенных в метрических пространствах. Доказано утверждение о достижении минимальной точки отображением частично упорядоченных пространств. Показано, что из полученного предложения следует известный результат о существовании минимума полунепрерывной снизу функции, определенной на полном метрическом пространстве. Получены новые результаты о точках совпадений отображений частично упорядоченных пространств.

Библиографическая ссылка: 

Арутюнов А.В., Жуковский Е.С., Жуковский С.Е. Caristi-Like Condition and the Existence of Minima of Mappings in Partially Ordered Spaces // Journal of Optimization Theory and Applications. 2019. Vol. 180, Iss. 1. С. 48-61.

53732

Автор(ы): 

Автор(ов): 

1

Параметры публикации

Тип публикации: 

Доклад

Название: 

Intelligent Information Technologies in Social Safety

Электронная публикация: 

Да

ISBN/ISSN: 

978-3-030-29750-3

DOI: 

10.1007/978-3-030-29750-3_21

Наименование конференции: 

  • Conference on Creativity in Intelligent Technologies and Data Science (CIT&DS 2019)

Наименование источника: 

  • Proceedings of the Conference on Creativity in Intelligent Technologies and Data Science (CIT&DS 2019, Volgograd)

Обозначение и номер тома: 

Т. 1084

Город: 

  • Волгоград

Издательство: 

  • Springer

Год издания: 

2019

Страницы: 

270-284
Аннотация
Public safety issues are explored in a community model consisting of sensible, forward-looking (onward) elements. A neuropsychological model of onward element is considered. The concept of the sense of his life connected with the hope for a positive emotion in the future is introduced. It is assumed that the safety of community ensures the existence of a sense of life for all its members. One type of onward element is the Progressist governed by desires. It is shown that for the safety of a community consisting of Progressists, it is necessary and sufficient to create a sequence of incentives that contribute to the fulfillment of the desires of each member of the community. The other type of onward element - Phobic acts in nasty medium that causes irritation. It is shown that regular creation of irritants provides the sense of its life, so the community of Phobics is safe. Information technologies in social safety engineering based on obtained theoretical results are considered.

Библиографическая ссылка: 

Цыганов В.В. Intelligent Information Technologies in Social Safety / Proceedings of the Conference on Creativity in Intelligent Technologies and Data Science (CIT&DS 2019, Volgograd). Волгоград: Springer, 2019. Т. 1084. С. 270-284.

Страницы