Decomposition and aggregation in queueing networks

Tijs Huisman

Research output: Chapter in Book/Report/Conference proceedingChapterAcademicpeer-review

2 Citations (Scopus)
116 Downloads (Pure)

Abstract

This chapter considers the decomposition and aggregation of multiclass queueing networks with state-dependent routing. Combining state-dependent generalisations of quasi-reversibility and biased local balance, sufficient conditions are obtained under which the stationary distribution of the network is of product-form. This product-formfactorises into one part that describes the nodes of the network in isolation, and one part that describes the routing and the global network state. It is shown that a decomposition holds for general nodes if the input-output behaviour of these nodes is suitably compensated by the state-dependent routing function. When only a subset of the nodes is of interest, it is shown that the other nodes may be aggregated into nodes that only capture their global behaviour. The results both unify and extend existing classes of product-form networks, as is illustrated by several cases and an example of an assembly network.
Original languageUndefined
Title of host publicationQueueing Networks: A Fundamental Approach
EditorsRichardus J. Boucherie, Nico van Dijk, Nico M. van Dijk
Place of PublicationNew York
PublisherSpringer
Pages313-344
Number of pages32
ISBN (Print)978-1-4419-6471-7
DOIs
Publication statusPublished - 2011

Publication series

NameInternational Series in Operations Research & Management Science
PublisherSpringer Science + Business Media
Number154
Volume154
ISSN (Print)0884-8289

Keywords

  • METIS-277442
  • EWI-18751
  • IR-75065

Cite this

Huisman, T. (2011). Decomposition and aggregation in queueing networks. In R. J. Boucherie, N. van Dijk, & N. M. van Dijk (Eds.), Queueing Networks: A Fundamental Approach (pp. 313-344). (International Series in Operations Research & Management Science; Vol. 154, No. 154). New York: Springer. https://doi.org/10.1007/978-1-4419-6472-4_7