Dynamic control of Brownian networks: State space collapse and equivalent workload formulations

Annals of Applied Probability

Volumn 7, Issue 3, 1997, Pages 747-771

  Harrison, J Michael ^a   Van Mieghem, Jan A ^b  

^a STANFORD UNIVERSITY   (United States)

^b NORTHWESTERN UNIVERSITY   (United States)

Author keywords

Brownian networks; Dynamic scheduling; Queueing networks; State space collapse

Indexed keywords

EID: 0031484861     PISSN: 10505164     EISSN: None     Source Type: Journal    
DOI: 10.1214/aoap/1034801252     Document Type: Article

References (17)

1. 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.
2. 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.
3. 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.) 57-90. Oxford Univ. Press.
4. 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.
5. 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.
6. 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.
7. KEMENY, J. G. and SNELL, J. L. (1976). Finite Markov Chains. Springer, New York.
8. KUSHNER, H. J. and MARTINS, L. F. (1990). Routing and singular control for queueing networks in heavy traffic. SIAM J. Control Optim. 28 1209-1233.
9. LAWS, C. N. (1992). Resource pooling in queueing networks with dynamic routing. Adv. in Appl. Probab. 24 699-726.
10. LAWS, C. N. and LOUTH, G. M. (1990). Dynamic scheduling of a four-station queueing network. Probab. Engrg. Inform Sci. 4 131-156.
11. REIMAN, M. I. (1982). The heavy traffic diffusion approximation for sojourn times in Jackson networks. In Applied Probability-Computer Science: The Interface (R. L. Disney and T. J. Ott, eds.) 2 409-422. Birkhäuser, Boston.
12. REIMAN, M. I. (1983). Some diffusion approximations with state space collapse. Proceedings of International Seminar on Modelling and Performance Evaluation Methodology, Berlin, 1983. Lecture Notes in Control and Inform. Sci. 60 209-240. Springer, Berlin.
13. REIMAN, M. I. (1984). Open queueing networks in heavy traffic. Math. Oper. Res. 9 441-458.
14. VAN MIEGHEM, J. A. (1995). Dynamic scheduling with convex delay costs: the generalized cμ rule. Ann. Appl. Probab. 5 809-833.
15. WEIN, L. M. (1990). Scheduling networks of queues: heavy traffic analysis of a two-station network with controllable inputs. Oper. Res. 38 1065-1078.
16. WEIN, L. M. (1991). Brownian networks with discretionary routing. Oper. Res. 39 322-340.
17. WEIN, L. M. (1992). Scheduling networks of queues: heavy traffic analysis of a multistation network with controllable inputs. Oper. Res. 40 S312-S334.