Article ID: | iaor1996688 |
Country: | Netherlands |
Volume: | 63 |
Issue: | 3 |
Start Page Number: | 423 |
End Page Number: | 431 |
Publication Date: | Dec 1992 |
Journal: | European Journal of Operational Research |
Authors: | Pourbabai Behnam, Seidmann Abraham |
Keywords: | queues: theory |
A branching system which consists of several parallel nonidentical communication devices with finite input buffers is considered in this paper. The system is designed and oeprated under a stochastic congestion control policy. Several job routing and buffer allocation decision models are analyzed in order to maximize the aggregate system throughput, or to minimize the storage space costs. The polynomial and pseudo-polynomial optimization algorithms which are presented here take advantage of the structural properties of this system. The results obtained are also of particular relevance in the design of load balancing policies for distributed computer systems.