Higher-order distributional properties in closed queueing networks

Abstract : In many real-life computer and networking applications, the distributions of service times, or times between arrivals of requests, or both, can deviate significantly from the memoryless negative exponential distribution that underpins the product-form solution for queueing networks. Frequently, the coefficient of variation of the distributions encountered is well in excess of one, which would be its value for the exponential. For closed queueing networks with non-exponential servers there is no known general exact solution, and most, if not all, approximation methods attempt to account for the general service time distributions through their first two moments. We consider two simple closed queueing networks which we solve exactly using semi- numerical methods. These networks depart from the structure leading to a product-form solution only to the extent that the service time at a single node is non-exponential. We show that not only the coefficients of variation but also higher-order distributional properties can have an important effect on such customary steady-state performance measures as the mean number of customers at a resource or the resource utilization level in a closed network. Additionally, we examine the state that a request finds upon its arrival at a server, which is directly tied to the resulting quality of service. Although the well-known Arrival Theorem holds exactly only for product-form networks of queues, some approximation methods assume that it can be applied to a reasonable degree also in other closed queueing networks. We investigate the validity of this assumption in the two closed queueing models considered. Our results show that, even in the case when there is a single non-exponential server in the network, the state found upon arrival may be highly sensitive to higher-order properties of the service time distribution, beyond its mean and coefficient of variation. This dependence of mean numbers of customers at a server on higher-order distributional properties is in stark contrast with the situation in the familiar open M/G/1 queue. Thus, our results put into question virtually all traditional approximate solutions, which concentrate on the first two moments of service time distributions.
Type de document :
Article dans une revue
Performance Evaluation, Elsevier, 2009, 66 (11), pp.607 - 620. 〈10.1016/j.peva.2009.05.002〉
Liste complète des métadonnées

Contributeur : Thomas Begin <>
Soumis le : jeudi 25 novembre 2010 - 11:36:59
Dernière modification le : mardi 16 janvier 2018 - 15:58:58




Alexandre Brandwajn, Thomas Begin. Higher-order distributional properties in closed queueing networks. Performance Evaluation, Elsevier, 2009, 66 (11), pp.607 - 620. 〈10.1016/j.peva.2009.05.002〉. 〈inria-00539823〉



Consultations de la notice