Asymptotic Coupling of an SPDE, with Applications to Many-Server Queues
|
|
- Brooke Haynes
- 5 years ago
- Views:
Transcription
1 Asymptotic Coupling of an SPDE, with Applications to Many-Server Queues Mohammadreza Aghajani joint work with Kavita Ramanan Brown University March 2014 Mohammadreza Aghajanijoint work Asymptotic with Kavita Coupling Ramanan of(brown an SPDE, University) with Applications Marchto2014 Many-Server 1 / 16 Qu
2 Many-Server Queues λ N μ μ μ N μ Where do they arise? Call Centers Health Care Data Centers Relevant Steady state performance: P ss {all N servers are busy} P ss {waiting time > t seconds} ohammadreza Aghajanijoint work Asymptotic with Kavita Coupling Ramanan of(brown an SPDE, University) with Applications Marchto2014 Many-Server 2 / 16 Qu
3 Asymptotic Analysis Exact analysis for finite N is typically infeasible. state variable appropriately centered/scaled steady state distribution Classic pre-limit result Process Level Convergence Convergence of Stationary Dist. Unique Invariant Distribution limit process (Markov) invariant distirbution Mohammadreza Aghajanijoint work Asymptotic with Kavita Coupling Ramanan of(brown an SPDE, University) with Applications Marchto2014 Many-Server 3 / 16 Qu
4 Exponential Service Distribution Exponential service time case is studied in [Halfin-Whitt 81] Markov Process # of customers in system at time t Classic pre-limit result Process Level Convergence Convergence of Stationary Dist. Unique Invariant Distribution Gaussian Exponential (1-dimensional diffusion) Mohammadreza Aghajanijoint work Asymptotic with Kavita Coupling Ramanan of(brown an SPDE, University) with Applications Marchto2014 Many-Server 4 / 16 Qu
5 General Service Distribution Statistical data shows that service times are generally distributed (Lognormal, Pareto, etc. see e.g. [Brown et al. 05]) Goal: To extend the result to general service distribution Challenges {X (N) = # of customers in system} is no longer a Markov Process need to keep track of residual times or ages of customers in service to make the process Markovian Dimension of any finite-dim. Markovian representation grows with N Results using X N obtained by [Puhalskii and Reed], [Reed], [Mandelbaum and Momcilovic], [Dai and He], etc. However, few results on stationary distribution (beyond phase-type distributions) A way out: Common State Space (infinite-dimensional) Mohammadreza Aghajanijoint work Asymptotic with Kavita Coupling Ramanan of(brown an SPDE, University) with Applications Marchto2014 Many-Server 5 / 16 Qu
6 A Measure-Valued Representation A measure-valued state descriptor [Kaspi-Ramanan 11]: (X (N), ν (N) ) ν (N) (N) Entry into Service K Departure Process D (N) (N) E age a j (N) t E (N) represents the cumulative external arrivals a (N) j represents age of the jth customer to enter service ν (N) keeps track of the ages of all the customers in service ν (N) t = j δ (N) a (t) j Mohammadreza Aghajanijoint work Asymptotic with Kavita Coupling Ramanan of(brown an SPDE, University) with Applications Marchto2014 Many-Server 6 / 16 Qu
7 A Central Limit Theorem An important functional: Z (N) t (r) = Take the state variable Y (N) t j in service 1 G(a j (t) + r), r (0, ). 1 G(a j (t)) = (X (N) t, Z (N) t ) R H 1 (0, ) Lemma (Aghajani and R 13, Corollary of Kaspi and R 13) Under Assumptions on G, if ŷ (N) 0 y 0 in R H 1 (0, ), then for every t 0, Ŷ (N) t Y t in R H 1 (0, ), for some continuous Markov process {Y t = (X t, Z t ); t 0}. To make Y have all the desired properties, the choice of space is subtle. ohammadreza Aghajanijoint work Asymptotic with Kavita Coupling Ramanan of(brown an SPDE, University) with Applications Marchto2014 Many-Server 7 / 16 Qu
8 Main focus: Limit Process When z 0 H 1 (0, ) C 1 [0, ), the limit process is the unique solution of the coupled Ito process/spde: dx t = dw t + db t βdt + Z t(0)dt, dz t (r) = [ Z t(r) Ḡ(r)Z t(0) ] dt dm t (r) + Ḡ(r)dZ t(0), with boundary condition Z t (0) = X t = X t 0. M is a martingale measure, correlated to the Brownian motion W. W and B are independent Brownian motions. Remarks: Unusual SPDE boundary conditions enter the drift term. The process lies in the infinite-dimensional space R H 1 (0, ). For general initial condition z 0, Y is a solution to a slightly more complicated SPDE. We are the interested in the invariant distribution of the Markov process Y. Mohammadreza Aghajanijoint work Asymptotic with Kavita Coupling Ramanan of(brown an SPDE, University) with Applications Marchto2014 Many-Server 8 / 16 Qu
9 Invariant Distribution: Existence Theorem (Aghajani and R 13) Under assumptions on G, the limit process has an invariant distribution. Main tool: Krylov-Bogoliubov [ 37] Theorem. Need to show the tightness for family of occupation measures µ(γ) = 1 T T 0 1 Γ (Y t ) dt Starting from a particular initial condition introduced in [Gamarnik and Goldberg 11], we use the bounds they obtained on X (N). ohammadreza Aghajanijoint work Asymptotic with Kavita Coupling Ramanan of(brown an SPDE, University) with Applications Marchto2014 Many-Server 9 / 16 Qu
10 Invariant Distribution: Uniqueness Key challenge: State Space Y =. R H 1 is infinite dimensional Traditional recurrence methods are not easily applicable. In some cases, traditional methods fail [Hairer et. al. 11]. We invoke the asymptotic coupling method (Hairer, Mattingly, Sheutzow, Bakhtin, et al.) Theorem (Hairer et al. 11, continuous-time version) Assume for a Markov kernel {P t } on a polish state space Y, there exists a measurable set A Y with the following two properties: (I) µ(a) > 0 for any invariant probability measure µ of P t. (II) For every y, ỹ A, there exists a measurable map Γ y,ỹ : A A M(P [0, ) δ y, P [0, ) δỹ), such that Γ y,ỹ (D) > 0. Then {P t } has at most one invariant probability measure. P [0, ) δ y M(Y [0, ) ): distribution of a Markov process with kernel P starting at y. M(µ 1, µ 2 ) = {γ M(Y [0, ) Y [0, ) ), γ i µ i, i = 1, 2.} D = {(x, y) Y [0, ) Y [0, ) ; lim t d(x t, y t) = 0} ohammadreza Aghajanijoint work Asymptotic with Kavita Coupling Ramanan of(brown an SPDE, University) with Applications Marchto 2014 Many-Server 10 / 16 Qu
11 Invariant Distribution: Uniqueness To utilize the the asymptotic coupling theorem, we have to: 1. Define the set A y 2. Construct the joint ~y 3. Prove the convergence with positive probability Then Γ y,ỹ = Law(Y y, Ỹ ỹ) is a legitimate asymptotic coupling. Mohammadreza Aghajanijoint work Asymptotic with Kavita Coupling Ramanan of(brown an SPDE, University) with Applications Marchto 2014 Many-Server 11 / 16 Qu
12 Invariant Distribution: Uniqueness Theorem (Aghajani and R 13) Under assumptions on G, the limit process has at most one invariant distribution. Proof idea. Let y = (x 0, z 0 ) and ỹ = ( x 0, ỹ 0 ). As defined before, dx t = dw t + db t βdt + Z t(0)dt, Now define dz t(r) = [ Z t(r) Ḡ(r)Z t(0) ] dt dm t(r) + Ḡ(r)dZt(0), d X t = dw t + d B t βdt + Z t(0)dt, d Z [ t(r) = Z t (r) Ḡ(r) Z t(0)] dt dm t(r) + Ḡ(r)d Z t(0), where B t = B t + t 0 ( Z s(0) λ X s ) ds. ohammadreza Aghajanijoint work Asymptotic with Kavita Coupling Ramanan of(brown an SPDE, University) with Applications Marchto 2014 Many-Server 12 / 16 Qu
13 Invariant Distribution: Uniqueness Define A = {(x, z) Y; x 0}. For every invariant dist. µ of P, µ(a) > 0. Lemma When y, ỹ A, we have Z (0) L 2 Asymptotic Convergence: Xt = x 0e λt X t 0. Z t(r) = z 0(t + r) + Ḡ(r) X t + t 0 Using Lemma (2), Zt 0 in H 1 (0, ). t 0 X s g(t + r s)ds Z s(0)ḡ(t + r s)ds. (1) Distribution of Ỹ : By Lemma 2, the drift Z (0) λ X satisfies the Novikov condition. By Girsanov s Theorem, the distribution of B is equivalent to a Brownian motion, and therefore, Ỹ P δỹ. ohammadreza Aghajanijoint work Asymptotic with Kavita Coupling Ramanan of(brown an SPDE, University) with Applications Marchto 2014 Many-Server 13 / 16 Qu
14 Summary and Conclusion Key Challenge: Choosing the right space for Z Space Markov Property SPDE Charac. Uniqueness of Stat. Dist. C[0, ) Yes No Unknown C 1 [0, ) Yes Yes Unknown L 2 (0, ) Unknown No Yes H 1 (0, ) Yes Yes Yes Summary and Conclusions: Introduced a more tractable SPDE framework for the study of diffusion limits of many-server queues Use of the asymptotic coupling method (as opposed to Lyapunov function methods) to establishing stability properties of queueing networks: more suitable for establishing uniqueness of stationary distributions of infinite-dimensional processes Strengthened the Gamarnik-Goldberg tightness result to convergence of the X-marginal Mohammadreza Aghajanijoint work Asymptotic with Kavita Coupling Ramanan of(brown an SPDE, University) with Applications Marchto 2014 Many-Server 14 / 16 Qu
15 Open Problem The main open problem: to characterize the unique invariant distribution of Y A possible approach: to use the generator of the process Y. Lemma For all F : R H 1 (0, ) C 1 [0, ) R with a representation F (x, z) = f(x, z (n) ) for some n 1, r 1,..., r n [0, ), z (n) = (z(r 1 ),..., z(r n)) and f C 1 (R n+1 ), LF (x, z) =f x(x, z (n) ){z (0) β} + n f j (x, z (n) ){z (r j ) Ḡ(r j)m(x, z)} j=1 n + f xx(x, z (n) ) + b j (x)f xj (x, z (n) ) + 1 n c i,j (x)f i,j (x, z (n) ). 2 j=1 i,j=1 where b i and c i,j s are piecewise constant functions with discontinuity only at x = 0, and { β if x 0 m(x, z) = z (0) if x > 0. ohammadreza Aghajanijoint work Asymptotic with Kavita Coupling Ramanan of(brown an SPDE, University) with Applications Marchto 2014 Many-Server 15 / 16 Qu
16 Selected References Halfin, S. and Whitt, W. (1981). Heavy-traffic limit theorems for queues with many servers, Oper. Res. 29, Hairer, M., Mattingly, J. C. and Scheutzow, M. (2011). Asymptotic coupling and a general form of Harris theorem with applications to stochastic delay equations. Probab. Theory Related Fields 149, Puhalskii, A.A. and Reiman, M.I (2000) The Multiclass GI/P H/N Queue in the Halfin-Whitt Regime. Adv. Appl. Probab. 32, no. 2, pp Gamarnik, D. and Momcilovic, P. (2008) Steady-state analysis of a multi-server queue in the Halfin-Whitt regime, Advances in Applied Probability, 40, Reed, J. (2009) The G/GI/N queue in the Halfin-Whitt regime, Ann. Appl. Probab. 19 No. 6, Puhalskii, A.A. and Reed, J. (2010) On many servers queues in heavy traffic, Ann. Appl. Probab. 20 No.1, Kang, W. and Ramanan, K. (2010) Fluid limits of many-server queues with reneging Ann. Appl. Probab. 20: Kaspi, H. and Ramanan, K. (2013) Law of large numbers limits for many-server queues, Ann. Appl. Probab. 21 No. 1, Kaspi, H. and Ramanan, K. (2013) SPDE limits of many-server queues, Ann. Appl. Probab. 23 No. 1, Mohammadreza Aghajanijoint work Asymptotic with Kavita Coupling Ramanan of(brown an SPDE, University) with Applications Marchto 2014 Many-Server 16 / 16 Qu
A Diffusion Approximation for Stationary Distribution of Many-Server Queueing System In Halfin-Whitt Regime
A Diffusion Approximation for Stationary Distribution of Many-Server Queueing System In Halfin-Whitt Regime Mohammadreza Aghajani joint work with Kavita Ramanan Brown University APS Conference, Istanbul,
More informationarxiv: v3 [math.pr] 4 Dec 2017
ERGODICITY OF AN SPDE ASSOCIATED WITH A MANY-SERVER QUEUE By Reza Aghajani and Kavita Ramanan arxiv:1512.2929v3 [math.pr] 4 Dec 217 Department of Mathematics, UC San Diego, and Division of Applied Mathematics,
More informationThe G/GI/N Queue in the Halfin-Whitt Regime I: Infinite Server Queue System Equations
The G/GI/ Queue in the Halfin-Whitt Regime I: Infinite Server Queue System Equations J. E Reed School of Industrial and Systems Engineering Georgia Institute of Technology October 17, 27 Abstract In this
More informationFluid Limit of A Many-Server Queueing Network with Abandonment
Fluid Limit of A Many-Server Queueing Networ with Abandonment Weining Kang Guodong Pang October 22, 213 Abstract This paper studies a non-marovian many-server queueing networ with abandonment, where externally
More informationMODELING WEBCHAT SERVICE CENTER WITH MANY LPS SERVERS
MODELING WEBCHAT SERVICE CENTER WITH MANY LPS SERVERS Jiheng Zhang Oct 26, 211 Model and Motivation Server Pool with multiple LPS servers LPS Server K Arrival Buffer. Model and Motivation Server Pool with
More informationLecture 9: Deterministic Fluid Models and Many-Server Heavy-Traffic Limits. IEOR 4615: Service Engineering Professor Whitt February 19, 2015
Lecture 9: Deterministic Fluid Models and Many-Server Heavy-Traffic Limits IEOR 4615: Service Engineering Professor Whitt February 19, 2015 Outline Deterministic Fluid Models Directly From Data: Cumulative
More informationNonnegativity of solutions to the basic adjoint relationship for some diffusion processes
Queueing Syst (2011) 68:295 303 DOI 10.1007/s11134-011-9236-z Nonnegativity of solutions to the basic adjoint relationship for some diffusion processes J.G. Dai A.B. Dieker Received: 9 May 2011 / Revised:
More informationA DIFFUSION APPROXIMATION FOR THE G/GI/n/m QUEUE
A DIFFUSION APPROXIMATION FOR THE G/GI/n/m QUEUE by Ward Whitt Department of Industrial Engineering and Operations Research Columbia University, New York, NY 10027 July 5, 2002 Revision: June 27, 2003
More informationA Diffusion Approximation for the G/GI/n/m Queue
OPERATIONS RESEARCH Vol. 52, No. 6, November December 2004, pp. 922 941 issn 0030-364X eissn 1526-5463 04 5206 0922 informs doi 10.1287/opre.1040.0136 2004 INFORMS A Diffusion Approximation for the G/GI/n/m
More informationDynamic Control of Parallel-Server Systems
Dynamic Control of Parallel-Server Systems Jim Dai Georgia Institute of Technology Tolga Tezcan University of Illinois at Urbana-Champaign May 13, 2009 Jim Dai (Georgia Tech) Many-Server Asymptotic Optimality
More informationLoad Balancing in Distributed Service System: A Survey
Load Balancing in Distributed Service System: A Survey Xingyu Zhou The Ohio State University zhou.2055@osu.edu November 21, 2016 Xingyu Zhou (OSU) Load Balancing November 21, 2016 1 / 29 Introduction and
More informationQueues with Many Servers and Impatient Customers
MATHEMATICS OF OPERATIOS RESEARCH Vol. 37, o. 1, February 212, pp. 41 65 ISS 364-765X (print) ISS 1526-5471 (online) http://dx.doi.org/1.1287/moor.111.53 212 IFORMS Queues with Many Servers and Impatient
More informationPositive Harris Recurrence and Diffusion Scale Analysis of a Push Pull Queueing Network. Haifa Statistics Seminar May 5, 2008
Positive Harris Recurrence and Diffusion Scale Analysis of a Push Pull Queueing Network Yoni Nazarathy Gideon Weiss Haifa Statistics Seminar May 5, 2008 1 Outline 1 Preview of Results 2 Introduction Queueing
More informationBRAVO for QED Queues
1 BRAVO for QED Queues Yoni Nazarathy, The University of Queensland Joint work with Daryl J. Daley, The University of Melbourne, Johan van Leeuwaarden, EURANDOM, Eindhoven University of Technology. Applied
More informationMarkov Chains. X(t) is a Markov Process if, for arbitrary times t 1 < t 2 <... < t k < t k+1. If X(t) is discrete-valued. If X(t) is continuous-valued
Markov Chains X(t) is a Markov Process if, for arbitrary times t 1 < t 2
More informationCritically Loaded Time-Varying Multi-Server Queues: Computational Challenges and Approximations
Critically Loaded Time-Varying Multi-Server Queues: Computational Challenges and Approximations Young Myoung Ko Sabre Holdings, 315 Sabre Drive, Southlake, Texas 7692, USA, YoungMyoung.Ko@sabre.com Natarajan
More informationBlind Fair Routing in Large-Scale Service Systems with Heterogeneous Customers and Servers
Blind Fair Routing in Large-Scale Service Systems with Heterogeneous Customers and Servers Mor Armony Amy R. Ward 2 October 6, 2 Abstract In a call center, arriving customers must be routed to available
More informationTales of Time Scales. Ward Whitt AT&T Labs Research Florham Park, NJ
Tales of Time Scales Ward Whitt AT&T Labs Research Florham Park, NJ New Book Stochastic-Process Limits An Introduction to Stochastic-Process Limits and Their Application to Queues Springer 2001 I won t
More informationStein s Method for Steady-State Approximations: Error Bounds and Engineering Solutions
Stein s Method for Steady-State Approximations: Error Bounds and Engineering Solutions Jim Dai Joint work with Anton Braverman and Jiekun Feng Cornell University Workshop on Congestion Games Institute
More informationDesigning a Telephone Call Center with Impatient Customers
Designing a Telephone Call Center with Impatient Customers with Ofer Garnett Marty Reiman Sergey Zeltyn Appendix: Strong Approximations of M/M/ + Source: ErlangA QEDandSTROG FIAL.tex M/M/ + M System Poisson
More informationStochastic relations of random variables and processes
Stochastic relations of random variables and processes Lasse Leskelä Helsinki University of Technology 7th World Congress in Probability and Statistics Singapore, 18 July 2008 Fundamental problem of applied
More informationBlind Fair Routing in Large-Scale Service Systems with Heterogeneous Customers and Servers
OPERATIONS RESEARCH Vol. 6, No., January February 23, pp. 228 243 ISSN 3-364X (print) ISSN 526-5463 (online) http://dx.doi.org/.287/opre.2.29 23 INFORMS Blind Fair Routing in Large-Scale Service Systems
More informationarxiv: v1 [math.pr] 21 Jan 2014
Diffusion Models for Double-ended Queues with Renewal Arrival Processes arxiv:141.5146v1 [math.pr] 21 Jan 214 Xin Liu 1, Qi Gong 2, and Vidyadhar G. Kulkarni 2 1 Department of Mathematical Sciences, Clemson
More informationThe Generalized Drift Skorokhod Problem in One Dimension: Its solution and application to the GI/GI/1 + GI and. M/M/N/N transient distributions
The Generalized Drift Skorokhod Problem in One Dimension: Its solution and application to the GI/GI/1 + GI and M/M/N/N transient distributions Josh Reed Amy Ward Dongyuan Zhan Stern School of Business
More informationElectronic Companion Fluid Models for Overloaded Multi-Class Many-Server Queueing Systems with FCFS Routing
Submitted to Management Science manuscript MS-251-27 Electronic Companion Fluid Models for Overloaded Multi-Class Many-Server Queueing Systems with FCFS Routing Rishi Talreja, Ward Whitt Department of
More informationStabilizing Customer Abandonment in Many-Server Queues with Time-Varying Arrivals
OPERATIONS RESEARCH Vol. 6, No. 6, November December 212, pp. 1551 1564 ISSN 3-364X (print) ISSN 1526-5463 (online) http://dx.doi.org/1.1287/opre.112.114 212 INFORMS Stabilizing Customer Abandonment in
More informationP (L d k = n). P (L(t) = n),
4 M/G/1 queue In the M/G/1 queue customers arrive according to a Poisson process with rate λ and they are treated in order of arrival The service times are independent and identically distributed with
More informationTechnical Appendix for: When Promotions Meet Operations: Cross-Selling and Its Effect on Call-Center Performance
Technical Appendix for: When Promotions Meet Operations: Cross-Selling and Its Effect on Call-Center Performance In this technical appendix we provide proofs for the various results stated in the manuscript
More informationQ = (c) Assuming that Ricoh has been working continuously for 7 days, what is the probability that it will remain working at least 8 more days?
IEOR 4106: Introduction to Operations Research: Stochastic Models Spring 2005, Professor Whitt, Second Midterm Exam Chapters 5-6 in Ross, Thursday, March 31, 11:00am-1:00pm Open Book: but only the Ross
More informationOverflow Networks: Approximations and Implications to Call-Center Outsourcing
Overflow Networks: Approximations and Implications to Call-Center Outsourcing Itai Gurvich (Northwestern University) Joint work with Ohad Perry (CWI) Call Centers with Overflow λ 1 λ 2 Source of complexity:
More informationIEOR 6711: Stochastic Models I, Fall 2003, Professor Whitt. Solutions to Final Exam: Thursday, December 18.
IEOR 6711: Stochastic Models I, Fall 23, Professor Whitt Solutions to Final Exam: Thursday, December 18. Below are six questions with several parts. Do as much as you can. Show your work. 1. Two-Pump Gas
More informationDynamic Matching Models
Dynamic Matching Models Ana Bušić Inria Paris - Rocquencourt CS Department of École normale supérieure joint work with Varun Gupta, Jean Mairesse and Sean Meyn 3rd Workshop on Cognition and Control January
More informationOperations Research Letters. Instability of FIFO in a simple queueing system with arbitrarily low loads
Operations Research Letters 37 (2009) 312 316 Contents lists available at ScienceDirect Operations Research Letters journal homepage: www.elsevier.com/locate/orl Instability of FIFO in a simple queueing
More informationNew Perspectives on the Erlang-A Queue
New Perspectives on the Erlang-A Queue arxiv:1712.8445v1 [math.pr] 22 Dec 217 Andrew Daw School of Operations Research and Information Engineering Cornell University 257 Rhodes Hall, Ithaca, NY 14853 amd399@cornell.edu
More informationStochastic-Process Limits
Ward Whitt Stochastic-Process Limits An Introduction to Stochastic-Process Limits and Their Application to Queues With 68 Illustrations Springer Contents Preface vii 1 Experiencing Statistical Regularity
More informationHEAVY-TRAFFIC LIMITS FOR STATIONARY NETWORK FLOWS. By Ward Whitt, and Wei You November 28, 2018
Stochastic Systems HEAVY-TRAFFIC LIMITS FOR STATIONARY NETWORK FLOWS By Ward Whitt, and Wei You November 28, 2018 We establish heavy-traffic limits for the stationary flows in generalized Jackson networks,
More informationDesigning load balancing and admission control policies: lessons from NDS regime
Designing load balancing and admission control policies: lessons from NDS regime VARUN GUPTA University of Chicago Based on works with : Neil Walton, Jiheng Zhang ρ K θ is a useful regime to study the
More informationENGINEERING SOLUTION OF A BASIC CALL-CENTER MODEL
ENGINEERING SOLUTION OF A BASIC CALL-CENTER MODEL by Ward Whitt Department of Industrial Engineering and Operations Research Columbia University, New York, NY 10027 Abstract An algorithm is developed to
More informationEconomy of Scale in Multiserver Service Systems: A Retrospective. Ward Whitt. IEOR Department. Columbia University
Economy of Scale in Multiserver Service Systems: A Retrospective Ward Whitt IEOR Department Columbia University Ancient Relics A. K. Erlang (1924) On the rational determination of the number of circuits.
More informationQueueing Theory I Summary! Little s Law! Queueing System Notation! Stationary Analysis of Elementary Queueing Systems " M/M/1 " M/M/m " M/M/1/K "
Queueing Theory I Summary Little s Law Queueing System Notation Stationary Analysis of Elementary Queueing Systems " M/M/1 " M/M/m " M/M/1/K " Little s Law a(t): the process that counts the number of arrivals
More informationContact Centers with a Call-Back Option and Real-Time Delay Information
OPERATIOS RESEARCH Vol. 52, o. 4, July August 2004, pp. 527 545 issn 0030-364X eissn 526-5463 04 5204 0527 informs doi 0.287/opre.040.023 2004 IFORMS Contact Centers with a Call-Back Option and Real-Time
More informationQueuing Networks: Burke s Theorem, Kleinrock s Approximation, and Jackson s Theorem. Wade Trappe
Queuing Networks: Burke s Theorem, Kleinrock s Approximation, and Jackson s Theorem Wade Trappe Lecture Overview Network of Queues Introduction Queues in Tandem roduct Form Solutions Burke s Theorem What
More informationOPEN MULTICLASS HL QUEUEING NETWORKS: PROGRESS AND SURPRISES OF THE PAST 15 YEARS. w 1. v 2. v 3. Ruth J. Williams University of California, San Diego
OPEN MULTICLASS HL QUEUEING NETWORKS: PROGRESS AND SURPRISES OF THE PAST 15 YEARS v 2 w3 v1 w 2 w 1 v 3 Ruth J. Williams University of California, San Diego 1 PERSPECTIVE MQN SPN Sufficient conditions
More informationStatistics 150: Spring 2007
Statistics 150: Spring 2007 April 23, 2008 0-1 1 Limiting Probabilities If the discrete-time Markov chain with transition probabilities p ij is irreducible and positive recurrent; then the limiting probabilities
More informationMANY-SERVER QUEUES WITH CUSTOMER ABANDONMENT: NUMERICAL ANALYSIS OF THEIR DIFFUSION MODEL
Stochastic Systems 213, Vol. 3, No. 1, 96 146 DOI: 1.1214/11-SSY29 MANY-SERVER QUEUES WITH CUSTOMER ABANDONMENT: NUMERICAL ANALYSIS OF THEIR DIFFUSION MODEL By J. G. Dai and Shuangchi He Cornell University
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 22 12/09/2013. Skorokhod Mapping Theorem. Reflected Brownian Motion
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.7J Fall 213 Lecture 22 12/9/213 Skorokhod Mapping Theorem. Reflected Brownian Motion Content. 1. G/G/1 queueing system 2. One dimensional reflection mapping
More informationFluid Models of Parallel Service Systems under FCFS
Fluid Models of Parallel Service Systems under FCFS Hanqin Zhang Business School, National University of Singapore Joint work with Yuval Nov and Gideon Weiss from The University of Haifa, Israel Queueing
More informationData analysis and stochastic modeling
Data analysis and stochastic modeling Lecture 7 An introduction to queueing theory Guillaume Gravier guillaume.gravier@irisa.fr with a lot of help from Paul Jensen s course http://www.me.utexas.edu/ jensen/ormm/instruction/powerpoint/or_models_09/14_queuing.ppt
More informationOther properties of M M 1
Other properties of M M 1 Přemysl Bejda premyslbejda@gmail.com 2012 Contents 1 Reflected Lévy Process 2 Time dependent properties of M M 1 3 Waiting times and queue disciplines in M M 1 Contents 1 Reflected
More informationIEOR 8100: Topics in OR: Asymptotic Methods in Queueing Theory. Fall 2009, Professor Whitt. Class Lecture Notes: Wednesday, September 9.
IEOR 8100: Topics in OR: Asymptotic Methods in Queueing Theory Fall 2009, Professor Whitt Class Lecture Notes: Wednesday, September 9. Heavy-Traffic Limits for the GI/G/1 Queue 1. The GI/G/1 Queue We will
More informationA How Hard are Steady-State Queueing Simulations?
A How Hard are Steady-State Queueing Simulations? ERIC CAO NI and SHANE G. HENDERSON, Cornell University Some queueing systems require tremendously long simulation runlengths to obtain accurate estimators
More informationRouting and Staffing in Large-Scale Service Systems: The Case of Homogeneous Impatient Customers and Heterogeneous Servers 1
Routing and Staffing in Large-Scale Service Systems: The Case of Homogeneous Impatient Customers and Heterogeneous Servers 1 Mor Armony 2 Avishai Mandelbaum 3 June 25, 2008 Abstract Motivated by call centers,
More informationState Space Collapse in Many-Server Diffusion Limits of Parallel Server Systems. J. G. Dai. Tolga Tezcan
State Space Collapse in Many-Server Diffusion imits of Parallel Server Systems J. G. Dai H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia
More informationp 1 ( Y p dp) 1/p ( X p dp) 1 1 p
Doob s inequality Let X(t) be a right continuous submartingale with respect to F(t), t 1 P(sup s t X(s) λ) 1 λ {sup s t X(s) λ} X + (t)dp 2 For 1 < p
More informationContinuous-Time Markov Chain
Continuous-Time Markov Chain Consider the process {X(t),t 0} with state space {0, 1, 2,...}. The process {X(t),t 0} is a continuous-time Markov chain if for all s, t 0 and nonnegative integers i, j, x(u),
More informationStabilizing Customer Abandonment in Many-Server Queues with Time-Varying Arrivals
Submitted to Operations Research manuscript OPRE-29-6-259; OPRE-211-12-597.R1 Stabilizing Customer Abandonment in Many-Server Queues with -Varying Arrivals Yunan Liu Department of Industrial Engineering,
More information(b) What is the variance of the time until the second customer arrives, starting empty, assuming that we measure time in minutes?
IEOR 3106: Introduction to Operations Research: Stochastic Models Fall 2006, Professor Whitt SOLUTIONS to Final Exam Chapters 4-7 and 10 in Ross, Tuesday, December 19, 4:10pm-7:00pm Open Book: but only
More informationQueueing Theory II. Summary. ! M/M/1 Output process. ! Networks of Queue! Method of Stages. ! General Distributions
Queueing Theory II Summary! M/M/1 Output process! Networks of Queue! Method of Stages " Erlang Distribution " Hyperexponential Distribution! General Distributions " Embedded Markov Chains M/M/1 Output
More informationOn the Resource/Performance Tradeoff in Large Scale Queueing Systems
On the Resource/Performance Tradeoff in Large Scale Queueing Systems David Gamarnik MIT Joint work with Patrick Eschenfeldt, John Tsitsiklis and Martin Zubeldia (MIT) High level comments High level comments
More informationStochastic Calculus. Kevin Sinclair. August 2, 2016
Stochastic Calculus Kevin Sinclair August, 16 1 Background Suppose we have a Brownian motion W. This is a process, and the value of W at a particular time T (which we write W T ) is a normally distributed
More informationStochastic process. X, a series of random variables indexed by t
Stochastic process X, a series of random variables indexed by t X={X(t), t 0} is a continuous time stochastic process X={X(t), t=0,1, } is a discrete time stochastic process X(t) is the state at time t,
More informationTechnical Appendix for: When Promotions Meet Operations: Cross-Selling and Its Effect on Call-Center Performance
Technical Appendix for: When Promotions Meet Operations: Cross-Selling and Its Effect on Call-Center Performance In this technical appendix we provide proofs for the various results stated in the manuscript
More informationFunctional Limit theorems for the quadratic variation of a continuous time random walk and for certain stochastic integrals
Functional Limit theorems for the quadratic variation of a continuous time random walk and for certain stochastic integrals Noèlia Viles Cuadros BCAM- Basque Center of Applied Mathematics with Prof. Enrico
More informationMarkovian N-Server Queues (Birth & Death Models)
Markovian -Server Queues (Birth & Death Moels) - Busy Perio Arrivals Poisson (λ) ; Services exp(µ) (E(S) = /µ) Servers statistically ientical, serving FCFS. Offere loa R = λ E(S) = λ/µ Erlangs Q(t) = number
More informationLIMITS FOR QUEUES AS THE WAITING ROOM GROWS. Bell Communications Research AT&T Bell Laboratories Red Bank, NJ Murray Hill, NJ 07974
LIMITS FOR QUEUES AS THE WAITING ROOM GROWS by Daniel P. Heyman Ward Whitt Bell Communications Research AT&T Bell Laboratories Red Bank, NJ 07701 Murray Hill, NJ 07974 May 11, 1988 ABSTRACT We study the
More informationRELATING TIME AND CUSTOMER AVERAGES FOR QUEUES USING FORWARD COUPLING FROM THE PAST
J. Appl. Prob. 45, 568 574 (28) Printed in England Applied Probability Trust 28 RELATING TIME AND CUSTOMER AVERAGES FOR QUEUES USING FORWARD COUPLING FROM THE PAST EROL A. PEKÖZ, Boston University SHELDON
More information5 Lecture 5: Fluid Models
5 Lecture 5: Fluid Models Stability of fluid and stochastic processing networks Stability analysis of some fluid models Optimization of fluid networks. Separated continuous linear programming 5.1 Stability
More informationMaking Delay Announcements
Making Delay Announcements Performance Impact and Predicting Queueing Delays Ward Whitt With Mor Armony, Rouba Ibrahim and Nahum Shimkin March 7, 2012 Last Class 1 The Overloaded G/GI/s + GI Fluid Queue
More informationProbability Models in Electrical and Computer Engineering Mathematical models as tools in analysis and design Deterministic models Probability models
Probability Models in Electrical and Computer Engineering Mathematical models as tools in analysis and design Deterministic models Probability models Statistical regularity Properties of relative frequency
More informationSolutions to Homework Discrete Stochastic Processes MIT, Spring 2011
Exercise 6.5: Solutions to Homework 0 6.262 Discrete Stochastic Processes MIT, Spring 20 Consider the Markov process illustrated below. The transitions are labelled by the rate q ij at which those transitions
More informationErlang-C = M/M/N. agents. queue ACD. arrivals. busy ACD. queue. abandonment BACK FRONT. lost calls. arrivals. lost calls
Erlang-C = M/M/N agents arrivals ACD queue Erlang-A lost calls FRONT BACK arrivals busy ACD queue abandonment lost calls Erlang-C = M/M/N agents arrivals ACD queue Rough Performance Analysis
More informationOn Reflecting Brownian Motion with Drift
Proc. Symp. Stoch. Syst. Osaka, 25), ISCIE Kyoto, 26, 1-5) On Reflecting Brownian Motion with Drift Goran Peskir This version: 12 June 26 First version: 1 September 25 Research Report No. 3, 25, Probability
More informationMaximum pressure policies for stochastic processing networks
Maximum pressure policies for stochastic processing networks Jim Dai Joint work with Wuqin Lin at Northwestern Univ. The 2011 Lunteren Conference Jim Dai (Georgia Tech) MPPs January 18, 2011 1 / 55 Outline
More informationSimulation methods for stochastic models in chemistry
Simulation methods for stochastic models in chemistry David F. Anderson anderson@math.wisc.edu Department of Mathematics University of Wisconsin - Madison SIAM: Barcelona June 4th, 21 Overview 1. Notation
More informationQueues and Queueing Networks
Queues and Queueing Networks Sanjay K. Bose Dept. of EEE, IITG Copyright 2015, Sanjay K. Bose 1 Introduction to Queueing Models and Queueing Analysis Copyright 2015, Sanjay K. Bose 2 Model of a Queue Arrivals
More informationSynchronized Queues with Deterministic Arrivals
Synchronized Queues with Deterministic Arrivals Dimitra Pinotsi and Michael A. Zazanis Department of Statistics Athens University of Economics and Business 76 Patission str., Athens 14 34, Greece Abstract
More informationTopics in queueing theory
Graduate Theses and Dissertations Iowa State University Capstones, Theses and Dissertations 217 Topics in queueing theory Keguo Huang Iowa State University Follow this and additional works at: http://lib.dr.iastate.edu/etd
More informationAnalysis of Two-Heterogeneous Server Queueing System
UDC 519.872 Analysis of Two-Heterogeneous Server Queueing System H. Okan Isguder, U. U. Kocer Department of Statistics, Dokuz Eylul University, Tinaztepe Campus, Izmir, 3539, Turkey Abstract. This study
More informationModeling Service Networks with Time-Varying Demand
Modeling Service with Time-Varying Demand - Performance Approximations and Staffing Controls (with Beixiang He, Liam Huang, Korhan Aras, Ward Whitt) Department of Industrial and Systems Engineering NC
More informationClass 11 Non-Parametric Models of a Service System; GI/GI/1, GI/GI/n: Exact & Approximate Analysis.
Service Engineering Class 11 Non-Parametric Models of a Service System; GI/GI/1, GI/GI/n: Exact & Approximate Analysis. G/G/1 Queue: Virtual Waiting Time (Unfinished Work). GI/GI/1: Lindley s Equations
More informationIntroduction to Queueing Theory with Applications to Air Transportation Systems
Introduction to Queueing Theory with Applications to Air Transportation Systems John Shortle George Mason University February 28, 2018 Outline Why stochastic models matter M/M/1 queue Little s law Priority
More informationExercises. T 2T. e ita φ(t)dt.
Exercises. Set #. Construct an example of a sequence of probability measures P n on R which converge weakly to a probability measure P but so that the first moments m,n = xdp n do not converge to m = xdp.
More information2905 Queueing Theory and Simulation PART III: HIGHER DIMENSIONAL AND NON-MARKOVIAN QUEUES
295 Queueing Theory and Simulation PART III: HIGHER DIMENSIONAL AND NON-MARKOVIAN QUEUES 16 Queueing Systems with Two Types of Customers In this section, we discuss queueing systems with two types of customers.
More informationSENSITIVITY OF PERFORMANCE IN THE ERLANG-A QUEUEING MODEL TO CHANGES IN THE MODEL PARAMETERS
SENSITIVITY OF PERFORMANCE IN THE ERLANG-A QUEUEING MODEL TO CHANGES IN THE MODEL PARAMETERS by Ward Whitt Department of Industrial Engineering and Operations Research Columbia University, New York, NY
More informationHEAVY-TRAFFIC EXTREME-VALUE LIMITS FOR QUEUES
HEAVY-TRAFFIC EXTREME-VALUE LIMITS FOR QUEUES by Peter W. Glynn Department of Operations Research Stanford University Stanford, CA 94305-4022 and Ward Whitt AT&T Bell Laboratories Murray Hill, NJ 07974-0636
More informationTHE HEAVY-TRAFFIC BOTTLENECK PHENOMENON IN OPEN QUEUEING NETWORKS. S. Suresh and W. Whitt AT&T Bell Laboratories Murray Hill, New Jersey 07974
THE HEAVY-TRAFFIC BOTTLENECK PHENOMENON IN OPEN QUEUEING NETWORKS by S. Suresh and W. Whitt AT&T Bell Laboratories Murray Hill, New Jersey 07974 ABSTRACT This note describes a simulation experiment involving
More informationA Fluid Approximation for Service Systems Responding to Unexpected Overloads
Submitted to Operations Research manuscript 28-9-55.R2, Longer Online Version 6/28/1 A Fluid Approximation for Service Systems Responding to Unexpected Overloads Ohad Perry Centrum Wiskunde & Informatica
More informationThe concentration of a drug in blood. Exponential decay. Different realizations. Exponential decay with noise. dc(t) dt.
The concentration of a drug in blood Exponential decay C12 concentration 2 4 6 8 1 C12 concentration 2 4 6 8 1 dc(t) dt = µc(t) C(t) = C()e µt 2 4 6 8 1 12 time in minutes 2 4 6 8 1 12 time in minutes
More informationA Robust Queueing Network Analyzer Based on Indices of Dispersion
A Robust Queueing Network Analyzer Based on Indices of Dispersion Wei You (joint work with Ward Whitt) Columbia University INFORMS 2018, Phoenix November 6, 2018 1/20 Motivation Many complex service systems
More informationStability and Rare Events in Stochastic Models Sergey Foss Heriot-Watt University, Edinburgh and Institute of Mathematics, Novosibirsk
Stability and Rare Events in Stochastic Models Sergey Foss Heriot-Watt University, Edinburgh and Institute of Mathematics, Novosibirsk ANSAPW University of Queensland 8-11 July, 2013 1 Outline (I) Fluid
More informationWhat You Should Know About Queueing Models To Set Staffing Requirements in Service Systems
What You Should Know About Queueing Models To Set Staffing Requirements in Service Systems by Ward Whitt Department of Industrial Engineering and Operations Research Columbia University 304 S. W. Mudd
More informationA Joining Shortest Queue with MAP Inputs
The Eighth International Symposium on Operations Research and Its Applications (ISORA 09) Zhangjiajie, China, September 20 22, 2009 Copyright 2009 ORSC & APORC, pp. 25 32 A Joining Shortest Queue with
More informationE-Companion to Fully Sequential Procedures for Large-Scale Ranking-and-Selection Problems in Parallel Computing Environments
E-Companion to Fully Sequential Procedures for Large-Scale Ranking-and-Selection Problems in Parallel Computing Environments Jun Luo Antai College of Economics and Management Shanghai Jiao Tong University
More informationThe Transition Probability Function P ij (t)
The Transition Probability Function P ij (t) Consider a continuous time Markov chain {X(t), t 0}. We are interested in the probability that in t time units the process will be in state j, given that it
More informationProactive Care with Degrading Class Types
Proactive Care with Degrading Class Types Yue Hu (DRO, Columbia Business School) Joint work with Prof. Carri Chan (DRO, Columbia Business School) and Prof. Jing Dong (DRO, Columbia Business School) Motivation
More informationMultivariate Risk Processes with Interacting Intensities
Multivariate Risk Processes with Interacting Intensities Nicole Bäuerle (joint work with Rudolf Grübel) Luminy, April 2010 Outline Multivariate pure birth processes Multivariate Risk Processes Fluid Limits
More informationSkew Brownian Motion and Applications in Fluid Dispersion
Skew Brownian Motion and Applications in Fluid Dispersion Ed Waymire Department of Mathematics Oregon State University Corvallis, OR 97331 *Based on joint work with Thilanka Appuhamillage, Vrushali Bokil,
More informationA new approach for investment performance measurement. 3rd WCMF, Santa Barbara November 2009
A new approach for investment performance measurement 3rd WCMF, Santa Barbara November 2009 Thaleia Zariphopoulou University of Oxford, Oxford-Man Institute and The University of Texas at Austin 1 Performance
More informationAuthor's personal copy
Queueing Syst (215) 81:341 378 DOI 1.17/s11134-15-9462-x Stabilizing performance in a single-server queue with time-varying arrival rate Ward Whitt 1 Received: 5 July 214 / Revised: 7 May 215 / Published
More informationarxiv: v1 [cs.pf] 22 Dec 2017
Scalable Load Balancing in etworked Systems: Universality Properties and Stochastic Coupling Methods Mark van der Boor 1, Sem C. Borst 1,2, Johan S.H. van Leeuwaarden 1, and Debankur Mukherjee 1 1 Eindhoven
More information