Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling
From MaRDI portal
Publication:1801806
DOI10.1007/BF01158929zbMath0772.60068OpenAlexW2111704404WikidataQ115149445 ScholiaQ115149445MaRDI QIDQ1801806
Publication date: 17 August 1993
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01158929
resource poolingBrownian network modelsheavy traffic analysiscontrol of open queueing networksshortest delay routing
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)
Related Items
Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: Asymptotic optimality of a threshold policy ⋮ Discrete-review policies for scheduling stochastic networks: trajectory tracking and fluid-scale asymptotic optimality. ⋮ Near optimal control of queueing networks over a finite time horizon ⋮ Allocation of flows in closed bipartite queueing networks ⋮ On the asymptotic optimality of the \(c\mu\)-rule in queueing networks ⋮ Correction: Brownian models of open processing networks: canonical representation of workload ⋮ Dynamic control of Brownian networks: State space collapse and equivalent workload formulations ⋮ Rate of Convergence to Stationary Distribution for Unreliable Jackson-Type Queueing Network with Dynamic Routing ⋮ Asymptotic behavior of a critical fluid model for bandwidth sharing with general file size distributions ⋮ Asymptotically tight steady-state queue length bounds implied by drift conditions ⋮ Switched networks with maximum weight policies: fluid approximation and multiplicative state space collapse ⋮ Dynamic server allocation for unstable queueing networks with flexible servers ⋮ Large-deviations analysis of the fluid approximation for a controllable tandem queue ⋮ MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic ⋮ Analysis of Unreliable Open Queueing Network with Dynamic Routing ⋮ Resource pooling in congested networks: Proportional fairness and product form ⋮ Coding and control for communication networks ⋮ Heavy traffic analysis of open processing networks with complete resource pooling: asymptotic optimality of discrete review policies ⋮ OPTIMAL ROUTING IN OUTPUT-QUEUED FLEXIBLE SERVER SYSTEMS ⋮ Reliability by design in distributed power transmission networks ⋮ The Effect of Increasing Routing Choice on Resource Pooling ⋮ Optimal control of assignment of jobs to processors under heavy traffic ⋮ An Equilibrium Analysis of a Multiclass Queue with Endogenous Abandonments in Heavy Traffic ⋮ DYNAMIC ROUTING OF CUSTOMERS WITH GENERAL DELAY COSTS IN A MULTISERVER QUEUING SYSTEM ⋮ Diffusion approximation for a heavily loaded multi-user wireless communication system with cooperation ⋮ Brownian models of open processing networks: Canonical representation of workload. ⋮ Heavy traffic analysis of a system with parallel servers: Asymptotic optimality of discrete-review policies ⋮ Dynamic safety-stocks for asymptotic optimality in stochastic networks ⋮ Dynamic routing in large-scale service systems with heterogeneous servers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Probability methods for approximations in stochastic control and for elliptic equations
- The QNET method for two-moment analysis of open queueing networks
- Recurrence classification and invariant measure for reflected Brownian motion in a wedge
- On a class of approximations for closed queueing networks
- Reflected Brownian motion on an orthant
- Reflected Brownian motion in an orthant: Numerical methods for steady- state analysis
- Brownian models of multiclass queueing networks: Current status and open problems
- Nonexistence of Brownian models for certain multiclass queueing networks
- Scheduling networks of queues: Heavy traffic analysis of a simple open network
- Optimal and Approximately Optimal Control Policies for Queues in Heavy Traffic
- Optimal Control of a Two-Station Brownian Network
- TWO QUEUES IN PARALLEL
- Two Similar Queues in Parallel
- Reflected brownian motion in a wedge: Semimartingale property
- Open Queueing Networks in Heavy Traffic
- A Heavy Traffic Limit Theorem for Networks of Queues with Multiple Customer Types
- Brownian Networks with Discretionary Routing
- Dynamic Scheduling of a Four-Station Queueing Network
- J.comput. appl. math
- Brownian motion in a wedge with oblique reflection
- Open and Closed Models for Networks of Queues
- The shortest queue problem
- Deciding Which Queue to Join: Some Counterexamples
- Comparison of Policies for Routing Customers to Parallel Queueing Systems
- Brownian models of open queueing networks with homogeneous customer populations∗
- A multiclass feedback queue in heavy traffic
- A simple dynamic routing problem
- On the Distribution of Multidimensional Reflected Brownian Motion
- Equilibria for diffusion models of pairs of communicating computers--Symmetric case
- Numerical Methods for Stochastic Singular Control Problems
- Resource pooling in queueing networks with dynamic routing
- Random Yield, Rework and Scrap in a Multistage Batch Manufacturing Environment
- Optimality of the shortest line discipline
- A Minimum Delay Routing Algorithm Using Distributed Computation
- On the optimal assignment of customers to parallel servers
- A Basic Dynamic Routing Problem and Diffusion
- Scheduling Networks of Queues: Heavy Traffic Analysis of a Two-Station Closed Network
- Scheduling Networks of Queues: Heavy Traffic Analysis of a Two-Station Network with Controllable Inputs
- Routing and Singular Control for Queueing Networks in Heavy Traffic
