An optimal service policy for buffer systems

DOI10.1145/210346.210422MaRDI QIDQ4369879zbMATH OpenOpenAlexWikidataFDO

Authors Alexander Birman, H. Richard Gail, S. L. Hantler, Zvi Rosberg, Moshe Sidi

Publication date 28 January 1998

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/210346.210422

zbMATH Keywords

packet-switching networkparallel queues

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• On the optimality and the asymptotic optimality of the smallest weighted available buffer policy
• Optimal buffer allocation in finite closed networks with multiple servers
• Optimal buffer allocation in a two-stage queueing system
• Optimal buffer allocation in tandems of last come first served queues
• Buffer and server allocation in general multi-server queueing networks
• An optimal control policy for a queuing service system
• Optimizing the throughput, service rate, and buffer allocation in finite queueing networks

Cited in

(8)

• On adaptive allocation of the buffer memory of a packet switching node
• Stability of switched server systems with constraints on service-time and capacity of buffers
• Optimality of the fastest available server policy
• Maximizing throughput in multi-queue switches
• Mathematical methods to study the polling systems
• Buffer size requirements under longest queue first
• On the optimality and the asymptotic optimality of the smallest weighted available buffer policy
• Instant Service Policy and Its Application to Deficit Round Robin

This page was built for publication: An optimal service policy for buffer systems

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