Research output: Chapter in Book/Report/Conference proceeding › Article in an anthology › Research › peer-review
Monotonicity properties and simple bounds on the mean cycle time in acyclic fork-join queueing networks. / Krivulin, Nikolai K.
Recent Advances in Information Science and Technology. ed. / Nikos E. Mastorakis. WORLD SCIENTIFIC PUBL CO PTE LTD, 1998. p. 147-152.Research output: Chapter in Book/Report/Conference proceeding › Article in an anthology › Research › peer-review
}
TY - CHAP
T1 - Monotonicity properties and simple bounds on the mean cycle time in acyclic fork-join queueing networks
AU - Krivulin, Nikolai K.
PY - 1998
Y1 - 1998
N2 - The (max,+)-algebra approach is applied to establish some monotonicity properties and to get algebraic bounds on the service cycle completion times in acyclic fork-join queueing networks. The obtained results are extended to derive simple lower and upper bounds on the mean cycle time in stochastic networks.
AB - The (max,+)-algebra approach is applied to establish some monotonicity properties and to get algebraic bounds on the service cycle completion times in acyclic fork-join queueing networks. The obtained results are extended to derive simple lower and upper bounds on the mean cycle time in stochastic networks.
UR - https://www.worldscientific.com/worldscibooks/10.1142/3946#t=aboutBook
M3 - Article in an anthology
SN - 9789810236571
SP - 147
EP - 152
BT - Recent Advances in Information Science and Technology
A2 - Mastorakis, Nikos E.
PB - WORLD SCIENTIFIC PUBL CO PTE LTD
ER -
ID: 4409839