Standard

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).

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

Harvard

Krivulin, NK 2000, Algebraic modelling and performance evaluation of acyclic fork-join queueing networks. в N Balakrishnan, V Melas & S Ermakov (ред.), Advances in Stochastic Simulation Methods. Statistics for Industry and Technology, Birkhäuser Verlag AG, стр. 63-81. https://doi.org/10.1007/978-1-4612-1318-5_5

APA

Krivulin, N. K. (2000). Algebraic modelling and performance evaluation of acyclic fork-join queueing networks. в N. Balakrishnan, V. Melas, & S. Ermakov (Ред.), Advances in Stochastic Simulation Methods (стр. 63-81). (Statistics for Industry and Technology). Birkhäuser Verlag AG. https://doi.org/10.1007/978-1-4612-1318-5_5

Vancouver

Krivulin NK. Algebraic modelling and performance evaluation of acyclic fork-join queueing networks. в Balakrishnan N, Melas V, Ermakov S, Редакторы, Advances in Stochastic Simulation Methods. Birkhäuser Verlag AG. 2000. стр. 63-81. (Statistics for Industry and Technology). https://doi.org/10.1007/978-1-4612-1318-5_5

Author

Krivulin, Nikolai K. / Algebraic modelling and performance evaluation of acyclic fork-join queueing networks. Advances in Stochastic Simulation Methods. Редактор / N. Balakrishnan ; V. Melas ; S. Ermakov. Birkhäuser Verlag AG, 2000. стр. 63-81 (Statistics for Industry and Technology).

BibTeX

@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.}",
note = "Krivulin, N.K. (2000). Algebraic Modelling and Performance Evaluation of Acyclic Fork-Join Queueing Networks. In: Balakrishnan, N., Melas, V.B., Ermakov, S. (eds) Advances in Stochastic Simulation Methods. Statistics for Industry and Technology. Birkh{\"a}user, Boston, MA. https://doi.org/10.1007/978-1-4612-1318-5_5",
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",

}

RIS

TY - CHAP

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

AU - Krivulin, Nikolai K.

N1 - Krivulin, N.K. (2000). Algebraic Modelling and Performance Evaluation of Acyclic Fork-Join Queueing Networks. In: Balakrishnan, N., Melas, V.B., Ermakov, S. (eds) Advances in Stochastic Simulation Methods. Statistics for Industry and Technology. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4612-1318-5_5

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 -

ID: 4409604