Robustness of Queuing Network Formulas

92Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.

Abstract

Analyuc models of queuing networks have been observed to give good results for systems which do not conform to the assumptions of classical queuing theory This has been explained to some extent by the recently proposed concept of operational analysis However, the use of operational analysis for prediction of system performance revolves a restrictive assumption, that of homogeneous service tnnes (HST), and practical systems often deviate from HST behavior. It is shown that the main system performance measures are surpnsmgly insensitive to violations of the HST assumption. This further explains the robustness of analyacal models for predicting performance of queuing networks Some issues regarding the operational versus stochasuc approaches are resolved, since it is clatmed that the present analysis, which is carried out m the operational framework, cannot be meaningfully carried out in the stochastic framework. © 1983, ACM. All rights reserved.

Cite

CITATION STYLE

APA

Suri, R. (1983). Robustness of Queuing Network Formulas. Journal of the ACM (JACM), 30(3), 564–594. https://doi.org/10.1145/2402.2995

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free