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

DOI10.1016/J.ENDM.2009.11.028MaRDI QIDQ2840535zbMATH OpenOpenAlexFDO

Authors F. 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

operations researchgenetic algorithmsqueueing networksbuffer allocationservice allocation

Mathematics Subject Classification ID

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

Recommendations

• Throughput maximization of queueing networks with simultaneous minimization of service rates and buffers
• Buffer allocation in general single-server queueing networks
• Optimal server allocation in general, finite, multi-server queueing networks
• Buffer and server allocation in general multi-server queueing networks
• Combining routing and buffer allocation problems in series-parallel queueing networks

Cites work

• scientific article; zbMATH DE number 852844 (Why is no real title available?)
• A note on two problems in connexion with graphs
• Approximate analysis of \(M/G/c/c\) state-dependent queueing networks
• Concavity of the throughput of tandem queueing systems with finite buffer storage space
• Optimal design and performance modelling of M/G/1/K queueing systems

Cited in

(20)

• Utility Optimization in Congested Queueing Networks
• Rate adapters with bursty arrivals and rational rate reduction: queueing analysis
• An exact performance model for the reserve channels CAC strategy at a bufferless network node
• Buffer allocation in general single-server queueing networks
• Characterization and Optimization of Achievable Performance in General Queueing Systems
• scientific article; zbMATH DE number 1863256 (Why is no real title available?)
• Optimal routing and buffer allocation for a class of finite capacity queueing systems
• An optimal service policy for buffer systems
• Study on optimal queue-length-threshold scheduling policy for an ATM multiplexer with finite buffers and batch Poisson arrivals
• Optimal buffer design of an m/g/s queue with finite capacity^∗
• Throughput equivalencies in fork/ join queueing networks with finite buffers and general service times
• RETRIAL NETWORKS WITH FINITE BUFFERS AND THEIR APPLICATION TO INTERNET DATA TRAFFIC
• Performance optimization of open zero-buffer multi-server queueing networks
• Optimal intensity allocation of single-server queueing networks
• Optimal allocation of service rates in Jackson network of queues with total finite accommodating space
• Asymptotically Optimal Routing and Servive Rate Allocation in a Multiserver Queueing System
• Minimizing Congestion in Single-Source, Single-Sink Queueing Networks
• On the optimality and the asymptotic optimality of the smallest weighted available buffer policy
• Throughput maximization of queueing networks with simultaneous minimization of service rates and buffers
• Bounding blocking probabilities and throughput in queueing networks with buffer capacity constraints

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

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