Two workload properties for Brownian networks

DOI10.1023/A:1027372517452zbMath1131.60305OpenAlexW2115660254MaRDI QIDQ1417722

Ruth J. Williams, Maury Bramson

Publication date: 5 January 2004

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1027372517452

zbMATH Keywords

dynamic schedulingBrownian control problemunitary networkLeontief matrixequivalent workload formulationBrownian networkopen multiclass queueing networkopen stochastic processing network

Mathematics Subject Classification ID

Linear programming (90C05) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Stochastic scheduling theory in operations research (90B36) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (11)

Asymptotic optimality of maximum pressure policies in stochastic processing networks ⋮ Singular control with state constraints on unbounded domain ⋮ Controlled stochastic networks in heavy traffic: convergence of value functions ⋮ A broader view of Brownian networks ⋮ Coding and control for communication networks ⋮ Heavy traffic analysis of open processing networks with complete resource pooling: asymptotic optimality of discrete review policies ⋮ Workload reduction of a generalized Brownian network ⋮ Queueing systems with many servers: null controllability in heavy traffic ⋮ Diffusion approximations for controlled stochastic networks: an asymptotic bound for the value function ⋮ Heavy Traffic Analysis of a Simple Closed-Loop Supply Chain ⋮ Heavy traffic analysis of maximum pressure policies for stochastic processing networks with multiple bottlenecks

This page was built for publication: Two workload properties for Brownian networks