A UNIFIED VIEW OF PRODUCT-FORM APPROXIMATION TECHNIQUES FOR GENERAL CLOSED QUEUING-NETWORKS

被引:27
|
作者
BAYNAT, B [1 ]
DALLERY, Y [1 ]
机构
[1] UNIV PARIS 06,MASI LAB,CNRS,UA 818,F-75252 PARIS 05,FRANCE
关键词
CLOSED QUEUING NETWORKS; PERFORMANCE ANALYSIS; DECOMPOSITION; PRODUCT-FORM APPROXIMATION; AGGREGATION; MARIE METHOD;
D O I
10.1016/0166-5316(93)90017-O
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Two major approximate techniques have been proposed for the analysis of general closed queueing networks, namely the aggregation method and Marie's method. The idea of the aggregation technique is to replace a subsystem (a subnetwork) by a flow equivalent single-server with load-dependent service rates. The parameters of the equivalent server are obtained by analyzing the subsystem in isolation as a closed system with different populations. The idea of Marie's method is also to replace a subsystem by an equivalent exponential service station with load-dependent service rates. However, in this case, the parameters of the equivalent server are obtained by analyzing the subsystem in isolation under a load-dependent Poisson arrival process. Moreover, in Marie's case, the procedure is iterative. In this paper we provide a general and unified view of these two methods. The contributions of this paper are the following. We first show that their common principle is to partition the network into a set of subsystems and then to define an equivalent product-form network. To each subsystem is associated a load-dependent exponential station in the equivalent network. We define a set of rules in order to partition any general closed network with various features such as general service time distributions, population constraints, finite buffers, state-dependent routing. We then show that the aggregation method and Marie's method are two ways of obtaining the parameters of the equivalent network associated with a given partition. Finally, we provide a discussion pertaining to the comparison of the two methods with respect to their accuracy and computational complexity.
引用
收藏
页码:205 / 224
页数:20
相关论文
共 50 条