On the use of iterative approximations in queueing networks, with simple applications

J. Wessels

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review


    Networks of queues which have a productform solution can be analyzed easily by the convolution method or with mean value analysis. Regrettably, however, many practical queueing network models do not possess a productform solution. In this paper the following approach is advocated for models with slight deviations from the productform conditions: approximate the model interatively by a sequence of models which satisfy conditions for simple analysis.

    Quite often aggregation and mean value analysis provide the natural approach for designing an iteration step.

    Applications which are mentioned are: two-phase servers where the first phase is a preparatory one; a type of priorities; blocking; many-chains networks; FCFS-servers with different workloads for different types of customers.
    Original languageEnglish
    Title of host publicationDGOR
    Subtitle of host publicationPapers of the 12th Annual Meeting / Vorträge der 12. Jahrestagung
    EditorsH. Steckhan, K.E. Jäger, Ch. Schneeweiss, J. Schwarze
    Place of PublicationBerlin
    ISBN (Electronic)978-3-642-69546-9
    ISBN (Print)3-540-13134-5, 978-3-540-13134-2
    Publication statusPublished - 1984
    Event12th Annual Meeting of DGOR - Mannheim, Germany
    Duration: 21 Sep 198323 Sep 1983

    Publication series

    NameOperations Research Proceedings (ORP)


    Conference12th Annual Meeting of DGOR

    Fingerprint Dive into the research topics of 'On the use of iterative approximations in queueing networks, with simple applications'. Together they form a unique fingerprint.

    Cite this