The power-series algorithm for Markovian queueing networks

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

Research output: Working paperDiscussion paperOther research output

330 Downloads (Pure)


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
Publication statusPublished - 1994

Publication series

NameCentER Discussion Paper


  • Queueing Network
  • operations research

Fingerprint Dive into the research topics of 'The power-series algorithm for Markovian queueing networks'. Together they form a unique fingerprint.

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