Directional Derivatives of Oblique Reflection Maps

References

• Chen H., Mandelbaum A. Discrete flow networks: Diffusion approximations and bottlenecks. Ann. Probab. (1991) 19:1463–1519Crossref, Google Scholar
• Cudina M., Ramanan K. Asymptotically optimal controls for single-class time-inhomogeneous networks. (2009) . PreprintGoogle Scholar
• Deuschel Z., Zambotti L. Bismut-Elworthy formula and random walk representation for SDEs with reflection. Stochastic Proc. Their Appl. (2005) 115:907–925Crossref, Google Scholar
• Dupuis P., Ishii H. On Lipschitz continuity of the solution mapping to the Skorokhod problem, with applications. Stochastics (1991) 35:31–62Google Scholar
• Dupuis P., Ramanan K. A Skorokhod formulation and large deviation analysis of the generalized processor sharing model. Queueing Systems (1998) 28:109–124Crossref, Google Scholar
• Dupuis P., Ramanan K. Convex duality and the Skorokhod Problem, II. Probab. Theory Related Fields (1999) 115(2):197–236Crossref, Google Scholar
• Dupuis P., Ramanan K. A multiclass feedback queueing network with a regular Skorokhod problem. Queueing Systems (2000) 36:327–349Crossref, Google Scholar
• Gerla M., Kleinrock L. Flow control: A comparative survey. IEEE Trans. Comm. (1980) COM-29(4):553–574Crossref, Google Scholar
• Harrison J. M., Reiman M. I. Reflected Brownian motion on an orthant. Ann. Probab. (1981) 9:302–308Crossref, Google Scholar
• Heyman D. P., Whitt W. The asymptotic behaviour of queues with time-varying arrival rates. J. Appl. Probab. (1984) 21:143–156Crossref, Google Scholar
• Kang W., Ramanan K. A Dirichlet process characterization of a class of multi-dimensional reflected diffusions. Ann. Probab. (2010) 38:1062–1105Crossref, Google Scholar
• Keller J. B. Time-dependent queues. SIAM Rev. (1982) 24:401–412Crossref, Google Scholar
• Kruk L., Lehoczky J., Ramanan K., Shreve S. An explicit formula for the Skorokhod map on [0, a]. Ann. Probab. (2007) 35(5):1740–1768Crossref, Google Scholar
• Kushner H.Heavy Traffic Analysis of Controlled Queueing and Communication Networks (2001) (Springer-Verlag, New York) Crossref, Google Scholar
• Lovegrove W. P., Hammond J. L., Tipper D. Simulation methods for studying nonstationary behavior of computer networks. IEEE J. Selected Areas Comm. (1990) 9:1696–1708Crossref, Google Scholar
• Mandelbaum A., Massey W. Strong approximations for time-dependent queues. Math. Oper. Res. (1995) 20:33–63Link, Google Scholar
• Massey W. Nonstationary queues. (1981) . Ph.D. thesis, Stanford University, Stanford, CAGoogle Scholar
• Massey W. Asymptotic analysis of the time dependent M/M/1 queue. Math. Oper. Res. (1985) 10:305–327Link, Google Scholar
• Newell G. F. Queues with time-dependent arrival rates I, II, III. J. Appl. Probab. (1968) 5:436–606[436–451 (I); 570–590 (II); 591–606 (iii)]Crossref, Google Scholar
• Ramanan K. Reflected diffusions defined via the extended Skorokhod map. Electronic J. Probab. (2006) 11(11):934–992Crossref, Google Scholar
• Ramanan K., Reiman M. Fluid and heavy traffic diffusion limits for a generalized processor sharing model. Ann. Appl. Probab. (2003) 13:100–139Crossref, Google Scholar
• Ramanan K., Reiman M. The heavy traffic limit of an unbalanced generalized processor sharing model. Ann. Appl. Probab. (2008) 18:22–58Crossref, Google Scholar
• Reiman M. I. Open queueing networks in heavy traffic. Math. Oper. Res. (1984) 9:441–458Link, Google Scholar
• Rolski T. Queues with non-stationary input stream: Ross' conjecture. Adv. Appl. Probab. (1981) 13:608–618Crossref, Google Scholar
• Rolski T. Queues with non-stationary inputs. Queueing Systems (1990) 5:113–130Crossref, Google Scholar
• Smart D. R.Fixed Point Theorems (1974) (Cambridge University Press, Cambridge, UK) Google Scholar
• Veinott A. F. Discrete dynamic programming with sensitive discount optimality criteria. Ann. Math. Statist. (1969) 40:1635–1660Crossref, Google Scholar
• Whitt W.An Introduction to Stochastic-Process Limits and Their Application to Queues (2002) (Springer-Verlag, New York) Crossref, Google Scholar
• Whitt W.An Introduction to Stochastic-Process Limits and Their Application to Queues (2002) . Internet Supplement, http://www.columbia.edu/ww2040/supplement.htmlCrossref, Google Scholar