A large deviations approach to asymptotically optimal control of crisscross network in heavy traffic



The Annals of Applied Probability

A large deviations approach to asymptotically optimal control of crisscross network in heavy traffic

Amarjit Budhiraja and Arka Prasanna Ghosh

Source: Ann. Appl. Probab. Volume 15, Number 3 (2005), 1887-1935.

Abstract

In this work we study the problem of asymptotically optimal control of a well-known multi-class queuing network, referred to as the “crisscross network,” in heavy traffic. We consider exponential inter-arrival and service times, linear holding cost and an infinite horizon discounted cost criterion. In a suitable parameter regime, this problem has been studied in detail by Martins, Shreve and Soner [ SIAM J. Control Optim. 34 (1996) 2133–2171] using viscosity solution methods. In this work, using the pathwise solution of the Brownian control problem, we present an elementary and transparent treatment of the problem (with the identical parameter regime as in [ SIAM J. Control Optim. 34 (1996) 2133–2171]) using large deviation ideas introduced in [Ann. Appl. Probab. 10 (2000) 75–103, Ann. Appl. Probab. 11 (2001) 608–649]. We obtain an asymptotically optimal scheduling policy which is of threshold type. The proof is of independent interest since it is one of the few results which gives the asymptotic optimality of a control policy for a network with a more than one-dimensional workload process.

Primary Subjects: 60K25, 68M20, 90B22, 90B35
Secondary Subjects: 60J70
Keywords: Control of queuing networks; heavy traffic; Brownian control problem; crisscross network; large deviations; asymptotic optimality

Full-text: Open access

Links and Identifiers

Permanent link to this document: http://projecteuclid.org/euclid.aoap/1121433772
Digital Object Identifier: doi:10.1214/105051605000000250
Mathematical Reviews number (MathSciNet): MR2152248
Zentralblatt MATH identifier: 1080.60084

References

Bell, S. L. and Williams, R. J. (2001). Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: Asymptotic optimality of a threshold policy. Ann. Appl. Probab. 11 608--649.
Mathematical Reviews (MathSciNet): MR1865018
Digital Object Identifier: doi:10.1214/aoap/1015345343
Project Euclid: euclid.aoap/1015345343
Billingsley, P. (1999). Convergence of Probability Measures, 2nd ed. Wiley, New York.
Mathematical Reviews (MathSciNet): MR1700749
Zentralblatt MATH: 0944.60003
Harrison, J. M. (1988). Brownian models of queueing networks with heterogeneous customer population. In Stochastic Differential Systems, Stochastic Control Theory and Applications 147--186. Springer, New York.
Mathematical Reviews (MathSciNet): MR934722
Zentralblatt MATH: 0658.60123
Harrison, J. M. (1998). Heavy traffic analysis of a system with parallel servers: Asymptotic optimality of discrete review policies. Ann. Appl. Probab. 8 822--848.
Mathematical Reviews (MathSciNet): MR1627791
Digital Object Identifier: doi:10.1214/aoap/1028903452
Project Euclid: euclid.aoap/1028903452
Harrison, J. M. (2000). Brownian models of open processing networks: Canonical representation of workload. Ann. Appl. Probab. 10 75--103. [Correction (2003) Ann. Appl. Probab. 13 390--393.]
Mathematical Reviews (MathSciNet): MR1765204
Digital Object Identifier: doi:10.1214/aoap/1019737665
Project Euclid: euclid.aoap/1019737665
Harrison, J. M. and Meigham, J. A. (1997). Dynamic control of Brownian networks: State space collapse and equivalent workload formulation. Ann. Appl. Probab. 7 747--771.
Mathematical Reviews (MathSciNet): MR1459269
Digital Object Identifier: doi:10.1214/aoap/1034801252
Project Euclid: euclid.aoap/1034801252
Harrison, J. M. and Wein, L. (1989). Scheduling network of queues: Heavy traffic analysis of a simple open network. Queuing Syst. Theory Appl. 5 265--280.
Mathematical Reviews (MathSciNet): MR1030470
Digital Object Identifier: doi:10.1007/BF01225319
Kumar, S. (2000). Two-server closed networks in heavy traffic: Diffusion limits and asymptotic optimality. Ann. Appl. Probab. 10 930--961.
Mathematical Reviews (MathSciNet): MR1789984
Digital Object Identifier: doi:10.1214/aoap/1019487514
Project Euclid: euclid.aoap/1019487514
Kurtz, T. G. (1978). Strong approximation theorems for density dependent Markov chains. Stochastic Process. Appl. 6 223--240.
Mathematical Reviews (MathSciNet): MR464414
Digital Object Identifier: doi:10.1016/0304-4149(78)90020-0
Kushner, H. J. and Martins, L. F. (1996). Heavy traffic analysis of a controlled multiclass queuing network via weak convergence methods. SIAM J. Control Optim. 34 1781--1797.
Mathematical Reviews (MathSciNet): MR1404856
Digital Object Identifier: doi:10.1137/S0363012994275592
Martins, L. F., Shreve, S. E. and Soner, H. M. (1996). Heavy traffic convergence of a controlled multiclass queuing system. SIAM J. Control Optim. 34 2133--2171.
Mathematical Reviews (MathSciNet): MR1416504
Digital Object Identifier: doi:10.1137/S0363012994265882
Meyn, S. P. (2003). Sequencing and routing in multiclass queueing networks. Part II: Workload relaxations. SIAM J. Control Optim. 42 178--217.
Mathematical Reviews (MathSciNet): MR1982741
Digital Object Identifier: doi:10.1137/S036301290138376X
Plambeck, E., Kumar, S. and Harrison, J. M. (2001). A multiclass queue in heavy traffic with throughput time constraints: Asymptotically optimal dynamic controls. Queueing Syst. Theory Appl. 39 23--54.
Mathematical Reviews (MathSciNet): MR1865457
Digital Object Identifier: doi:10.1023/A:1017983532376
Puhalskii, A. (1995). Large deviation analysis of the single server queue. Queueing Syst. 21 5--66.
Mathematical Reviews (MathSciNet): MR1372048
Digital Object Identifier: doi:10.1007/BF01158574
Shwartz, A. and Weiss, A. (1995). Large Deviations for Performance Analysis. Chapman and Hall, Boca Raton, FL.
Mathematical Reviews (MathSciNet): MR1335456
Yang, P., Chen, H. and Yao, D. (1994). Control and scheduling in a two-station queueing network. Queueing Syst. Theory Appl. 18 34.

2008 © Institute of Mathematical Statistics