Optimal allocation of buffers and customers in a two-node cyclic network with multiple servers

Authors:
Robert D. Foley;Byung Chun Park
Affiliations:
School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA 30332, USA;Department of Industrial Engineering, Keimyung University, Taegu, South Korea
Venue:
Operations Research Letters
Year:
2002

Citing 6
Cited 0

Optimal server allocation in a system of multi-server stations

Management Science
Monotonicity in generalized semi-Markov processes

Mathematics of Operations Research
On Approximate Computer System Models

Journal of the ACM (JACM)
General Closed Queueing Networks with Blocking

Performance '87 Proceedings of the 12th IFIP WG 7.3 International Symposium on Computer Performance Modelling, Measurement and Evaluation
Approximate analysis of central server models

IBM Journal of Research and Development
On equivalencies of blocking mechanisms in queueing networks with blocking

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Suppose there are a fixed number of waiting positions which need to be allocated between two nodes in a closed, two-node, cyclic, queueing network with multiple servers in order to maximize throughput. We determine the optimal allocation under quite general assumptions about the service times. For example, under production blocking, the optimal allocation is to split the waiting positions as equally as possible between the two nodes without regard to the number of servers at each node. We also determine the optimal number of customers circulating in the network, which depends on both the total number of servers in the system and how the waiting spaces are allocated between the two servers.