The solution of homogeneous queueing networks with many job classes☆

https://doi.org/10.1016/0164-1212(86)90022-1Get rights and content

Abstract

Two general-purpose algorithms exist for the solution of product-form queueing network models: convolution and mean-value analysis. Because the space and time complexity of both of these algorithms is exponential in the number of classes in the model, they are for most purposes useless for the solution of networks with many jobs (and few jobs per class). We describe a new algorithm, having polynomial space and time complexity, that is specifically designed for the solution of queueing networks in which the classes exhibit highly symmetric patterns and in which the service stations, whose behavior is the primary object of the evaluation, have identical service characteristics. This category of queueing networks arises naturally in the modeling of local area networks.

References (23)

  • G. Balbo et al.

    Computational Aspects of Aggregation in Multiple Class Queueing Networks

    Performance Evaluation (An International Journal)

    (1983)
  • S.C. Agrawal

    Metamodeling: A Study of Approximations in Queueing Models

  • G. Balbo et al.

    A Numerically Stable Algorithm for the Solution of Closed Load Dependent Queueing Networks

  • Y. Bard

    Some extensions to multiclass queueing network analysis

  • F. Baskett et al.

    Open, Closed and Mixed Networks of Queues with Different Classes of Customers

    J. ACM

    (1975)
  • R. Berry et al.

    Performance Models of Token Ring Local Area Networks

    Performance Evaluation Review

    (Aug 1983)
  • S.C. Bruell et al.

    Computational Algorithms for Closed Queueing Networks

  • S.C. Bruell et al.

    A mean value analysis based package for the solution of product-form queueing network models

  • J.P. Buzen

    Computational Algorithms for Closed Queueing Networks with Exponential Servers

    Commun. ACM

    (Sept 1973)
  • J.P. Buzen et al.

    State Space Transformations in Queueing Network Models

    Performance Evaluation Reveiw

    (Aug 1983)
  • K.M. Chandy et al.

    Parametric Analysis of Queueing Networks

    IBM Journal of Research and Development

    (Jan 1975)

    • Cited by (0)

    ☆

    This work was supported in part by Nato Research Grant 280.81 and a University of Minnesota Graduate School Fellowship.

    View full text
    Copyright © 1986 Published by Elsevier Inc.