Buffer Allocation in Queueing Networks with Finite Capacities
In this chapter we study the buffer allocation problem in queueing networks with finite capacities. We present some solution techniques proposed in the literature for queueing networks with arbitrary topology.
KeywordsBuffer Capacity Network Throughput Forward Problem Dynamic Programming Approach Relative Error Percentage
Unable to display preview. Download preview PDF.
- Buzacott, J., and J.G. Shanthikumar “Design of Manufacturing Systems using Queueing Models” Queueing Systems: Theory and Applications, (1992).Google Scholar
- Gavish, B. “A General Model for Topological Design of Computer Networks” in Proc. Globecom’86, 1986.Google Scholar
- Gavish, B., and I. Neuman “Capacity and Flow Assignments in Large Computer Networks” in Proc. IEEE-Infocom’86, 1986, 275–284.Google Scholar
- Gershwin, S. B. “An Efficient Decomposition Method for the Approximate Evaluation of Production Lines with Finite Storage Space” in , Nice, France, 1984.Google Scholar
- Gershwin, S. B. “An Efficient Decomposition Method for the Approximate Evaluation of Tandem Queues with Finite Storage Space and Blocking” Oper. Res., Vol. 35 (1987) 291–305.Google Scholar
- Hillier, F.S., and W. Boling “The Effect of Some Design Factors on the Efficiency of Production Lines with Variable Operation Times” J. Ind. Eng., Vol. 7 (1966) 651–658.Google Scholar
- Jafari, M. A., and J.G. Shanthikumar “Determination of Optimal Buffer Storage Capacities and Optimal Allocation in Multistage Automatic Transfer Lines” AIIE Trans., Vol. 21 (1989) 130–135.Google Scholar
- Sheskin, T. J. “Allocation of Interstage Storage Along an Automated Production Line” AIIE Trans., Vol. 8 (1976) 146–152.Google Scholar