Optimizing the throughput, service rate, and buffer allocation in finite queueing networks

DOI10.1016/j.endm.2009.11.028zbMath1268.05195OpenAlexW2070528260MaRDI QIDQ2840535

Frederico R. B. Cruz

Publication date: 19 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2009.11.028

zbMATH Keywords

genetic algorithmsqueueing networksoperations researchbuffer allocationservice allocation

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Throughput maximization of queueing networks with simultaneous minimization of service rates and buffers

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• Approximate analysis of \(M/G/c/c\) state-dependent queueing networks
• Optimal design and performance modelling of \(M/G/1/K\) queueing systems
• Concavity of the throughput of tandem queueing systems with finite buffer storage space

This page was built for publication: Optimizing the throughput, service rate, and buffer allocation in finite queueing networks