Models for queue length in clocked queueing networks

Ora E. Percus, J. K. Percus

Research output: Contribution to journalArticlepeer-review

Abstract

We analyze a discrete‐time network of queues. The unit element of the network is the 2 × 2 buffered switch, which we regard as a system of two queues working in parallel. We show how to transform transition probability information from the output of one switch, or network stage, to the input of the next one. This is used to carry out a Markov time series input model to predict mean queue length at every stage of the system. Another model considered is a renewal process time series model, which we use to find the mean queue length of the second stage of the network. Numerical simulations fall within the narrow band spanned by the two models.

Original languageEnglish (US)
Pages (from-to)273-289
Number of pages17
JournalCommunications on Pure and Applied Mathematics
Volume43
Issue number2
DOIs
StatePublished - Mar 1990

ASJC Scopus subject areas

  • Mathematics(all)
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Models for queue length in clocked queueing networks'. Together they form a unique fingerprint.

Cite this