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

Research outputpeer-review

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

Scopus subject areas

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

Fingerprint Dive into the research topics of 'Monotonicity properties and simple bounds on the mean cycle time in acyclic fork-join queueing networks'. Together they form a unique fingerprint.

Cite this