Brownian models of open processing networks: Canonical representation of workload

Annals of Applied Probability

Volumn 10, Issue 1, 2000, Pages 75-103

  Harrison, J Michael ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

Brownian approximation; Dynamic control; Equivalent workload formulation; Heavy traffic; Queueing theory

Indexed keywords

EID: 0034344279     PISSN: 10505164     EISSN: None     Source Type: Journal    
DOI: 10.1214/aoap/1019737665     Document Type: Article

References (20)

1. ATKINS, D. and CHEN, H. (1995). Performance evalution of scheduling control of queueing networks: fluid model heuristics. Queueing Systems 21 391-413.
2. AVRAM, F., BERTSIMAS, D. and RICARD, M. (1995). Fluid models of sequencing problems in open queueing networks: an optimal control approach. In Stochastic Networks (F. P. Kelly and R. J. Williams, eds.) 199-234. Springer, New York.
3. CHEN, H. and YAO, D. D. (1993). Dynamic scheduling of a multiclass fluid network. Oper. Res. 41 1104-1115.
4. CHEVALIER, P. B. and WEIN, L. M. (1993). Scheduling networks of queues: heavy traffic analysis of a multistation closed network. Oper. Res. 41 743-758.
5. ENG, D., HUMPHREY, J. and MEYN, S. P. (1996). Fluid network models: linear programs for control and performance bounds. In Thirteenth World Congress of International Federation of Automatic Control, San Francisco, 1996.
6. HARRISON, J. M. (1988). Brownian models of queueing networks with heterogeneous customer populations. In Stochastic Differential Systems, Stochastic Control Theory and Applications (W. Fleming and P. L. Lions, eds.) 147-186. Springer, New York.
7. HARRISON, J. M. (1995). Balanced fluid models of multiclass queueing networks: a heavy traffic conjecture. In Stochastic Networks (F. P. Kelly and R. J. Williams, eds.) 1-20. Springer, New York.
8. HARRISON, J. M. (1996). The BIGSTEP approach to flow management in stochastic processing networks. In Stochastic Networks: Theory and Applications (F. Kelly, S. Zachary and I. Ziendins, eds.) Oxford Univ. Press.
9. HARRISON, J. M. (2000). BIGSTEP control of a processing network with two servers working in parallel. Ann. Appl. Probab. To appear.
10. HARRISON, J. M. and VAN MIEGHEM, J. A. (1997). Dynamic control of Brownian networks: State space collapse and equivalent workload formulations. Ann. Appl. Probab. 7 747-771.
11. HARRISON, J. M. and WEIN, L. M. (1989). Scheduling networks of queues: heavy traffic analysis of a simple open network. Queueing Systems 5 265-280.
12. HARRISON, J. M. and WEIN, L. M. (1990). Scheduling networks of queues: heavy traffic analysis of a two-station closed network. Oper. Res. 38 1052-1064.
13. KELLY, F. P. and LAWS, C. N. (1993). Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling. Queueing Systems 13 47-86.
14. LAWS, C. N. (1990). Dynamic routing in queueing networks. Ph.D. dissertation, Cambridge Univ.
15. LAWS, C. N. (1992). Resource pooling in queueing networks with dynamic routing. Adv. in Appl. Probab. 24 699-726.
16. LAWS, C. N. and LOUTH, G. M. (1990). Dynamic scheduling of a four-station queueing network. Probab. Engng. Inform. Sci. 4 131-156.
17. WEIN, L. M. (1990). Scheduling networks of queues: heavy traffic analysis of a two-station network with controllable inputs. Oper. Res. 38 1065-1078.
18. WEIN, L. M. (1991). Brownian networks with discretionary routing. Oper. Res. 39 322-340.
19. WEIN, L. M. (1992). Scheduling networks of queues: heavy traffic analysis of a multistation network with controllable inputs. Oper. Res. 40 S312-S334.
20. WEISS, G. (1995). On optimal draining of re-entrant fluid lines. In Stochastic Networks (F. P. Kelly and R. J. Williams, eds.) 91-103. Springer, New York.