Decomposition-Based Queueing Network Analysis with FiFiQueues

Ramin Sadre*, Boudewijn R. Haverkort

*Corresponding author for this work

    Research output: Chapter in Book/Report/Conference proceedingChapterAcademic

    11 Citations (Scopus)
    435 Downloads (Pure)


    In this paper we present an overview of decomposition-based analysis techniques for large open queueing networks. We present a general decomposition-based solution framework, without referring to any particular model class, and propose a general fixed-point iterative solution method for it. We concretize this framework by describing the well-known QNA method, as proposed by Whitt in the early 1980s, in that context, before describing our FiFiQueues approach. FiFiQueues allows for the efficient analysis of large open queueing networks of which the interarrival and service time distributions are of phase-type; individual queues, all with single servers, can have bounded or unbounded buffers. Next to an extensive evaluation with generally very favorable results for FiFiQueues, we also present a theorem on the existence of a fixed-point solution for FiFiQueues.
    Original languageEnglish
    Title of host publicationQueueing Networks
    Subtitle of host publicationA Fundamental Approach
    EditorsRichard J. Boucherie, Nico M. van Dijk
    Place of PublicationNew York
    Number of pages57
    ISBN (Electronic)978-1-4419-6472-4
    ISBN (Print)978-1-4419-6471-7, 978-1-4614-2773-5
    Publication statusPublished - 2011

    Publication series

    NameInternational Series in Operations Research & Management Science
    ISSN (Print)0884-8289
    ISSN (Electronic)2214-7934


    • Decomposition
    • QNA
    • Fixed-point
    • Queueing networks


    Dive into the research topics of 'Decomposition-Based Queueing Network Analysis with FiFiQueues'. Together they form a unique fingerprint.

    Cite this