Brownian models of open processing networks: Canonical representation of workload.

DOI10.1214/aoap/1019737665zbMath1131.60306OpenAlexW2104307727MaRDI QIDQ1578618

Publication date: 4 September 2000

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1214/aoap/1019737665

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Deterministic network models in operations research (90B10) Applications of Brownian motions and diffusion theory (population genetics, absorption problems, etc.) (60J70)

Related Items

Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: Asymptotic optimality of a threshold policy, Queueing Dynamics and State Space Collapse in Fragmented Limit Order Book Markets, Fluid model for a network operating under a fair bandwidth-sharing policy., A push-pull network with infinite supply of work, Brownian control problems for a multiclass M/M/1 queueing problem with model uncertainty, Near optimal control of queueing networks over a finite time horizon, One-dimensional Brownian particle systems with rank-dependent drifts, Asymptotic optimality of maximum pressure policies in stochastic processing networks, Diffusion approximation for an input-queued switch operating under a maximum weight matching policy, A phase transition behavior for Brownian motions interacting through their ranks, Singular control with state constraints on unbounded domain, An asymptotic optimality result for the multiclass queue with finite buffers in heavy traffic, Routing and Staffing in Customer Service Chat Systems with Impatient Customers, Optimal Control of a Time-Varying Double-Ended Production Queueing Model, On the Optimal Control of Parallel Processing Networks with Resource Collaboration and Multitasking, Queueing Network Controls via Deep Reinforcement Learning, Control of Fork-Join Processing Networks with Multiple Job Types and Parallel Shared Resources, Optimal scaling of average queue sizes in an input-queued switch: an open problem, Log-weight scheduling in switched networks, Dynamic scheduling of a \(GI/GI/1+GI\) queue with multiple customer classes, Simple form control policies for resource sharing networks with HGI performance, Parallel server systems under an extended heavy traffic condition: a lower bound, Controlled stochastic networks in heavy traffic: convergence of value functions, The ODE method for stability of skip-free Markov chains with applications to MCMC, Switched networks with maximum weight policies: fluid approximation and multiplicative state space collapse, Joint routing and scheduling control in a two-class network with a flexible server, Dynamic server allocation for unstable queueing networks with flexible servers, Dynamic Matching for Real-Time Ride Sharing, A broader view of Brownian networks, Control: a perspective, Resource sharing networks: Overview and an open problem, Stability of multi-class queueing networks with infinite virtual queues, MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic, Optimal queue-size scaling in switched networks, Information and Memory in Dynamic Resource Allocation, Optimal control of parallel server systems with many servers in heavy traffic, Pathwise optimality of the exponential scheduling rule for wireless channels, Heavy traffic analysis of open processing networks with complete resource pooling: asymptotic optimality of discrete review policies, Workload reduction of a generalized Brownian network, Scheduling control for queueing systems with many servers: asymptotic optimality in heavy traffic, State space collapse and diffusion approximation for a network operating under a fair bandwidth sharing policy, Diffusion approximations for controlled stochastic networks: an asymptotic bound for the value function, Heavy Traffic Analysis of a Simple Closed-Loop Supply Chain, Fluid limits for networks with bandwidth sharing and general document size distributions, Delay Analysis of the Max-Weight Policy Under Heavy-Tailed Traffic via Fluid Approximations, Infinite-Horizon Average Optimality of the N-Network in the Halfin–Whitt Regime, Control Policies Approaching Hierarchical Greedy Ideal Performance in Heavy Traffic for Resource Sharing Networks, Heavy traffic analysis of maximum pressure policies for stochastic processing networks with multiple bottlenecks, Robust scheduling for flexible processing networks, Brownian models of open processing networks: Canonical representation of workload., Ranking flexibility structures in queueing systems, Improved queue-size scaling for input-queued switches via graph factorization, A large deviations approach to asymptotically optimal control of crisscross network in heavy traffic, Minimal and Locally Edge Minimal Fluid Models for Resource-Sharing Networks

Cites Work