Optimal routing and buffer allocation for a class of finite capacity queueing systems

DOI10.1109/9.159590zbMath0757.60099OpenAlexW2135313978MaRDI QIDQ4021221

Panayotis D. Sparaggis, Don Towsley, Christos G. Cassandras

Publication date: 16 January 1993

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/9.159590

zbMATH Keywords

maximum and minimum queue capacitiesoptimal allocation schemerouting jobsunequal finite buffer capacities

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (13)

Insensitive versus efficient dynamic load balancing in networks without blocking ⋮ Optimal control of multiclass parallel service systems ⋮ Optimal control for a tandem network of queues with blocking ⋮ Sample path methods in the control of queues ⋮ Scalable Load Balancing in Networked Systems: A Survey of Recent Advances ⋮ Optimal \((0, 1)\)-matrix completion with majorization ordered objectives ⋮ Universality of Power-of-d Load Balancing in Many-Server Systems ⋮ Asymptotically optimal component assembly plans in repairable systems and server allocation in parallel multiserver queues ⋮ An Overview for Markov Decision Processes in Queues and Networks ⋮ Asymptotic Optimality of Power-of-d Load Balancing in Large-Scale Systems ⋮ DYNAMIC ROUTING OF CUSTOMERS WITH GENERAL DELAY COSTS IN A MULTISERVER QUEUING SYSTEM ⋮ User-Optimal State-Dependent Routeing in Parallel Tandem Queues with Loss ⋮ Optimizing Bernoulli routing policies for balancing loads on call centers and minimizing transmission costs

This page was built for publication: Optimal routing and buffer allocation for a class of finite capacity queueing systems