Monotonicity properties and simple bounds on the mean cycle time in acyclic fork-join queueing networks

Research output

Abstract

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.
Original languageEnglish
Title of host publicationRecent Advances in Information Science and Technology
EditorsNikos E. Mastorakis
PublisherWORLD SCIENTIFIC PUBL CO PTE LTD
Pages147-152
ISBN (Print)981-02-3657-3
Publication statusPublished - 1998

Fingerprint

Queueing networks
Algebra

Scopus subject areas

  • Modelling and Simulation
  • Management Science and Operations Research
  • Algebra and Number Theory

Cite this

Krivulin, N. K. (1998). Monotonicity properties and simple bounds on the mean cycle time in acyclic fork-join queueing networks. In N. E. Mastorakis (Ed.), Recent Advances in Information Science and Technology (pp. 147-152). WORLD SCIENTIFIC PUBL CO PTE LTD.
Krivulin, Nikolai K. / Monotonicity properties and simple bounds on the mean cycle time in acyclic fork-join queueing networks. Recent Advances in Information Science and Technology. editor / Nikos E. Mastorakis. WORLD SCIENTIFIC PUBL CO PTE LTD, 1998. pp. 147-152
@inbook{7ea6fad42a9a44ab879efa30a3e63c93,
title = "Monotonicity properties and simple bounds on the mean cycle time in acyclic fork-join queueing networks",
abstract = "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.",
author = "Krivulin, {Nikolai K.}",
year = "1998",
language = "English",
isbn = "981-02-3657-3",
pages = "147--152",
editor = "Mastorakis, {Nikos E.}",
booktitle = "Recent Advances in Information Science and Technology",
publisher = "WORLD SCIENTIFIC PUBL CO PTE LTD",
address = "Singapore",

}

Krivulin, NK 1998, Monotonicity properties and simple bounds on the mean cycle time in acyclic fork-join queueing networks. in NE Mastorakis (ed.), Recent Advances in Information Science and Technology. WORLD SCIENTIFIC PUBL CO PTE LTD, pp. 147-152.

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

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.

M3 - Article in an anthology

SN - 981-02-3657-3

SP - 147

EP - 152

BT - Recent Advances in Information Science and Technology

A2 - Mastorakis, Nikos E.

PB - WORLD SCIENTIFIC PUBL CO PTE LTD

ER -

Krivulin NK. Monotonicity properties and simple bounds on the mean cycle time in acyclic fork-join queueing networks. In Mastorakis NE, editor, Recent Advances in Information Science and Technology. WORLD SCIENTIFIC PUBL CO PTE LTD. 1998. p. 147-152