A decomposition approximation method for multiclass BCMP queueing networks with multiple-server stations

Bruno Baynat, Yves Dallery, Keith Ross

    Research output: Contribution to journalArticle

    Abstract

    Closed multiclass separable queueing networks can in principle be analyzed using exact computational algorithms. This, however, may not be feasible in the case of large networks. As a result, much work has been devoted to developing approximation techniques, most of which is based on heuristic extensions of the mean value analysis (MVA) algorithm. In this paper, we propose an alternative approximation method to analyze large separable networks. This method is based on an approximation method for non-separable networks recently proposed by Baynat and Dallery. We show how this method can be efficiently used to analyze large separable networks. It is especially of interest when dealing with networks having multiple-server stations. Numerical results show that this method has good accuracy.

    Original languageEnglish (US)
    Pages (from-to)273-294
    Number of pages22
    JournalAnnals of Operations Research
    Volume48
    Issue number3
    DOIs
    StatePublished - Jun 1994

    ASJC Scopus subject areas

    • Decision Sciences(all)
    • Management Science and Operations Research

    Fingerprint Dive into the research topics of 'A decomposition approximation method for multiclass BCMP queueing networks with multiple-server stations'. Together they form a unique fingerprint.

    Cite this