Acyclic Fork-Join Queuing Networks

François Baccelli, William Alfred Massey, Don Towsley

Research output: Contribution to journalArticlepeer-review

104 Scopus citations

Abstract

In this paper the class of acyclic fork-join queuing networks that arise in various applications, including parallel processing and flexible manufacturing are studied. In such queuing networks, a fork describes the simultaneous creation of several new customers, which are sent to different queues. The corresponding join occurs when the services of all these new customers are completed. The evolution equations that govern the behavior of such networks are derived. From this, the stability conditions are obtained and upper and lower bounds on the network response times are developed. These bounds are based on various stochastic ordering principles and on the notion of association of random variables.

Original languageEnglish (US)
Pages (from-to)615-642
Number of pages28
JournalJournal of the ACM (JACM)
Volume36
Issue number3
DOIs
StatePublished - Jan 7 1989
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Software
  • Control and Systems Engineering
  • Information Systems
  • Hardware and Architecture
  • Artificial Intelligence

Fingerprint Dive into the research topics of 'Acyclic Fork-Join Queuing Networks'. Together they form a unique fingerprint.

Cite this