Models for queue length in clocked queueing networks

Ora E. Percus, Jerome Percus

Research output: Contribution to journalArticle

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 - 1990

Fingerprint

Queueing networks
Queueing Networks
Queue Length
Queue
Time series
Switch
Switches
Renewal Process
Time Series Models
Transition Probability
Model
Process Model
Discrete-time
Transform
Predict
Numerical Simulation
Unit
Output
Computer simulation

ASJC Scopus subject areas

  • Mathematics(all)
  • Applied Mathematics

Cite this

Models for queue length in clocked queueing networks. / Percus, Ora E.; Percus, Jerome.

In: Communications on Pure and Applied Mathematics, Vol. 43, No. 2, 1990, p. 273-289.

Research output: Contribution to journalArticle

Percus, Ora E. ; Percus, Jerome. / Models for queue length in clocked queueing networks. In: Communications on Pure and Applied Mathematics. 1990 ; Vol. 43, No. 2. pp. 273-289.
@article{61ed60e15cd1411098bdbca85a374660,
title = "Models for queue length in clocked queueing networks",
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.",
author = "Percus, {Ora E.} and Jerome Percus",
year = "1990",
doi = "10.1002/cpa.3160430205",
language = "English (US)",
volume = "43",
pages = "273--289",
journal = "Communications on Pure and Applied Mathematics",
issn = "0010-3640",
publisher = "Wiley-Liss Inc.",
number = "2",

}

TY - JOUR

T1 - Models for queue length in clocked queueing networks

AU - Percus, Ora E.

AU - Percus, Jerome

PY - 1990

Y1 - 1990

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84990623981&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84990623981&partnerID=8YFLogxK

U2 - 10.1002/cpa.3160430205

DO - 10.1002/cpa.3160430205

M3 - Article

AN - SCOPUS:84990623981

VL - 43

SP - 273

EP - 289

JO - Communications on Pure and Applied Mathematics

JF - Communications on Pure and Applied Mathematics

SN - 0010-3640

IS - 2

ER -