The influence of service-time variability in a closed network of queues
Performance Evaluation
Mean Value Analysis for Blocking Queueing Networks
IEEE Transactions on Software Engineering
Survey of closed queueing networks with blocking
ACM Computing Surveys (CSUR)
Probability, statistics, and queueing theory with computer science applications
Probability, statistics, and queueing theory with computer science applications
Mean value technique for closed fork-join networks
SIGMETRICS '99 Proceedings of the 1999 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Nonexponential networks of queues: a maximum entropy analysis
SIGMETRICS '85 Proceedings of the 1985 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Mean-Value Analysis of Closed Multichain Queuing Networks
Journal of the ACM (JACM)
The Distribution of Queuing Network States at Input and Output Instants
Journal of the ACM (JACM)
AMVA techniques for high service time variability
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Some Extensions to Multiclass Queueing Network Analysis
Proceedings of the Third International Symposium on Modelling and Performance Evaluation of Computer Systems: Performance of Computer Systems
The Distribution of Queueing Network States at Input and Output Instants
Proceedings of the Third International Symposium on Modelling and Performance Evaluation of Computer Systems: Performance of Computer Systems
Mean Value Analysis fo Queueing Networks - A New Look at an Old Problem
Proceedings of the Third International Symposium on Modelling and Performance Evaluation of Computer Systems: Performance of Computer Systems
Closed queueing networks with finite capacity queues: approximate analysis
Proceedings of the 14th European Simulation Multiconference on Simulation and Modelling: Enablers for a Better Quality of Life
A Diffusion Approximation for the G/GI/n/m Queue
Operations Research
Mean value analysis for polling systems
Queueing Systems: Theory and Applications
An Approximate Analytical Method for General Queueing Networks
IEEE Transactions on Software Engineering
The effect of higher moments of job size distribution on the performance of an M/G/s queueing system
ACM SIGMETRICS Performance Evaluation Review
A conditional probability approach to M/G/1-like queues
Performance Evaluation
Bound analysis of closed queueing networks with workload burstiness
SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
A fixed-point algorithm for closed queueing networks
EPEW'07 Proceedings of the 4th European performance engineering conference on Formal methods and stochastic models for performance evaluation
Queueing model analysis and scheduling strategy for embedded multi-core SoC based on task priority
Computers and Electrical Engineering
Hi-index | 0.00 |
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.