The power-series algorithm for Markovian queueing networks

W.B. van den Hout, J.P.C. Blanc

Research output: Working paperDiscussion paperOther research output

295 Downloads (Pure)

Abstract

A newversion of the Power-Series Algorithm is developed to compute the steady-state distribution of a rich class of Markovian queueing networks. The arrival process is a Multi-queue Markovian Arrival Process, which is a multi-queue generalization of the BMAP. It includes Poisson, fork and round-robin arrivals. At each queue the service process is a Markovian Service Process, which includes sequences of phase-type distributions, setup times and multi-server queues. The routing is Markovian. The resulting queueing network model is extremely general, which makes the Power-Series Algorithm a useful tool to study load-balancing, capacity-assignment and sequencing problems.
Original languageEnglish
PublisherUnknown Publisher
Volume1994-67
Publication statusPublished - 1994

Publication series

NameCentER Discussion Paper
Volume1994-67

Fingerprint

Queueing networks
Resource allocation
Servers

Keywords

  • Queueing Network
  • operations research

Cite this

van den Hout, W. B., & Blanc, J. P. C. (1994). The power-series algorithm for Markovian queueing networks. (CentER Discussion Paper; Vol. 1994-67). Unknown Publisher.
van den Hout, W.B. ; Blanc, J.P.C. / The power-series algorithm for Markovian queueing networks. Unknown Publisher, 1994. (CentER Discussion Paper).
@techreport{1312893dc3754b17bbbe3ba11549b153,
title = "The power-series algorithm for Markovian queueing networks",
abstract = "A newversion of the Power-Series Algorithm is developed to compute the steady-state distribution of a rich class of Markovian queueing networks. The arrival process is a Multi-queue Markovian Arrival Process, which is a multi-queue generalization of the BMAP. It includes Poisson, fork and round-robin arrivals. At each queue the service process is a Markovian Service Process, which includes sequences of phase-type distributions, setup times and multi-server queues. The routing is Markovian. The resulting queueing network model is extremely general, which makes the Power-Series Algorithm a useful tool to study load-balancing, capacity-assignment and sequencing problems.",
keywords = "Queueing Network, operations research",
author = "{van den Hout}, W.B. and J.P.C. Blanc",
year = "1994",
language = "English",
volume = "1994-67",
series = "CentER Discussion Paper",
publisher = "Unknown Publisher",
type = "WorkingPaper",
institution = "Unknown Publisher",

}

van den Hout, WB & Blanc, JPC 1994 'The power-series algorithm for Markovian queueing networks' CentER Discussion Paper, vol. 1994-67, Unknown Publisher.

The power-series algorithm for Markovian queueing networks. / van den Hout, W.B.; Blanc, J.P.C.

Unknown Publisher, 1994. (CentER Discussion Paper; Vol. 1994-67).

Research output: Working paperDiscussion paperOther research output

TY - UNPB

T1 - The power-series algorithm for Markovian queueing networks

AU - van den Hout, W.B.

AU - Blanc, J.P.C.

PY - 1994

Y1 - 1994

N2 - A newversion of the Power-Series Algorithm is developed to compute the steady-state distribution of a rich class of Markovian queueing networks. The arrival process is a Multi-queue Markovian Arrival Process, which is a multi-queue generalization of the BMAP. It includes Poisson, fork and round-robin arrivals. At each queue the service process is a Markovian Service Process, which includes sequences of phase-type distributions, setup times and multi-server queues. The routing is Markovian. The resulting queueing network model is extremely general, which makes the Power-Series Algorithm a useful tool to study load-balancing, capacity-assignment and sequencing problems.

AB - A newversion of the Power-Series Algorithm is developed to compute the steady-state distribution of a rich class of Markovian queueing networks. The arrival process is a Multi-queue Markovian Arrival Process, which is a multi-queue generalization of the BMAP. It includes Poisson, fork and round-robin arrivals. At each queue the service process is a Markovian Service Process, which includes sequences of phase-type distributions, setup times and multi-server queues. The routing is Markovian. The resulting queueing network model is extremely general, which makes the Power-Series Algorithm a useful tool to study load-balancing, capacity-assignment and sequencing problems.

KW - Queueing Network

KW - operations research

M3 - Discussion paper

VL - 1994-67

T3 - CentER Discussion Paper

BT - The power-series algorithm for Markovian queueing networks

PB - Unknown Publisher

ER -

van den Hout WB, Blanc JPC. The power-series algorithm for Markovian queueing networks. Unknown Publisher. 1994. (CentER Discussion Paper).