Robustness of queuing networks formulas. (English) Zbl 0628.68036

Suri, Rajan

J. Assoc. Comput. Mach. 30, 564-594 (1983).

Analytic 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 involves a restrictive assumption, that of homogeneous service times (HST), and practical systems often deviate from HST behavior. It is shown that the main system performance measures are surprisingly insensitive to violations of the HST assumption. This further explains the robustness of analytical models for predicting performance of queuing networks. Some issues regarding the operational versus stochastic approaches are resolved, since it is claimed that the present analysis, which is carried out in the operational framework, cannot be meaningfully carried out in the stochastic framework.

MSC:

68M20	Performance evaluation, queueing, and scheduling in the context of computer systems
68N25	Theory of operating systems

Keywords:

analytical models; sensitivity analysis; performance bounds; queuing networks; operational analysis; homogeneous service times