Buffer allocation in general single-server queueing networks

DOI10.1016/J.COR.2007.03.004zbMATH Open1170.90361OpenAlexW2121899518MaRDI QIDQ2483503FDOQ2483503

Authors: Yanyan Li 

Publication date: 28 April 2008

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2007.03.004

Recommendations

• Buffer and server allocation in general multi-server queueing networks
• Allocation of buffer capacities in queueing networks with arbitrary topologies
• Optimizing the throughput, service rate, and buffer allocation in finite queueing networks
• 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
• Server allocation for zero buffer tandem queues
• Modeling and optimization of buffers and servers in finite queueing networks

zbMATH Keywords

networksqueuesbuffer allocation

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Stochastic network models in operations research (90B15)

Cites Work

• Title not available (Why is that?)
• The omnipresence of Lagrange
• Approximate analysis of \(M/G/c/c\) state-dependent queueing networks
• A simple technique in Markovian control with applications to resource allocation to resource allocation in communication networks
• Allocation of buffer capacities in queueing networks with arbitrary topologies
• Large production line optimization using simulated annealing
• A Transform-Free Approximation for the Finite Capacity M/G/s Queue
• On the optimal design of tandem queueing systems with finite buffers
• On Approximate Computer System Models
• Optimal buffer design of an m/g/s queue with finite capacity^∗
• Multi-objective routing within large scale facilities using open finite queueing networks
• Buffer allocation for a class of nonlinear stochastic knapsack problems
• Computationally efficient approximations for balanced flowlines with finite intermediate buffers
• Qeueing models for performance analysis: Selection of single station models

Cited In (24)

• Optimal server allocation in general, finite, multi-server queueing networks
• Optimal buffer allocation in finite closed networks with multiple servers
• Buffer Behavior with Poisson Arrivals and Bulk Geometric Service
• The optimal buffer allocation problem
• Deadlock free buffer allocation in closed queueing networks
• Optimization of buffer allocation in unreliable production lines based on availability evaluation
• A Fokker-Planck equation method predicting buffer occupancy in a single queue
• Performance analysis of wireless sensor networks using queuing networks
• Modeling and optimization of buffers and servers in finite queueing networks
• Combining routing and buffer allocation problems in series-parallel queueing networks
• Two approaches for solving the buffer allocation problem in unreliable production lines
• Buffer allocation for a class of nonlinear stochastic knapsack problems
• Topological network design of general, finite, multi-server queueing networks
• A parallel tabu search for solving the primal buffer allocation problem in serial production systems
• Optimizing the throughput, service rate, and buffer allocation in finite queueing networks
• Buffer allocation in flow-shop-type production systems with general arrival and service patterns
• Machine allocation problems in manufacturing networks
• Efficient combined immune-decomposition algorithm for optimal buffer allocation in production lines for throughput and profit maximization
• Buffer and server allocation in general multi-server queueing networks
• Performance optimization of open zero-buffer multi-server queueing networks
• An adaptive tabu search approach for buffer allocation problem in unreliable non-homogenous production lines
• Throughput maximization of queueing networks with simultaneous minimization of service rates and buffers
• A continuous buffer allocation model using stochastic processes
• Server allocation for zero buffer tandem queues

This page was built for publication: Buffer allocation in general single-server queueing networks

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