Economy of Scale in Multiserver Service Systems: A Retrospective. Ward Whitt. IEOR Department. Columbia University

Similar documents
ENGINEERING SOLUTION OF A BASIC CALL-CENTER MODEL

Lecture 9: Deterministic Fluid Models and Many-Server Heavy-Traffic Limits. IEOR 4615: Service Engineering Professor Whitt February 19, 2015

Erlang-C = M/M/N. agents. queue ACD. arrivals. busy ACD. queue. abandonment BACK FRONT. lost calls. arrivals. lost calls

Class 11 Non-Parametric Models of a Service System; GI/GI/1, GI/GI/n: Exact & Approximate Analysis.

SENSITIVITY OF PERFORMANCE IN THE ERLANG-A QUEUEING MODEL TO CHANGES IN THE MODEL PARAMETERS

IEOR 6711: Stochastic Models I, Fall 2003, Professor Whitt. Solutions to Final Exam: Thursday, December 18.

The Performance Impact of Delay Announcements

Non Markovian Queues (contd.)

Designing a Telephone Call Center with Impatient Customers

What You Should Know About Queueing Models To Set Staffing Requirements in Service Systems

Dynamic Control of Parallel-Server Systems

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 "

BRAVO for QED Queues

Performance Evaluation of Queuing Systems

P (L d k = n). P (L(t) = n),

Introduction to queuing theory

Making Delay Announcements

IEOR 8100: Topics in OR: Asymptotic Methods in Queueing Theory. Fall 2009, Professor Whitt. Class Lecture Notes: Wednesday, September 9.

A Diffusion Approximation for the G/GI/n/m Queue

Stochastic Models 3 (1998)

Design, staffing and control of large service systems: The case of a single customer class and multiple server types. April 2, 2004 DRAFT.

THE HEAVY-TRAFFIC BOTTLENECK PHENOMENON IN OPEN QUEUEING NETWORKS. S. Suresh and W. Whitt AT&T Bell Laboratories Murray Hill, New Jersey 07974

Link Models for Circuit Switching

ESTIMATING WAITING TIMES WITH THE TIME-VARYING LITTLE S LAW

Tales of Time Scales. Ward Whitt AT&T Labs Research Florham Park, NJ

Monotonicity Properties for Multiserver Queues with Reneging and Finite Waiting Lines

SENSITIVITY TO THE SERVICE-TIME DISTRIBUTION IN THE NONSTATIONARY ERLANG LOSS MODEL

