Computational algorithms for closed queueing networks with exponential servers
Communications of the ACM
Validation of a computer performance model of the exponential queuing network family
SIGMETRICS '76 Proceedings of the 1976 ACM SIGMETRICS conference on Computer performance modeling measurement and evaluation
| Hi-index | 0.00 |
A computer facility, when attempting to derive a charging algorithm from scratch, is under the best of circumstances faced with a formidable task. Even after the basic structure of the pricing algorithm has been determined, a substantial amount of work remains in estimating the volume of future workloads in terms compatible with the algorithm structure, determining the anticipated direct and indirect costs, relating algorithm elements with accounting data, implementing billing mechanisms, etc. In the face of the overall amount of work involved, there appears to be a general tendency to treat the determining of the general structure of the pricing algorithm itself as being a relatively straight-forward process which can be worked out using generally accepted principles, in contrast to the choice and calculation of the algorithm's various coefficients which of course must be executed using the specific parameters pertinent to the given installation.