Optimal allocation of buffers and customers in a two-node cyclic network with multiple servers

DOI10.1016/S0167-6377(01)00107-9zbMath1030.90031OpenAlexW1998239299MaRDI QIDQ1611997

Byung Chun Park, Robert D. Foley

Publication date: 28 August 2002

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6377(01)00107-9

zbMATH Keywords

stochastic orderingclosed queueing networkbuffer allocationgeneralized semi-Markov process

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (2)

Optimal buffer allocation in finite closed networks with multiple servers ⋮ Performance of carousel systems with ‘organ-pipe’ storage

Cites Work

• Unnamed Item
• Cyclic networks with general blocking and starvation
• On equivalencies of blocking mechanisms in queueing networks with blocking
• Structured buffer-allocation problems
• The cyclic queue with one general and one exponential server
• Optimal Server Allocation in a System of Multi-Server Stations
• Monotonicity in Generalized Semi-Markov Processes
• The Steady-State Queueing Time Distribution for the M/G/1 Finite Capacity Queue
• Approximate Analysis of Central Server Models
• On Approximate Computer System Models
• Comparing multi-server queues with finite waiting rooms, I: Same number of servers
• Optimal buffer allocation in a two-stage queueing system
• Cyclic Queuing Systems with Restricted Length Queues

This page was built for publication: Optimal allocation of buffers and customers in a two-node cyclic network with multiple servers