A Diffusion Approximation for Stationary Distribution of Many-Server Queueing System In Halfin-Whitt Regime
|
|
- Lee Robbins
- 5 years ago
- Views:
Transcription
1 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, Turkey July 2015
2 Many-Server Queues N λ 1 μ 2 μ 3 μ N μ Where do they arise? Call Centers Health Care Data Centers Mohammadreza Aghajanijoint work with Kavita Ramanan A Diffusion Approximation for Stationary Distributi
3 Many-Server Queues 1 2 λ N 3 μ μ μ N μ Relevant steady state performance measures:
4 Asymptotic Analysis Exact analysis for finite N is typically infeasible. state variable appropriately centered/scaled steady state distribution Classic pre-limit result
5 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 limit process (Markov)
6 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 Unique Invariant Distribution limit process (Markov) invariant distirbution
7 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
8 Outline 1 Recap on exponential service distribution
9 Outline 1 Recap on exponential service distribution 2 State representation for General service distribution
10 Outline 1 Recap on exponential service distribution 2 State representation for General service distribution 3 Characterization of the limit process
11 Outline 1 Recap on exponential service distribution 2 State representation for General service distribution 3 Characterization of the limit process 4 Proof of the main results
12 Outline 1 Recap on exponential service distribution 2 State representation for General service distribution 3 Characterization of the limit process 4 Proof of the main results 5 Ongoing work
13 1. Exponential Service Distribution Halfin-Whitt Regime [Halfin-Whitt 81] for exponential service time Let N, λ (N) = Nµ β N, ρ (N) = λ (N) /Nµ 1. Diffusion (CLT) scaling limit for X (N) t : # of customers in system.
14 1. Exponential Service Distribution Halfin-Whitt Regime [Halfin-Whitt 81] for exponential service time Let N, λ (N) = Nµ β N, ρ (N) = λ (N) /Nµ 1. Diffusion (CLT) scaling limit for X (N) t : # of customers in system. # of customers in system at time t Classic pre-limit result Process Level Convergence Convergence of Stationary Dist. Unique Invariant Distribution
15 1. Exponential Service Distribution Halfin-Whitt Regime [Halfin-Whitt 81] for exponential service time Let N, λ (N) = Nµ β N, ρ (N) = λ (N) /Nµ 1. Diffusion (CLT) scaling limit for X (N) t : # of customers in system. # of customers in system at time t Classic pre-limit result Process Level Convergence Convergence of Stationary Dist. Unique Invariant Distribution (1-dimensional diffusion)
16 1. Exponential Service Distribution Halfin-Whitt Regime [Halfin-Whitt 81] for exponential service time Let N, λ (N) = Nµ β N, ρ (N) = λ (N) /Nµ 1. Diffusion (CLT) scaling limit for X (N) t : # of customers in system. # 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)
17 1. Exponential Service Distribution Halfin-Whitt Regime [Halfin-Whitt 81] for exponential service time Let N, λ (N) = Nµ β N, ρ (N) = λ (N) /Nµ 1. Diffusion (CLT) scaling limit for X (N) t : # of customers in system. # 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) P ss (all N servers are busy) π([0, )) (0, 1).
18 2. 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 for general service distribution
19 2. 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 for general service distribution Challenges X (N) 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
20 2. 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 for general service distribution Challenges X (N) 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 Prior Work Some particular service distributions [Jelenkovic-Mandelbaum], [Gamarnik-Momcilovic], [Puhalski-Reiman]. Results using X N obtained by [Puhalskii-Reed], [Reed], [Mandelbaum-Momcilovic], [Dai-He] (with abandonment), etc. However, there are not many results on stationary distribution.
21 2. 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 for general service distribution Challenges X (N) 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 Prior Work Some particular service distributions [Jelenkovic-Mandelbaum], [Gamarnik-Momcilovic], [Puhalski-Reiman]. Results using X N obtained by [Puhalskii-Reed], [Reed], [Mandelbaum-Momcilovic], [Dai-He] (with abandonment), etc. However, there are not many results on stationary distribution. A way out: Common State Space (infinite-dimensional)
22 A Measure-valued Representation ν (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 δ (t) a (N) j
23 A Measure-valued Representation ν (N) (N) E particles move at unit rate to the right 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 δ (t) a (N) j
24 A Measure-valued Representation ν (N) (N) E particles move at unit rate to the right 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 δ (t) a (N) j
25 A Measure-valued Representation Departure Process D (N) ν (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 K (N) cumulative entry into service D (N) cumulative departure process
26 A Measure-valued Representation (N) Service Entry K ν (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 K (N) cumulative entry into service D (N) cumulative departure process
27 A New Representation ( ) State descriptor S (N) t = X (N) t, ν (N) t is used in [Kaspi-Ramanan 11, 13] and [Kang- Ramanan 10, 12.] Diffusion limit for ν (N) is established in a distribution space H 2. An extra component needs to be added for the limit process to be Markov.
28 A New Representation ( ) State descriptor S (N) t = X (N) t, ν (N) t is used in [Kaspi-Ramanan 11, 13] and [Kang- Ramanan 10, 12.] Diffusion limit for ν (N) is established in a distribution space H 2. An extra component needs to be added for the limit process to be Markov. Instead of the whole measure ν, we define the functional Z (N) t (r). = G( + r), ν (N) t = G( ) j in service which we call Frozen Departure Process. G(a j (t) + r), r 0, G(a j (t))
29 A New Representation ( ) State descriptor S (N) t = X (N) t, ν (N) t is used in [Kaspi-Ramanan 11, 13] and [Kang- Ramanan 10, 12.] Diffusion limit for ν (N) is established in a distribution space H 2. An extra component needs to be added for the limit process to be Markov. Instead of the whole measure ν, we define the functional Z (N) t (r). = G( + r), ν (N) t = G( ) j in service which we call Frozen Departure Process. We use the state variable Y (N) t = (X (N) t, Z (N) t ) R H 1 (0, ). G(a j (t) + r), r 0, G(a j (t))
30 Main Results Now we establish diffusion level change of limits for Y (N) (t). Long-time behavior of pre-limit Process Level Convergence Convergence of Stationary Dist. Unique Invariant Distribution Main Contributions
31 Main Results Now we establish diffusion level change of limits for Y (N) (t). Long-time behavior of pre-limit Process Level Convergence Convergence of Stationary Dist. Unique Invariant Distribution Main Contributions
32 Main Results Now we establish diffusion level change of limits for Y (N) (t). Long-time behavior of pre-limit Follows from [Kang-Ramanan 12] Process Level Convergence and the continuous mapping theorem Convergence of Stationary Dist. Unique Invariant Distribution Main Contributions
33 Main Results Now we establish diffusion level change of limits for Y (N) (t). Long-time behavior of pre-limit Process Level Convergence Convergence of Stationary Dist. Unique Invariant Distribution Main Contributions
34 Main Results Now we establish diffusion level change of limits for Y (N) (t). Long-time behavior of pre-limit Done for (X,ν) in [Kaspi-Ramanan 13] Process Level Convergence Convergence We adapt it to (X,Z) of Stationary Dist. Unique Invariant Distribution Main Contributions
35 Main Results Now we establish diffusion level change of limits for Y (N) (t). Long-time behavior of pre-limit Process Level Convergence Convergence of Stationary Dist. Unique Invariant Distribution Main Contributions Characterization of the limit (X, Z) in terms of an SPDE in an appropriate space that makes it Markov
36 Main Results Now we establish diffusion level change of limits for Y (N) (t). Long-time behavior of pre-limit Process Level Convergence Convergence of Stationary Dist. Unique Invariant Distribution Main Contributions Characterization of the limit (X, Z) in terms of an SPDE in an appropriate space that makes it Markov Showing that (X, Z) has a unique invariant distribution
37 Main Results Now we establish diffusion level change of limits for Y (N) (t). Long-time behavior of pre-limit Process Level Convergence Convergence of Stationary Dist. Unique Invariant Distribution Main Contributions Characterization of the limit (X, Z) in terms of an SPDE in an appropriate space that makes it Markov Showing that (X, Z) has a unique invariant distribution Proving π (N) π, with partial characterization of π
38 Implications of our Results Comments on Our Results: (N) Previously, { ˆX } (the X-marginal of π (N) ) was only shown to be tight [Gamarnik-Goldberg]. We proved the convergence.
39 Implications of our Results Comments on Our Results: (N) Previously, { ˆX } (the X-marginal of π (N) ) was only shown to be tight [Gamarnik-Goldberg]. We proved the convergence. The limit π is now the invariant distribution of a Markov process. We can use basic adjoint relation type formulations to characterize it.
40 Implications of our Results Comments on Our Results: (N) Previously, { ˆX } (the X-marginal of π (N) ) was only shown to be tight [Gamarnik-Goldberg]. We proved the convergence. The limit π is now the invariant distribution of a Markov process. We can use basic adjoint relation type formulations to characterize it. As the limit process (X, Z) is infinite dimensional, we use the newly developed method of asymptotic coupling to prove the uniqueness of invariant distribution.
41 3. Characterization of Limit Process Consider the following SPDE : dx t = dm t (1) + db t βdt + Z t(0)dt, dz t (r) = [ Z t(r) Ḡ(r)Z t(0) ] dt dm t ( Φr 1 Ḡ(r)1) + Ḡ(r)dZ t(0) with boundary condition Z t (0) = X t, and initial condition Y 0. B is a standard Brownian motion, M is an independent martingale measure.
42 3. Characterization of Limit Process Consider the following SPDE : dx t = dm t (1) + db t βdt + Z t(0)dt, dz t (r) = [ Z t(r) Ḡ(r)Z t(0) ] dt dm t ( Φr 1 Ḡ(r)1) + Ḡ(r)dZ t(0) with boundary condition Z t (0) = X t, and initial condition Y 0. B is a standard Brownian motion, M is an independent martingale measure. Assumptions: I. hazard rate function h(x). = g(x)/g(x) is bounded; II. G has finite 2 + ɛ moment for some ɛ > 0; Theorem If Assumptions I. and II. hold, for every initial condition Y 0, the SPDEs above a unique continuous R H 1 (0, )-valued solution, which is a Markov process.
43 Characterization of Limit Process Given initial condition y 0 = (x 0, z 0 ), we can explicitly solve the SPDE: X is a solution to a non-linear Volterra equation ([Reed], [Puhalskii-Reed],[Kaspi-Ramanan])
44 Characterization of Limit Process Given initial condition y 0 = (x 0, z 0 ), we can explicitly solve the SPDE: X is a solution to a non-linear Volterra equation ([Reed], [Puhalskii-Reed],[Kaspi-Ramanan]) The service entry process K satisfies K(t) = B t βt X + (t) + x + 0.
45 Characterization of Limit Process Given initial condition y 0 = (x 0, z 0 ), we can explicitly solve the SPDE: X is a solution to a non-linear Volterra equation ([Reed], [Puhalskii-Reed],[Kaspi-Ramanan]) The service entry process K satisfies K(t) = B t βt X + (t) + x + 0. Given X (and hence K), the equation for Z is a transport equation. Z t (r) = z 0 (t + r) M t (Ψ t+r 1) + ( Γ t K ) (r). {Ψ t; t 0} and {Γ t; t 0} are certain family of mappings on continuous functions.
46 Invariant Distribution of the Limit Process Existence: Standard. Follows from Krylov-Bogoliubov Theorem.
47 Invariant Distribution of the Limit Process Existence: Standard. Follows from Krylov-Bogoliubov Theorem. 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: the stochastic delay differential equation example in [Hairer et. al. 11].
48 Invariant Distribution of the Limit Process Existence: Standard. Follows from Krylov-Bogoliubov Theorem. 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: the stochastic delay differential equation example in [Hairer et. al. 11]. We invoke the asymptotic coupling method (Hairer, Mattingly, Sheutzow, Bakhtin, et al.)
49 Invariant Dist. of the Limit Process: Uniqueness Theorem (Hairer et. al 11, continuous version) Assume there exists a measurable set A Y with following 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 C(P [0, ) δ y, P [0, ) δỹ), such that Γ y,ỹ (D) > 0. Then {P t } has at most one invariant probability measure. y A ~ y
50 Invariant Dist. of the Limit Process: Uniqueness Theorem (Hairer et. al 11, continuous version) Assume there exists a measurable set A Y with following 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 C(P [0, ) δ y, P [0, ) δỹ), such that Γ y,ỹ (D) > 0. Then {P t } has at most one invariant probability measure. To prove the uniqueness of the inv. dist. for a Markov kernel P: Specify the subset A. For y, ỹ A, construct (Y y, Ỹ ỹ) on a common probability space: verify the marginals of Y y and Ỹ ỹ. { show the asymptotic convergence: P d(y y (t), Ỹ ỹ(t)) } 0 > 0. Then Γ y,ỹ = Law(Y y, Ỹ ỹ) is a legitimate asymptotic coupling.
51 Invariant Dist. of the Limit Process: Uniqueness Theorem Under assumptions I, II and IV, the limit process has at most one invariant distribution. Proof idea. Let y = (x 0, z 0 ) and ỹ = ( x 0, ỹ 0 ). Recall X t = x 0 M t(1) + B t βt + t 0 Z s(0)ds, t 0, Z t(r) = z 0(t + r) M t(ψ t+r1) + ( Γ ) tk (r), r 0. Now define X t = x 0 M t(1) + B t βt + t 0 Z s(0)ds, t 0, Z t(r) = z 0(t + r) M t(ψ t+r1) + ( Γ t K) (r), r 0. where B t = B t + t 0 ( Z s(0) λ X s ) ds.
52 Invariant Dist. of the Limit Process: Uniqueness Define A = {(x, z) Y; x 0}. For every invariant distribution µ of P, µ(a) > 0.
53 Invariant Dist. of the Limit Process: Uniqueness Define A = {(x, z) Y; x 0}. For every invariant distribution µ of P, µ(a) > 0. Asymptotic Convergence: X t = x 0 e λt X t 0.
54 Invariant Dist. of the Limit Process: Uniqueness Define A = {(x, z) Y; x 0}. For every invariant distribution µ of P, µ(a) > 0. Asymptotic Convergence: X t = x 0 e λt X t 0. Lemma (2) When y, ỹ A, we have Z (0) L 2 Using Lemma 2, Z t 0 in H 1 (0, ). t t Z t(r) = z 0 (t+r)+ḡ(r) X t + Xs g(t+r s)ds Z s(0)ḡ(t+r s)ds. 0 0
55 Invariant Dist. of the Limit Process: Uniqueness Define A = {(x, z) Y; x 0}. For every invariant distribution µ of P, µ(a) > 0. Asymptotic Convergence: X t = x 0 e λt X t 0. Lemma (2) When y, ỹ A, we have Z (0) L 2 Using Lemma 2, Z t 0 in H 1 (0, ). t t Z t(r) = z 0 (t+r)+ḡ(r) X t + Xs g(t+r s)ds Z s(0)ḡ(t+r s)ds. 0 0 Distribution of Ỹ : By Girsanov Theorem, the distribution of B is equivalent to a Brownian motion. Novikov condition follows from Lemma 2. Ỹ P δỹ.
56 4. Convergence of Steady-State Distributions I. Process Level Convergence. III. Convergence of Stationary Dist? II. Unique Invariant Distribution Further Assumptions: III. ϱ. = sup{u [0, ), g = 0 a.e. on [a, a + u] for some a [0, )} <. IV. g has a density g and h 2 (x) =. g (x) is bounded. Ḡ(x) Theorem (Aghajani and R 13) Under assumptions I-IV and if G has a finite 3 + ɛ moment, the sequence {π (N) } converges weakly to the unique invariant distribution π of Y.
57 Convergence of Steady-State Distributions Proof sketch. Step 1. Under assumptions on G, the sequence {π (N) } of steady state distributions of pre-limit processes is tight in R H 1 (0, ). Proof idea: establish uniform bounds on (X (N), Z (N) ) in N, t, using results in [Gamarnik and Goldberg 13].
58 Convergence of Steady-State Distributions Proof sketch. Step 1. Under assumptions on G, the sequence {π (N) } of steady state distributions of pre-limit processes is tight in R H 1 (0, ). Proof idea: establish uniform bounds on (X (N), Z (N) ) in N, t, using results in [Gamarnik and Goldberg 13]. Step 2. Every subsequential limit of {π (N) } is an invariant distribution for the limit process Y.
59 Convergence of Steady-State Distributions Proof sketch. Step 1. Under assumptions on G, the sequence {π (N) } of steady state distributions of pre-limit processes is tight in R H 1 (0, ). Proof idea: establish uniform bounds on (X (N), Z (N) ) in N, t, using results in [Gamarnik and Goldberg 13]. Step 2. Every subsequential limit of {π (N) } is an invariant distribution for the limit process Y. Step 3. Combine Steps 1 and 2. By uniqueness of invariant distribution for the limit process Y, we have our final result. Makes key use of the fact that Y is Markovian.
60 Summary and Conclusion Some subtleties Finding a more tractable representation conserved the Markov property of the diffusion limit been able to remove the problematic ν component Prove the uniqueness of invariant distribution for the inf. dim. limit process Our proposed asymptotic coupling scheme does not work.
61 Summary and Conclusion Some subtleties Finding a more tractable representation conserved the Markov property of the diffusion limit been able to remove the problematic ν component Prove the uniqueness of invariant distribution for the inf. dim. limit process 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 Our proposed asymptotic coupling scheme does not work.
62 Summary and Conclusion Some subtleties Finding a more tractable representation conserved the Markov property of the diffusion limit been able to remove the problematic ν component Prove the uniqueness of invariant distribution for the inf. dim. limit process 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 In our construction, A Y and therefore, the continuous-time version of Asymptotic Coupling theorem does not immediately follow from the discrete-time version. Our proposed asymptotic coupling scheme does not work.
63 5. What Else Can This be Used For? Seems to be a useful framework to do diffusion control (fluid version is done in [Atar-Kaspi-Shimkin 12]) Use generator to get error bounds for finite N ([Braverman-Dai] in finite dimension.) Characterization of invariant distribution using infinitesimal generator of the limit process and basic adjoint relation.
64 Characterization of Invariant Distribution Characterization of the generator L of the diffusion process Y. for f(x, z) = f(x, z(r 1 ),..., z(r n )) with f C 2 c(r n+1 ): Super-Critical region (X>0) X Sub-Critical region (X<0) Z
65 Characterization of Invariant Distribution Characterization of the generator L of the diffusion process Y. for f(x, z) = f(x, z(r 1 ),..., z(r n )) with f C 2 c(r n+1 ): Super-Critical region (X>0) X Sub-Critical region (X<0) Z L + and L are second order differential operators, whose explicit forms are known. L is the generator of an infinite-server queue. L + is the generator of the limit of a system composed of N decoupled closed queues.
66 Characterization of Invariant Distribution An Idea: analyze sub-critical and super-critical systems and identify ϕ + and ϕ which satisfy L ϕ = 0 and L ϕ = 0, respectively, then glue them together such that ϕ is smooth at the boundary. Super-Critical region (X>0) X Sub-Critical region (X<0) Z
67 Summary and Conclusion 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 infinite-dimensional processes Strengthened the Gamarnik-Goldberg tightness result to convergence of the X-marginal A wide range of service distributions satisfy our assumptions, including Log-Normal, Pareto (for certain parameters), Gamma, Phase-Type, etc. Weibull does not. Future challenges: Complete the characterization of the stationary distribution of the limit Markovian process. Extensions to more general systems
Asymptotic Coupling of an SPDE, with Applications to Many-Server Queues
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
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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informatione - c o m p a n i o n
OPERATIONS RESEARCH http://dx.doi.org/1.1287/opre.111.13ec e - c o m p a n i o n ONLY AVAILABLE IN ELECTRONIC FORM 212 INFORMS Electronic Companion A Diffusion Regime with Nondegenerate Slowdown by Rami
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 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 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 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 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 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 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 informationCross-Selling in a Call Center with a Heterogeneous Customer Population. Technical Appendix
Cross-Selling in a Call Center with a Heterogeneous Customer opulation Technical Appendix Itay Gurvich Mor Armony Costis Maglaras This technical appendix is dedicated to the completion of the proof of
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 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 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 informationState Space Representation of Gaussian Processes
State Space Representation of Gaussian Processes Simo Särkkä Department of Biomedical Engineering and Computational Science (BECS) Aalto University, Espoo, Finland June 12th, 2013 Simo Särkkä (Aalto University)
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 informationBeyond heavy-traffic regimes: Universal bounds and controls for the single-server (M/GI/1+GI) queue
1 / 33 Beyond heavy-traffic regimes: Universal bounds and controls for the single-server (M/GI/1+GI) queue Itai Gurvich Northwestern University Junfei Huang Chinese University of Hong Kong Stochastic Networks
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 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 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 informationConvergence to equilibrium for rough differential equations
Convergence to equilibrium for rough differential equations Samy Tindel Purdue University Barcelona GSE Summer Forum 2017 Joint work with Aurélien Deya (Nancy) and Fabien Panloup (Angers) Samy T. (Purdue)
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 informationReflected Brownian Motion
Chapter 6 Reflected Brownian Motion Often we encounter Diffusions in regions with boundary. If the process can reach the boundary from the interior in finite time with positive probability we need to decide
More informationExact Simulation of the Stationary Distribution of M/G/c Queues
1/36 Exact Simulation of the Stationary Distribution of M/G/c Queues Professor Karl Sigman Columbia University New York City USA Conference in Honor of Søren Asmussen Monday, August 1, 2011 Sandbjerg Estate
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 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 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 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 informationThe Performance Impact of Delay Announcements
The Performance Impact of Delay Announcements Taking Account of Customer Response IEOR 4615, Service Engineering, Professor Whitt Supplement to Lecture 21, April 21, 2015 Review: The Purpose of Delay Announcements
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 informationTime Reversibility and Burke s Theorem
Queuing Analysis: Time Reversibility and Burke s Theorem Hongwei Zhang http://www.cs.wayne.edu/~hzhang Acknowledgement: this lecture is partially based on the slides of Dr. Yannis A. Korilis. Outline Time-Reversal
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 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 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 informationStochastic Volatility and Correction to the Heat Equation
Stochastic Volatility and Correction to the Heat Equation Jean-Pierre Fouque, George Papanicolaou and Ronnie Sircar Abstract. From a probabilist s point of view the Twentieth Century has been a century
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 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 informationInformation and Credit Risk
Information and Credit Risk M. L. Bedini Université de Bretagne Occidentale, Brest - Friedrich Schiller Universität, Jena Jena, March 2011 M. L. Bedini (Université de Bretagne Occidentale, Brest Information
More informationMoments of the maximum of the Gaussian random walk
Moments of the maximum of the Gaussian random walk A.J.E.M. Janssen (Philips Research) Johan S.H. van Leeuwaarden (Eurandom) Model definition Consider the partial sums S n = X 1 +... + X n with X 1, X,...
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 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 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 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 informationLecturer: Olga Galinina
Renewal models Lecturer: Olga Galinina E-mail: olga.galinina@tut.fi Outline Reminder. Exponential models definition of renewal processes exponential interval distribution Erlang distribution hyperexponential
More informationIEOR 6711, HMWK 5, Professor Sigman
IEOR 6711, HMWK 5, Professor Sigman 1. Semi-Markov processes: Consider an irreducible positive recurrent discrete-time Markov chain {X n } with transition matrix P (P i,j ), i, j S, and finite state space.
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 informationProperties of an infinite dimensional EDS system : the Muller s ratchet
Properties of an infinite dimensional EDS system : the Muller s ratchet LATP June 5, 2011 A ratchet source : wikipedia Plan 1 Introduction : The model of Haigh 2 3 Hypothesis (Biological) : The population
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 informationAsymptotics for Polling Models with Limited Service Policies
Asymptotics for Polling Models with Limited Service Policies Woojin Chang School of Industrial and Systems Engineering Georgia Institute of Technology Atlanta, GA 30332-0205 USA Douglas G. Down Department
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 informationA Fluid Approximation for Service Systems Responding to Unexpected Overloads
OPERATIONS RESEARCH Vol. 59, No. 5, September October 2011, pp. 1159 1170 issn 0030-364X eissn 1526-5463 11 5905 1159 http://dx.doi.org/10.1287/opre.1110.0985 2011 INFORMS A Fluid Approximation for Service
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 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 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 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 informationExistence, Uniqueness and Stability of Invariant Distributions in Continuous-Time Stochastic Models
Existence, Uniqueness and Stability of Invariant Distributions in Continuous-Time Stochastic Models Christian Bayer and Klaus Wälde Weierstrass Institute for Applied Analysis and Stochastics and University
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 informationPROBABILITY: LIMIT THEOREMS II, SPRING HOMEWORK PROBLEMS
PROBABILITY: LIMIT THEOREMS II, SPRING 218. HOMEWORK PROBLEMS PROF. YURI BAKHTIN Instructions. You are allowed to work on solutions in groups, but you are required to write up solutions on your own. Please
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 informationUniversity of Toronto Department of Statistics
Norm Comparisons for Data Augmentation by James P. Hobert Department of Statistics University of Florida and Jeffrey S. Rosenthal Department of Statistics University of Toronto Technical Report No. 0704
More informationSTABILITY AND STRUCTURAL PROPERTIES OF STOCHASTIC STORAGE NETWORKS 1
STABILITY AND STRUCTURAL PROPERTIES OF STOCHASTIC STORAGE NETWORKS 1 by Offer Kella 2 and Ward Whitt 3 November 10, 1994 Revision: July 5, 1995 Journal of Applied Probability 33 (1996) 1169 1180 Abstract
More informationInterest Rate Models:
1/17 Interest Rate Models: from Parametric Statistics to Infinite Dimensional Stochastic Analysis René Carmona Bendheim Center for Finance ORFE & PACM, Princeton University email: rcarmna@princeton.edu
More informationMultiple Random Variables
Multiple Random Variables Joint Probability Density Let X and Y be two random variables. Their joint distribution function is F ( XY x, y) P X x Y y. F XY ( ) 1, < x
More informationFokker-Planck Equation with Detailed Balance
Appendix E Fokker-Planck Equation with Detailed Balance A stochastic process is simply a function of two variables, one is the time, the other is a stochastic variable X, defined by specifying: a: the
More informationThe G t /GI/s t + GI Many-Server Fluid Queue: Longer Online Version with Appendix
Queueing Systems manuscript No. (will be inserted by the editor) January 4, 22 The G t /GI/s t + GI Many-Server Fluid Queue: Longer Online Version with Appendix Yunan Liu Ward Whitt Received: date / Accepted:
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 informationec1 e-companion to Liu and Whitt: Stabilizing Performance
ec1 This page is intentionally blank. Proper e-companion title page, with INFORMS branding and exact metadata of the main paper, will be produced by the INFORMS office when the issue is being assembled.
More informationarxiv:math/ v4 [math.pr] 12 Apr 2007
arxiv:math/612224v4 [math.pr] 12 Apr 27 LARGE CLOSED QUEUEING NETWORKS IN SEMI-MARKOV ENVIRONMENT AND ITS APPLICATION VYACHESLAV M. ABRAMOV Abstract. The paper studies closed queueing networks containing
More informationAsymptotics for posterior hazards
Asymptotics for posterior hazards Pierpaolo De Blasi University of Turin 10th August 2007, BNR Workshop, Isaac Newton Intitute, Cambridge, UK Joint work with Giovanni Peccati (Université Paris VI) and
More informationMathematical Methods for Neurosciences. ENS - Master MVA Paris 6 - Master Maths-Bio ( )
Mathematical Methods for Neurosciences. ENS - Master MVA Paris 6 - Master Maths-Bio (2014-2015) Etienne Tanré - Olivier Faugeras INRIA - Team Tosca November 26th, 2014 E. Tanré (INRIA - Team Tosca) Mathematical
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 informationMATH 56A: STOCHASTIC PROCESSES CHAPTER 6
MATH 56A: STOCHASTIC PROCESSES CHAPTER 6 6. Renewal Mathematically, renewal refers to a continuous time stochastic process with states,, 2,. N t {,, 2, 3, } so that you only have jumps from x to x + and
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 informationThe Moment Method; Convex Duality; and Large/Medium/Small Deviations
Stat 928: Statistical Learning Theory Lecture: 5 The Moment Method; Convex Duality; and Large/Medium/Small Deviations Instructor: Sham Kakade The Exponential Inequality and Convex Duality The exponential
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 informationAdvanced Computer Networks Lecture 2. Markov Processes
Advanced Computer Networks Lecture 2. Markov Processes Husheng Li Min Kao Department of Electrical Engineering and Computer Science University of Tennessee, Knoxville Spring, 2016 1/28 Outline 2/28 1 Definition
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 informationChapter 3 Balance equations, birth-death processes, continuous Markov Chains
Chapter 3 Balance equations, birth-death processes, continuous Markov Chains Ioannis Glaropoulos November 4, 2012 1 Exercise 3.2 Consider a birth-death process with 3 states, where the transition rate
More informationNEW FRONTIERS IN APPLIED PROBABILITY
J. Appl. Prob. Spec. Vol. 48A, 209 213 (2011) Applied Probability Trust 2011 NEW FRONTIERS IN APPLIED PROBABILITY A Festschrift for SØREN ASMUSSEN Edited by P. GLYNN, T. MIKOSCH and T. ROLSKI Part 4. Simulation
More information57:022 Principles of Design II Final Exam Solutions - Spring 1997
57:022 Principles of Design II Final Exam Solutions - Spring 1997 Part: I II III IV V VI Total Possible Pts: 52 10 12 16 13 12 115 PART ONE Indicate "+" if True and "o" if False: + a. If a component's
More information