Multivariate rational approximants for multiclass closed queuing networks

Closed Markovian networks of queues with multiclass customers and having a product form equilibrium state probability distribution are useful in the performance evaluation and design of computer and telecommunication systems. Therefore, the efficient computation of the normalizing function, the key...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on computers 2001-11, Vol.50 (11), p.1279-1288
Main Authors: Cuyt, A., Lenin, R.B.
Format: Article
Language:English
Subjects:
Algorithm design and analysis
Approximation algorithms
Closed-form solution
Computational efficiency
Computer networks
Computer simulation
Convolution
Customers
Distributed computing
Mathematical analysis
Mathematical models
Networks
Normalizing
Performance analysis
Probability distribution
Queueing analysis
Stations
Telecommunication computing
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Closed Markovian networks of queues with multiclass customers and having a product form equilibrium state probability distribution are useful in the performance evaluation and design of computer and telecommunication systems. Therefore, the efficient computation of the normalizing function, the key element of the solution in product form, has attracted considerable effort. We consider a network that consists of one infinite-server (IS) station and one processor-sharing (PS) or FCFS single-server station. We use multivariate Newton-Pade approximants computed from data for small numbers of customers in each class, to estimate the normalizing function for a larger population in the network. The effectiveness and tremendous gain in computing time of this procedure are illustrated through various numerical experiments.
ISSN:0018-9340
1557-9956
DOI:10.1109/12.966500