On the Design of Optimal Policy for Sharing Finite Buffers
- 1 June 1984
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 32 (6) , 737-740
- https://doi.org/10.1109/tcom.1984.1096120
Abstract
An important analytic model of finite buffer systems is a multiclass single queue with typed servers. In the context of such a model, we address the problem of selecting an optimal buffer sharing policy. We show that with respect to weighted throughput, an optimal policy must be a stationary delayed resolution policy. An iterative procedure based upon the policy iteration method for Markov processes with rewards is used to efficiently search for the optimal delayed resolution policy for a given set of system parameters. A performance comparison of the optimal delayed resolution policy with other well-known buffer sharing policies is also provided.Keywords
This publication has 3 references indexed in Scilit:
- Analysis of Shared Finite Storage in a Computer Network Node Environment Under General Traffic ConditionsIEEE Transactions on Communications, 1980
- Exponential Servers Sharing a Finite Storage: Comparison of Space Allocation PoliciesIEEE Transactions on Communications, 1980
- Buffer Management in a Packet SwitchIEEE Transactions on Communications, 1978