Since D has an exponential distribution, E[D] = 0.09 years. Since {A(t) : t 0} is a Poisson process with rate λ = 10, 000, A(0.

On the Resource/Performance Tradeoff in Large Scale Queueing Systems

Classical Queueing Models.

A Robust Queueing Network Analyzer Based on Indices of Dispersion

Stationary remaining service time conditional on queue length

STAFFING A CALL CENTER WITH UNCERTAIN ARRIVAL RATE AND ABSENTEEISM

GI/M/1 and GI/M/m queuing systems

Electronic Companion Fluid Models for Overloaded Multi-Class Many-Server Queueing Systems with FCFS Routing

A DIFFUSION APPROXIMATION FOR THE G/GI/n/m QUEUE

TOWARDS BETTER MULTI-CLASS PARAMETRIC-DECOMPOSITION APPROXIMATIONS FOR OPEN QUEUEING NETWORKS

Overflow Networks: Approximations and Implications to Call-Center Outsourcing

SERVER STAFFING TO MEET TIME-VARYING DEMAND

Little s result. T = average sojourn time (time spent) in the system N = average number of customers in the system. Little s result says that

Queueing Review. Christos Alexopoulos and Dave Goldsman 10/6/16. (mostly from BCNN) Georgia Institute of Technology, Atlanta, GA, USA

Many-Server Loss Models with Non-Poisson Time-Varying Arrivals

REAL-TIME DELAY ESTIMATION BASED ON DELAY HISTORY IN MANY-SERVER SERVICE SYSTEMS WITH TIME-VARYING ARRIVALS

Efficient Algorithms for Higher-Order Derivatives of the Continued Erlang Delay Function

LIMITS AND APPROXIMATIONS FOR THE M/G/1 LIFO WAITING-TIME DISTRIBUTION

A Semi-parametric Bayesian Framework for Performance Analysis of Call Centers

BIRTH DEATH PROCESSES AND QUEUEING SYSTEMS

Periodic Load Balancing

An M/M/1/N Queuing system with Encouraged Arrivals

Single-Server Service-Station (G/G/1)

Appendix. A. Simulation study on the effect of aggregate data

DELAY PREDICTORS FOR CUSTOMER SERVICE SYSTEMS WITH TIME-VARYING PARAMETERS. Rouba Ibrahim Ward Whitt

Stabilizing Customer Abandonment in Many-Server Queues with Time-Varying Arrivals

LIMITS AND APPROXIMATIONS FOR THE BUSY-PERIOD DISTRIBUTION IN SINGLE-SERVER QUEUES

Queueing Systems: Lecture 3. Amedeo R. Odoni October 18, Announcements

Queueing Review. Christos Alexopoulos and Dave Goldsman 10/25/17. (mostly from BCNN) Georgia Institute of Technology, Atlanta, GA, USA

A Simple Solution for the M/D/c Waiting Time Distribution

HEAVY-TRAFFIC EXTREME-VALUE LIMITS FOR QUEUES

A Fluid Approximation for Service Systems Responding to Unexpected Overloads

Abandonment and Customers Patience in Tele-Queues. The Palm/Erlang-A Model.

The Offered-Load Process: Modeling, Inference and Applications. Research Thesis

Markovian N-Server Queues (Birth & Death Models)

M/G/1 and M/G/1/K systems

MODELING WEBCHAT SERVICE CENTER WITH MANY LPS SERVERS

Staffing many-server queues with impatient customers: constraint satisfaction in call centers

Analysis of a Two-Phase Queueing System with Impatient Customers and Multiple Vacations

A multi-class fluid model for a contact center with skill-based routing

Asymptotic Coupling of an SPDE, with Applications to Many-Server Queues

REAL-TIME DELAY ESTIMATION BASED ON DELAY HISTORY SUPPLEMENTARY MATERIAL

QUEUING MODELS AND MARKOV PROCESSES

PIECEWISE-LINEAR DIFFUSION PROCESSES

CS418 Operating Systems

Networking = Plumbing. Queueing Analysis: I. Last Lecture. Lecture Outline. Jeremiah Deng. 29 July 2013

Routing and Staffing in Large-Scale Service Systems: The Case of Homogeneous Impatient Customers and Heterogeneous Servers

Computer Networks More general queuing systems

2 light traffic derivatives for the GI/G/ queue. We shall see that our proof of analyticity is mainly based on some recursive formulas very similar to

J. MEDHI STOCHASTIC MODELS IN QUEUEING THEORY

On Approximations for the GI/GI/1 Queue and Generalized Jackson Open Queueing Networks Using Indices of Dispersion

Load Balancing in Distributed Service System: A Survey

A STAFFING ALGORITHM FOR CALL CENTERS WITH SKILL-BASED ROUTING: SUPPLEMENTARY MATERIAL

The Offered-Load Process: Modeling, Inference and Applications. Research Thesis

Exercises Stochastic Performance Modelling. Hamilton Institute, Summer 2010

ec1 e-companion to Liu and Whitt: Stabilizing Performance

Chapter 5: Special Types of Queuing Models

Routing and Staffing in Large-Scale Service Systems: The Case of Homogeneous Impatient Customers and Heterogeneous Servers 1

Stein s Method for Steady-State Approximations: Error Bounds and Engineering Solutions

Introduction to queuing theory

STEADY-STATE PROBABILITIES FOR SOME QUEUEING SYSTEMS: Part II

Figure 10.1: Recording when the event E occurs

A Vacation Queue with Additional Optional Service in Batches

Stochastic grey-box modeling of queueing systems: fitting birth-and-death processes to data

Blind Fair Routing in Large-Scale Service Systems with Heterogeneous Customers and Servers

New Perspectives on the Erlang-A Queue

A Regression Analysis Approach to Queueing System Modelling: a Case of Banks

On Priority Queues with Impatient Customers: Stationary and Time-Varying Analysis

All models are wrong / inaccurate, but some are useful. George Box (Wikipedia). wkc/course/part2.pdf

Queues with Many Servers and Impatient Customers

Modeling Service Networks with Time-Varying Demand

Service Level Agreements in Call Centers: Perils and Prescriptions

A First Passage Time Problem for Spectrally Positive Lévy Processes and Its Application to a Dynamic Priority Queue

Transcription:

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. In The Life and Works of A. K. Erlang, E. Brockmeyer, H. L. Halstrom and A. Jensen (editors), Danish Academy of Technical Sciences, Copenhagen, 1948. S. Halfin and W. Whitt (1981) Heavy-traffic limits for queues with many exponential servers. Operations Research 29, 567-588. D. R. Smith and W. Whitt (1981) Resource sharing for efficiency in traffic systems. The Bell System Technical Journal 60, 39-55. 2

Engineering for Services T. Levitt (1972) Production-line approach to service. Harvard Business Review, September-October, 41-52. 3

Customer Contact Centers Telephone Call Centers e-contact N. Gans, G. Koole and A. Mandelbaum (2002) Telephone call centers: a tutorial and literature review. Manufacturing and Service Operations Management (M&SOM), to appear. 4

Economy of Scale Qualitative Bigger is Better Quantitative Bigger is How Much Better? 5

Erlang Loss and Delay Models The M/M/s/0 and M/M/s/ Models Parameters λ = arrival rate µ = service rate s = number of servers a = λ/µ = offered load ρ = a/s = traffic intensity 6

Erlang Loss Formula steady-state blocking probability B(s, λ, µ) = B(s, a) = a s /s! k=s k=0 ak /k! truncated Poisson distribution B(s, a) = ab(s, a) s + ab(s 1, a), where B(0, a) = 1 and a = λ/µ. recursion for efficient computation 7

Erlang Delay Formula steady-state delay probability i.e., probability an arrival must wait before beginning service C(s, λ, µ) = C(s, a) = B(s, a) 1 ρ + ρb(s, a) expected steady-state waiting time: 1 EW (s, λ, µ) = C(s, a) µ(1 ρ) (Can start from B(s, a)). 8

Economy of Scale Qualitative Bigger is Better Quantitative Bigger is How Much Better? 9

Qualitative Economy of Scale B(s 1 + s 2, λ 1 + λ 2, µ) λ 1 λ 1 + λ 2 B(s 1, λ 1, µ) + λ 2 λ 1 + λ 2 B(s 2, λ 2, µ) C(s 1 + s 2, λ 1 + λ 2, µ) λ 1 λ 1 + λ 2 C(s 1, λ 1, µ) + λ 2 λ 1 + λ 2 C(s 2, λ 2, µ) EW (s 1 + s 2, λ 1 + λ 2, µ) λ 1 λ 1 + λ 2 EW (s 1, λ 1, µ) + λ 2 λ 1 + λ 2 EW (s 2, λ 2, µ) D. R. Smith and W. Whitt (1981) 10

Qualitative Economy of Scale: Short Proofs The same argument works for all three. One-dimensional monotonicity: Convexity in s: B(ts, ta) is decreasing in t. B( λ 1s 1 + λ 2 s 2 λ 1 + λ 2, a) λ 1 λ 1 + λ 2 B(s 1, a) + λ 2 λ 1 + λ 2 B(s 2, a) for 0 < λ i <, i = 1, 2. Jagers and van Doorn (1986, 1991) 11

Qualitative Economy of Scale: Short Proofs Need to extend B(s, a) to all real positive s: 1 B(s, a) = a Jagerman (1974) Use to prove: 0 (1 + t) s e at dt one-dimensional monotonicity convexity in real s. 12

Qualitative Economy of Scale: Short Proofs The same argument works for all three (B, C and EW ). B(s 1 + s 2, λ 1 + λ 2, µ) + + ( ) λ 1 λ1 + λ B 2 s λ 1 + λ 2 λ 1, λ 1 + λ 2, µ ( 1 ) λ 2 λ1 + λ B 2 s λ 1 + λ 2 λ 2, λ 1 + λ 2, µ 2 λ 1 B (s λ 1 + λ 1, λ 1 + λ 2, µ) 2 λ 2 B (s λ 1 + λ 2, λ 1 + λ 2, µ). 2 Use convexity in step 1. Use one-dimensional monotonicity in step 2. 13

Stochastic-Comparison Proof: Loss Model Little s Law: L = λw EQ(s, λ, µ) = λ(1 B(s, λ, µ))µ 1 or, equivalently, so that λb(s, λ, µ) = λ µeq(s, λ, µ), (λ 1 + λ 2 )B(s 1 + s 2, λ 1 + λ 2, µ) λ 1 B(s 1, λ 1, µ) + λ 2 B(s 2, λ 2, µ) if and only if EQ(s 1 + s 2, λ 1 + λ 2, µ) EQ(s 1, λ 1, µ) + EQ(s 2, λ 2, µ) Suffices to show: EQ 1+2 EQ 1 + EQ 2 14

Stochastic-Comparison Proof: Delay Model Little s Law: L = λw or, equivalently, so that EQ(s, λ, µ) = λ(ew (s, λ, µ) + µ 1 ) λew (s, λ, µ) = EQ(s, λ, µ) λµ 1, (λ 1 + λ 2 )EW (s 1 + s 2, λ 1 + λ 2, µ) λ 1 EW (s 1, λ 1, µ) + λ 2 EW (s 2, λ 2, µ) if and only if EQ(s 1 + s 2, λ 1 + λ 2, µ) EQ(s 1, λ 1, µ) + EQ(s 2, λ 2, µ). Suffices to show: EQ 1+2 EQ 1 + EQ 2 15

Stochastic-Comparison Proofs: Summary By Little s Law, L = λw, we need to show: For Loss Model, EQ 1+2 EQ 1 + EQ 2 For Delay Model, EQ 1+2 EQ 1 + EQ 2 We establish stronger results: For Loss Model, Q 1+2 st Q 1 + Q 2 For Delay Model, Q 1+2 st Q 1 + Q 2 stochastic order: X st Y if Ef(X) Ef(Y ) for all nondecreasing real-valued functions f. 16

We show: Stronger Stochastic Comparisons For Loss Model, Q 1+2 st Q 1 + Q 2 For Delay Model, Q 1+2 st Q 1 + Q 2 by establishing two stronger comparisons: likelihood-ratio ordering, r (M/M/s/ ) X r Y if P (X=k+1) P (X=k) P (Y =k+1) P (Y =k) sample-path stochastic order, st for all k. (A/GI/s/ ) {X(t) : t 0} st {Y (t) : t 0} if E[f({X(t) : t 0})] E[f({Y (t) : t 0})] for all nondecreasing real-valued functions f. 17

Economy of Scale Qualitative Bigger is Better Quantitative Bigger is How Much Better? 18

Quantitative Economy of Scale Perform asymptotics as a and s. Heavy Traffic: ρ = a/s 1 with (1 ρ) s β for < β <. Square-Root Safety Factor We should have s a + c a for c = c(β). known by Erlang (1924) 19

Quantitative Economy of Scale: Loss Model As a, B(a + c a, a) = ( ) ( ) 1 φ(c) a Φ(c) + O ( ) 1 a Erlang (1924), Jagerman (1974) Φ(x) = P (N(0, 1) x), normal cdf φ normal density, Φ(x) = x φ(u) du 20

Quantitative Economy of Scale: Delay Model As a (or λ with µ fixed), C(a + c a, a) = [ ] (1 Φ(c)) 1 1 + c + O φ(c) ( 1 a ) Erlang (1924), Halfin and Whitt (1981) EW (λ+c λ, λ, 1) = ( ) [ ] c (1 Φ(c)) 1 1 + c + O a φ(c) ( ) 1 a Erlang (1924), Halfin and Whitt (1981) Φ(x) = P (N(0, 1) x), normal cdf φ normal density, Φ(x) = x φ(u) du 21

As a and s Stochastic-Process Limit with (1 ρ) s β for < β <, Q a (t) a a L(t), where L is a diffusion process. (convergence for stochastic processes) 22

Recent Work Halfin and Whitt did stochastic-process limit for GI/M/s/. Now extend from GI/M/s/ to G/H /s/ http://www.research.att.com/ wow