ANALYTICAL APPROACH TO DISCRETE OPTIMIZATION OF QUEUING-NETWORKS

被引：12

作者：

BAUER, G

BOLCH, G

机构：

[1] Universität Erlangen-Nümberg, Institut für Matematische Maschinen und Datenverabeitung (IV), D-8520 Erlangen

来源：

COMPUTER COMMUNICATIONS | 1990年 / 13卷 / 08期

关键词：

Lagrange multipliers; optimization; performance; queueing models;

D O I：

10.1016/0140-3664(90)90133-2

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

The use of analytic queueing models in the investigation of complex computer systems has the advantage in that they can provide values of performance measures, and can also solve problems in the area of optimization quickly and simply. However, in optimization the problem often occurs that particular quantities cannot be altered or can only take discrete values. In this paper, a method for the optimization of queueing models using Lagrange multipliers (BFS method) is extended so that it can be used when the service rates are restricted to a set of discrete values or cannot be altered. The practical use of the BFS method is significantly increased by these two extensions. The quality of the results is shown by some examples of both cases. © 1990.

引用

页码：494 / 502

页数：9

共 17 条

[1]

AKYILDIZ IF, 1988, DEC P INT SEM PERF D

[2]

BARD Y, 1979, 4TH INT S MOD PERF E, V1

[3] OPEN, CLOSED, AND MIXED NETWORKS OF QUEUES WITH DIFFERENT CLASSES OF CUSTOMERS [J].