Algebraic modelling and performance evaluation of acyclic fork-join queueing networks

Nikolai K. Krivulin

doi:10.1007/978-1-4612-1318-5_5

Algebraic modelling and performance evaluation of acyclic fork-join queueing networks

Кафедра статистического моделирования

Результат исследований: Публикации в книгах, отчётах, сборниках, трудах конференций › глава/раздел › научная › рецензирование

Аннотация

Simple lower and upper bounds on service cycle times in stochastic acyclic fork-join queueing networks are derived using a (max,+)-algebra based representation of network dynamics. The behaviour of the bounds under various assumptions concerning the service times in the networks is discussed, and related numerical examples are presented.

Язык оригинала	английский
Название основной публикации	Advances in Stochastic Simulation Methods
Редакторы	N. Balakrishnan, V. Melas, S. Ermakov
Издатель	Birkhäuser Verlag AG
Страницы	63-81
ISBN (электронное издание)	978-1-4612-1318-5
ISBN (печатное издание)	978-0-8176-4107-8
DOI	https://doi.org/10.1007/978-1-4612-1318-5_5
Состояние	Опубликовано - 2000

Серия публикаций

Название	Statistics for Industry and Technology
Издатель	Birkhäuser Boston
ISSN (печатное издание)	2364-6241

Предметные области Scopus

Моделирование и симуляция
Теория управления и исследование операций
Алгебра и теория чисел

Доступ к документу

10.1007/978-1-4612-1318-5_5

Fingerprint

Подробные сведения о темах исследования «Algebraic modelling and performance evaluation of acyclic fork-join queueing networks». Вместе они формируют уникальный семантический отпечаток (fingerprint).

1 выступление с устной презентацией

Simple bounds on the mean cycle time in acyclic queueing networks
Николай Кимович Кривулин (Докладчик)
28 июн 1998 → 3 июл 1998
Деятельность: выступление › выступление с устной презентацией

Цитировать

@inbook{28b12e8ac8594cd9ae496ec6c4787e9e,

title = "Algebraic modelling and performance evaluation of acyclic fork-join queueing networks",

abstract = "Simple lower and upper bounds on service cycle times in stochastic acyclic fork-join queueing networks are derived using a (max,+)-algebra based representation of network dynamics. The behaviour of the bounds under various assumptions concerning the service times in the networks is discussed, and related numerical examples are presented.",

keywords = "(max+)-algebra, dynamic state equation, acyclic fork-join queueing networks, stochastic dynamic systems, service cycle time",

author = "Krivulin, {Nikolai K.}",

year = "2000",

doi = "10.1007/978-1-4612-1318-5_5",

language = "English",

isbn = "978-0-8176-4107-8",

series = "Statistics for Industry and Technology",

publisher = "Birkh{\"a}user Verlag AG",

pages = "63--81",

editor = "N. Balakrishnan and V. Melas and S. Ermakov",

booktitle = "Advances in Stochastic Simulation Methods",

address = "Switzerland",

}

Algebraic modelling and performance evaluation of acyclic fork-join queueing networks. / Krivulin, Nikolai K.

Advances in Stochastic Simulation Methods. ред. / N. Balakrishnan; V. Melas; S. Ermakov. Birkhäuser Verlag AG, 2000. стр. 63-81 (Statistics for Industry and Technology).

Результат исследований: Публикации в книгах, отчётах, сборниках, трудах конференций › глава/раздел › научная › рецензирование

TY - CHAP

T1 - Algebraic modelling and performance evaluation of acyclic fork-join queueing networks

AU - Krivulin, Nikolai K.

PY - 2000

Y1 - 2000

N2 - Simple lower and upper bounds on service cycle times in stochastic acyclic fork-join queueing networks are derived using a (max,+)-algebra based representation of network dynamics. The behaviour of the bounds under various assumptions concerning the service times in the networks is discussed, and related numerical examples are presented.

AB - Simple lower and upper bounds on service cycle times in stochastic acyclic fork-join queueing networks are derived using a (max,+)-algebra based representation of network dynamics. The behaviour of the bounds under various assumptions concerning the service times in the networks is discussed, and related numerical examples are presented.

KW - (max+)-algebra

KW - dynamic state equation

KW - acyclic fork-join queueing networks

KW - stochastic dynamic systems

KW - service cycle time

U2 - 10.1007/978-1-4612-1318-5_5

DO - 10.1007/978-1-4612-1318-5_5

M3 - Chapter

SN - 978-0-8176-4107-8

T3 - Statistics for Industry and Technology

SP - 63

EP - 81

BT - Advances in Stochastic Simulation Methods

A2 - Balakrishnan, N.

A2 - Melas, V.

A2 - Ermakov, S.

PB - Birkhäuser Verlag AG

ER -

Algebraic modelling and performance evaluation of acyclic fork-join queueing networks

Аннотация

Серия публикаций

Предметные области Scopus

Доступ к документу

Fingerprint

Виды деятельности

Simple bounds on the mean cycle time in acyclic queueing networks

Цитировать