Resource pooling in queueing networks with dynamic routing
From MaRDI portal
Publication:4014083
DOI10.2307/1427485zbMath0768.90029MaRDI QIDQ4014083
Publication date: 4 October 1992
Published in: Advances in Applied Probability (Search for Journal in Brave)
Brownian motionqueueing networksnetwork flowdynamic routingshortest delay routingdynamic sequencingheavy traffic limiting regime
Stochastic network models in operations research (90B15) Queueing theory (aspects of probability theory) (60K25) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)
Related Items (18)
Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: Asymptotic optimality of a threshold policy ⋮ Correction: Brownian models of open processing networks: canonical representation of workload ⋮ On scheduling a multiclass queue with abandonments under general delay costs ⋮ Dynamic control of Brownian networks: State space collapse and equivalent workload formulations ⋮ Asymptotically tight steady-state queue length bounds implied by drift conditions ⋮ Parallel server systems under an extended heavy traffic condition: a lower bound ⋮ Switched networks with maximum weight policies: fluid approximation and multiplicative state space collapse ⋮ MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic ⋮ On a bicriterion server allocation problem in a multidimensional Erlang loss system ⋮ Heavy traffic analysis of open processing networks with complete resource pooling: asymptotic optimality of discrete review policies ⋮ State space collapse and diffusion approximation for a network operating under a fair bandwidth sharing policy ⋮ OPTIMAL ROUTING IN OUTPUT-QUEUED FLEXIBLE SERVER SYSTEMS ⋮ Decentralized Proportional Load Balancing ⋮ Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling ⋮ Heavy traffic analysis of maximum pressure policies for stochastic processing networks with multiple bottlenecks ⋮ DYNAMIC ROUTING OF CUSTOMERS WITH GENERAL DELAY COSTS IN A MULTISERVER QUEUING SYSTEM ⋮ Brownian models of open processing networks: Canonical representation of workload. ⋮ On the Optimal Design of a Bipartite Matching Queueing System
This page was built for publication: Resource pooling in queueing networks with dynamic routing
