About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
Performance Evaluation
Paper
An approximation method for a class of queueing systems
Abstract
We consider a queueing system with an ordered hunt. Specifically, we consider a communication system in which messages arrive at a node that has n output links numbered 1,...,n, and an arriving message is processed by the lowest numbered idle link. Obtaining such steady-state parameters as the expected delay of an arbitrary message and the utilization factor of each link requires knowledge of the complete state space of the system and the solution of 2n linear equations. In this paper we develop a method of computing the approximate values of these parameters without the need for the knowledge of the complete state space and the solution of 2n linear equations. © 1985.