.png){kind=icon}
.png){kind=icon}
Return
Buffer and server allocation in general multi-server queueing networks
.png){kind=icon}
PRE
AI
DOI：10.1111/j.1475-3995.2009.00746.x.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper deals with the joint optimization of the number of buffers and servers, an important issue since buffers and servers represent a significant amount of investment for many companies. The joint buffer and server optimization problem (BCAP) is a non-linear optimization problem with integer decision variables. The performance of the BCAP is evaluated by a combination of a two-moment approximation (developed for the performance analysis of finite general-service queues) and the generalized expansion method (a well-known method for performance analysis of acyclic networks of finite queues). A standard non-linear optimization package is used to optimize the BCAP for a large number of experiments. A comprehensive set of numerical results is presented. The results show that the methodology is capable of handling the trade-off between the number of servers and buffers, yielding better throughputs than previously published studies. Also, the importance of the squared coefficient of variation of the service time is stressed, since it strongly influences the approximate optimal allocation.
Keywords:
joint buffer and server allocation
general service
queues
networks
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.9
Papers:
1.8K
Citations:
3.7K
View more organizations