Brownian models of open processing networks: canonical representation of workload
Open Access
- 1 February 2000
- journal article
- Published by Institute of Mathematical Statistics in The Annals of Applied Probability
- Vol. 10 (1)
- https://doi.org/10.1214/aoap/1019737665
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- Brownian models of open processing networks: canonical representation of workloadThe Annals of Applied Probability, 2000
- Dynamic control of Brownian networks: state space collapse and equivalent workload formulationsThe Annals of Applied Probability, 1997
- Performance evaluation of scheduling control of queueing networks: Fluid model heuristicsQueueing Systems, 1995
- Balanced Fluid Models of Multiclass Queueing Networks: A Heavy Traffic ConjecturePublished by Springer Nature ,1995
- Scheduling Networks of Queues: Heavy Traffic Analysis of a Multistation Closed NetworkOperations Research, 1993
- Dynamic routing in open queueing networks: Brownian models, cut constraints and resource poolingQueueing Systems, 1993
- Resource pooling in queueing networks with dynamic routingAdvances in Applied Probability, 1992
- Dynamic Scheduling of a Four-Station Queueing NetworkProbability in the Engineering and Informational Sciences, 1990
- Scheduling networks of queues: Heavy traffic analysis of a simple open networkQueueing Systems, 1989
- Brownian Models of Queueing Networks with Heterogeneous Customer PopulationsPublished by Springer Nature ,1988