Standard

Evaluation of the mean cycle time in fork-join queueing networks. / Krivulin, N. K.

In: Vestnik St. Petersburg University: Mathematics, Vol. 35, No. 3, 2002, p. 20-26.

Research output: Contribution to journal › Article › peer-review

Harvard

Krivulin, NK 2002, 'Evaluation of the mean cycle time in fork-join queueing networks', Vestnik St. Petersburg University: Mathematics, vol. 35, no. 3, pp. 20-26.

APA

Krivulin, N. K. (2002). Evaluation of the mean cycle time in fork-join queueing networks. Vestnik St. Petersburg University: Mathematics, 35(3), 20-26.

Vancouver

Krivulin NK. Evaluation of the mean cycle time in fork-join queueing networks. Vestnik St. Petersburg University: Mathematics. 2002;35(3):20-26.

Author

Krivulin, N. K. / Evaluation of the mean cycle time in fork-join queueing networks. In: Vestnik St. Petersburg University: Mathematics. 2002 ; Vol. 35, No. 3. pp. 20-26.

BibTeX

@article{7213731728544f7d99fe915c531d8a95,
title = "Evaluation of the mean cycle time in fork-join queueing networks",
abstract = "The problem of evaluating the mean service cycle time in fork-join queueing networks is considered. An approach is proposed based on implementation and further development of the methods of idempotent algebra. It is shown that for acyclic networks under sufficiently general conditions the mean cycle time is determined by mean service time at the network nodes only and it is independent of network topology.",
author = "Krivulin, {N. K.}",
year = "2002",
language = "English",
volume = "35",
pages = "20--26",
journal = "Vestnik St. Petersburg University: Mathematics",
issn = "1063-4541",
publisher = "Pleiades Publishing",
number = "3",

}

RIS

TY - JOUR

T1 - Evaluation of the mean cycle time in fork-join queueing networks

AU - Krivulin, N. K.

PY - 2002

Y1 - 2002

N2 - The problem of evaluating the mean service cycle time in fork-join queueing networks is considered. An approach is proposed based on implementation and further development of the methods of idempotent algebra. It is shown that for acyclic networks under sufficiently general conditions the mean cycle time is determined by mean service time at the network nodes only and it is independent of network topology.

AB - The problem of evaluating the mean service cycle time in fork-join queueing networks is considered. An approach is proposed based on implementation and further development of the methods of idempotent algebra. It is shown that for acyclic networks under sufficiently general conditions the mean cycle time is determined by mean service time at the network nodes only and it is independent of network topology.

M3 - Article

VL - 35

SP - 20

EP - 26

JO - Vestnik St. Petersburg University: Mathematics

JF - Vestnik St. Petersburg University: Mathematics

SN - 1063-4541

IS - 3

ER -

ID: 5304957