Resource pooling in queueing networks with dynamic routing

DOI10.2307/1427485MaRDI QIDQ4014083zbMATH OpenFDO

Authors C. N. Laws

Publication date 4 October 1992

Published in Advances in Applied Probability (Search for Journal in Brave)

zbMATH Keywords

Brownian motionnetwork flowqueueing networksdynamic routingshortest delay routingdynamic sequencingheavy traffic limiting regime

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20) Stochastic network models in operations research (90B15)

Recommendations

• Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling
• The Effect of Increasing Routing Choice on Resource Pooling
• Dynamic Scheduling of a Four-Station Queueing Network
• Critical thresholds for dynamic routing in queueing networks
• scientific article; zbMATH DE number 786519

Cited in

(24)

• MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic
• Switched networks with maximum weight policies: fluid approximation and multiplicative state space collapse
• Decentralized proportional load balancing
• Brownian models of open processing networks: Canonical representation of workload.
• OPTIMAL ROUTING IN OUTPUT-QUEUED FLEXIBLE SERVER SYSTEMS
• Dynamic control of Brownian networks: State space collapse and equivalent workload formulations
• Pooling in tandem queueing networks with non-collaborative servers
• Heavy traffic analysis of multi-class bipartite queueing systems under FCFS
• Heavy traffic analysis of maximum pressure policies for stochastic processing networks with multiple bottlenecks
• On scheduling a multiclass queue with abandonments under general delay costs
• Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: Asymptotic optimality of a threshold policy
• Asymptotically tight steady-state queue length bounds implied by drift conditions
• On the optimal design of a bipartite matching queueing system
• Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling
• Correction: Brownian models of open processing networks: canonical representation of workload
• State space collapse and diffusion approximation for a network operating under a fair bandwidth sharing policy
• On a bicriterion server allocation problem in a multidimensional Erlang loss system
• Resource sharing networks: overview and an open problem
• Parallel server systems under an extended heavy traffic condition: a lower bound
• Heavy traffic analysis of open processing networks with complete resource pooling: asymptotic optimality of discrete review policies
• DYNAMIC ROUTING OF CUSTOMERS WITH GENERAL DELAY COSTS IN A MULTISERVER QUEUING SYSTEM
• On the power of (even a little) resource pooling
• Resource pooling in the presence of failures: efficiency versus risk
• Achieving High Individual Service Levels Without Safety Stock? Optimal Rationing Policy of Pooled Resources

This page was built for publication: Resource pooling in queueing networks with dynamic routing

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