Optimizing the throughput, service rate, and buffer allocation in finite queueing networks
From MaRDI portal
Publication:2840535
DOI10.1016/J.ENDM.2009.11.028zbMATH Open1268.05195OpenAlexW2070528260MaRDI QIDQ2840535FDOQ2840535
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
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
- A note on two problems in connexion with graphs
- Title not available (Why is that?)
- 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
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
- Characterization and Optimization of Achievable Performance in General Queueing Systems
- Buffer allocation in general single-server queueing networks
- Title not available (Why is that?)
- Optimal routing and buffer allocation for a class of finite capacity queueing systems
- An optimal service policy for buffer systems
- Optimal buffer design of an m/g/s queue with finite capacity∗
- Study on optimal queue-length-threshold scheduling policy for an ATM multiplexer with finite buffers and batch Poisson arrivals
- 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
- Minimizing Congestion in Single-Source, Single-Sink Queueing Networks
- Asymptotically Optimal Routing and Servive Rate Allocation in a Multiserver Queueing System
- 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)
