Near‐optimal analysis of homogeneous central‐server queueing networks

G. C. Pentzaropoulos and D. I. Giokas

Applied Stochastic Models and Data Analysis, 1997, vol. 13, issue 1, 15-27

Abstract: The problem of achieving near‐optimality in homogeneous central‐server queueing networks is investigated by means of a composite approach based on approximate operational analysis and goal programming procedures. A near‐optimal solution is shown to exist: this includes the expected overall waiting time, the overall throughput rate, as well as the distribution of queue length values. The need to maintain a balanced network flow and the desire to minimize the overall waiting time are expressed as complimentary objectives. Numerical results, based on past measurements from a multi‐server computing facility, indicate that the performance gains obtained by the application of the present methodology are quite significant throughout the network's feasible population scale. © 1997 by John Wiley & Sons, Ltd.

Date: 1997
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/(SICI)1099-0747(199703)13:13.0.CO;2-2

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:apsmda:v:13:y:1997:i:1:p:15-27

Access Statistics for this article

More articles in Applied Stochastic Models and Data Analysis from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().