Skip to main content

A note on stable flow-equivalent aggregation in closed networks

Abstract

We introduce the Conditional Mean Value Analysis (CMVA) algorithm, an exact solution method for product-form load-dependent closed queueing networks that provides a numerically stable solution of models where the load-dependent Mean Value Analysis (MVA) is numerically unstable. Similarly to the MVA algorithm for constant-rate queues, CMVA performs operations in terms of mean quantities only, i.e., queue-lengths, throughput, response times. Numerical stability derives from a new version of the MVA arrival theorem for load-dependent models which is expressed in terms of mean queue-lengths instead of marginal probabilities. The formula is obtained by the analysis of the conditional state spaces which describe network equilibrium as seen by jobs during their residence times at queues. We also provide a generalization of CMVA to multiclass models that preserves the numerical stability property.

This is a preview of subscription content, access via your institution.

References

  1. Baskett, F., Chandy, K.M., Muntz, R.R., Palacios, F.G.: Open, closed, and mixed networks of queues with different classes of customers. J. Assoc. Comput. Mach. 22(2), 248–260 (1975)

    Google Scholar 

  2. Buzen, J.P.: Computational algorithms for closed queueing networks with exponential servers. Commmun. ACM 16(9), 527–531 (1973)

    Article  Google Scholar 

  3. Casale, G.: On single-class load-dependent normalizing constant equations. In: Proc of QEST 2006, pp. 333–342, Riverside, CA. IEEE Press, New York (2006)

    Google Scholar 

  4. Chandy, K.M., Herzog, U., Woo, L.: Parametric analysis of queueing networks. IBM J. Res. Develop. 19(1), 36–42 (1975)

    Article  Google Scholar 

  5. de Sousa e Silva, E., Muntz, R.R.: Simple relationships among moments of queue lengths in product form queueing networks. IEEE Trans. Comput. 37(9), 1125–1129 (1988)

    Article  Google Scholar 

  6. Lam, S.: Dynamic scaling and growth behavior of queueing network normalization constants. J. Assoc. Comput. Mach. 29(2), 492–513 (1982)

    Google Scholar 

  7. Lazowska, E.D., Zahorjan, J., Graham, G.S., Sevcik, K.C.: Quantitative System Performance. Prentice-Hall, New York (1984)

    Google Scholar 

  8. Reiser, M.: Mean-value analysis and convolution method for queue-dependent servers in closed queueing networks. Perform. Eval. 1, 7–18 (1981)

    Article  Google Scholar 

  9. Reiser, M., Lavenberg, S.S.: Mean-value analysis of closed multichain queueing networks. J. Assoc. Comput. Mach. 27(2), 312–322 (1980)

    Google Scholar 

  10. Sauer, C.H.: Computational algorithms for state-dependent queueing networks. ACM Trans. Comput. Syst. 1, 67–92 (1983)

    Article  Google Scholar 

  11. Zahorjan, J.: The distribution of network states during residence times in product form queueing networks. Perform. Eval. 4, 99–104 (1984)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Giuliano Casale.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Casale, G. A note on stable flow-equivalent aggregation in closed networks. Queueing Syst 60, 193–202 (2008). https://doi.org/10.1007/s11134-008-9093-6

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11134-008-9093-6

Keywords

  • Queueing networks
  • Flow-equivalent aggregation
  • Product-form
  • Numerical stability

Mathematics Subject Classification (2000)

  • 60K25
  • 68M20