On the optimality and the asymptotic optimality of the smallest weighted available buffer policy

DOI10.1239/AAP/1029955263zbMATH Open0972.60094OpenAlexW1986540621MaRDI QIDQ4954112FDOQ4954112

Authors: D. S. Lee 

Publication date: 13 November 2001

Published in: Advances in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1239/aap/1029955263

Recommendations

• An optimal service policy for buffer systems
• Optimal buffer allocation in finite closed networks with multiple servers
• Optimal buffer size for a stochastic processing network in heavy traffic
• Optimal buffer allocation in tandems of last come first served queues
• Optimal routing and buffer allocation for a class of finite capacity queueing systems
• Optimizing the throughput, service rate, and buffer allocation in finite queueing networks
• Optimal buffer allocation in a two-stage queueing system

zbMATH Keywords

weak convergenceMarkov decision processoptimal controlheavy trafficreflected Brownian motionquality of serviceATM networkssmallest weighted available buffer scheduling discipline

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Markov and semi-Markov decision processes (90C40) Optimal stochastic control (93E20)

Cited In (3)

• The Impact of Cell Dropping Policies in ATM Nodes
• An optimal service policy for buffer systems
• Optimal policies for ATM cell scheduling and rejection

This page was built for publication: On the optimality and the asymptotic optimality of the smallest weighted available buffer policy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4954112)