A gentle introduction to fluid and diffusion limits for queues Presented by: Varun Gupta April 12, 2006.

Slides:



Advertisements
Similar presentations
Random Processes Introduction (2)
Advertisements

Stationary Probability Vector of a Higher-order Markov Chain By Zhang Shixiao Supervisors: Prof. Chi-Kwong Li and Dr. Jor-Ting Chan.
Many useful applications, especially in queueing systems, inventory management, and reliability analysis. A connection between discrete time Markov chains.
Gibbs sampler - simple properties It’s not hard to show that this MC chain is aperiodic. Often is reversible distribution. If in addition the chain is.
Week11 Parameter, Statistic and Random Samples A parameter is a number that describes the population. It is a fixed number, but in practice we do not know.
Use of moment generating functions. Definition Let X denote a random variable with probability density function f(x) if continuous (probability mass function.
10 Further Time Series OLS Issues Chapter 10 covered OLS properties for finite (small) sample time series data -If our Chapter 10 assumptions fail, we.
STAT 497 APPLIED TIME SERIES ANALYSIS
Workshop on Stochastic Differential Equations and Statistical Inference for Markov Processes Day 1: January 19 th, Day 2: January 28 th Lahore University.
Introduction to stochastic process
4.7 Brownian Bridge 報告者 : 劉彥君 Gaussian Process Definition 4.7.1: A Gaussian process X(t), t ≥ 0, is a stochastic process that has the property.
1 17. Long Term Trends and Hurst Phenomena From ancient times the Nile river region has been known for its peculiar long-term behavior: long periods of.
From PET to SPLIT Yuri Kifer. PET: Polynomial Ergodic Theorem (Bergelson) preserving and weakly mixing is bounded measurable functions polynomials,integer.
3.3 Brownian Motion 報告者:陳政岳.
#9 SIMULATION OUTPUT ANALYSIS Systems Fall 2000 Instructor: Peter M. Hahn
4. Convergence of random variables  Convergence in probability  Convergence in distribution  Convergence in quadratic mean  Properties  The law of.
Parametric Inference.
1 A Generic Mean Field Convergence Result for Systems of Interacting Objects From Micro to Macro Jean-Yves Le Boudec, EPFL Joint work with David McDonald,
The moment generating function of random variable X is given by Moment generating function.
Queuing Networks: Burke’s Theorem, Kleinrock’s Approximation, and Jackson’s Theorem Wade Trappe.
Self-Similar through High-Variability: Statistical Analysis of Ethernet LAN Traffic at the Source Level Walter Willinger, Murad S. Taqqu, Robert Sherman,
Approximations to Probability Distributions: Limit Theorems.
1 10. Joint Moments and Joint Characteristic Functions Following section 6, in this section we shall introduce various parameters to compactly represent.
1 Chapters 9 Self-SimilarTraffic. Chapter 9 – Self-Similar Traffic 2 Introduction- Motivation Validity of the queuing models we have studied depends on.
References for M/G/1 Input Process
Simulation Output Analysis
Asaf Cohen Department of Mathematics University of Michigan Financial Mathematics Seminar University of Michigan September 10,
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  …
The Poisson Process. A stochastic process { N ( t ), t ≥ 0} is said to be a counting process if N ( t ) represents the total number of “events” that occur.
Limits and the Law of Large Numbers Lecture XIII.
Functions of Random Variables. Methods for determining the distribution of functions of Random Variables 1.Distribution function method 2.Moment generating.
Functions of Random Variables. Methods for determining the distribution of functions of Random Variables 1.Distribution function method 2.Moment generating.
PROBABILITY AND STATISTICS FOR ENGINEERING Hossein Sameti Department of Computer Engineering Sharif University of Technology The Weak Law and the Strong.
Yoni Nazarathy Gideon Weiss University of Haifa Yoni Nazarathy Gideon Weiss University of Haifa The Asymptotic Variance of the Output Process of Finite.
Queuing Theory Basic properties, Markovian models, Networks of queues, General service time distributions, Finite source models, Multiserver queues Chapter.
Borgan and Henderson:. Event History Methodology
Convergence in Distribution
Week11 Parameter, Statistic and Random Samples A parameter is a number that describes the population. It is a fixed number, but in practice we do not know.
1 Networks of queues Networks of queues reversibility, output theorem, tandem networks, partial balance, product-form distribution, blocking, insensitivity,
Security Markets VII Miloslav S. Vosvrda Teorie financnich trhu.
Generalized Semi- Markov Processes (GSMP). Summary Some Definitions The Poisson Process Properties of the Poisson Process  Interarrival times  Memoryless.
Week 21 Stochastic Process - Introduction Stochastic processes are processes that proceed randomly in time. Rather than consider fixed random variables.
Chapter 01 Probability and Stochastic Processes References: Wolff, Stochastic Modeling and the Theory of Queues, Chapter 1 Altiok, Performance Analysis.
Chapter 01 Probability and Stochastic Processes References: Wolff, Stochastic Modeling and the Theory of Queues, Chapter 1 Altiok, Performance Analysis.
ECE-7000: Nonlinear Dynamical Systems Overfitting and model costs Overfitting  The more free parameters a model has, the better it can be adapted.
Flows and Networks Plan for today (lecture 2): Questions? Birth-death process Example: pure birth process Example: pure death process Simple queue General.
The M/M/ N / N Queue etc COMP5416 Advanced Network Technologies.
Week 121 Law of Large Numbers Toss a coin n times. Suppose X i ’s are Bernoulli random variables with p = ½ and E(X i ) = ½. The proportion of heads is.
1 Probability and Statistical Inference (9th Edition) Chapter 5 (Part 2/2) Distributions of Functions of Random Variables November 25, 2015.
S TOCHASTIC M ODELS L ECTURE 4 P ART II B ROWNIAN M OTIONS Nan Chen MSc Program in Financial Engineering The Chinese University of Hong Kong (Shenzhen)
IMA Summer Program on Wireless Communications VoIP over a wired link Phil Fleming Network Advanced Technology Group Motorola, Inc.
1 EE571 PART 3 Random Processes Huseyin Bilgekul Eeng571 Probability and astochastic Processes Department of Electrical and Electronic Engineering Eastern.
Sampling Theory and Some Important Sampling Distributions.
Chapter 6 Product-Form Queuing Network Models Prof. Ali Movaghar.
Joint Moments and Joint Characteristic Functions.
Chapter 5 Sampling Distributions. Introduction Distribution of a Sample Statistic: The probability distribution of a sample statistic obtained from a.
1 Part Three: Chapters 7-9 Performance Modeling and Estimation.
Chapter 6 Large Random Samples Weiqi Luo ( 骆伟祺 ) School of Data & Computer Science Sun Yat-Sen University :
Flows and Networks Plan for today (lecture 3): Last time / Questions? Output simple queue Tandem network Jackson network: definition Jackson network: equilibrium.
Flows and Networks (158052) Richard Boucherie Stochastische Operations Research -- TW wwwhome.math.utwente.nl/~boucherierj/onderwijs/158052/ html.
Stochastic Process - Introduction
Theory of Capital Markets
水分子不時受撞,跳格子(c.p. 車行) 投骰子 (最穩定) 股票 (價格是不穏定,但報酬過程略穩定) 地震的次數 (不穩定)
Flows and Networks Plan for today (lecture 3):
Flows and Networks Plan for today (lecture 4):
CPSC 531: System Modeling and Simulation
Random WALK, BROWNIAN MOTION and SDEs
STOCHASTIC HYDROLOGY Random Processes
Random WALK, BROWNIAN MOTION and SDEs
Statistical Inference
Presentation transcript:

A gentle introduction to fluid and diffusion limits for queues Presented by: Varun Gupta April 12, 2006

Example : Tandem Queues Interarrival times at queue A are i.i.d. random variables Interarrival times at queue C are no more independent – they are ‘weakly’ dependent Very difficult to analyze queues with correlated input/service processes.

Example : Non-stationary Queues The arrival process fluctuates over a day – high load during day, low load during night Difficult to analyze queues with 2 environment states Numerical methods exist if the arrival process has certain Markovian properties Exact solutions for more complex environment processes are intractable

Example : Non-stationary Queues Observation: The soujorn times in environment states are much larger than the service and interarrival times Question: What is the limiting queue length distribution as the mean environment state sojourn times become infinity?

A model for non-stationary queues Define E, a reference environment process, as a random process taking values in {1,2,..,m}. E n are a family of slowly-changing environment process defined by time scaling E as N n  {N n (t): t  0} is the queue length process obtained by letting the system evolve as a GI/GI/1 queue with mean arrival rate 1/ i and mean service rate 1/  i when E n is in state i.

Fluid Approximation

The Functional SLLN X i : i.i.d. random variables with mean m, finite variance  2 Let Question: How does the plot of first n partial sums behave as n increases?

n=10

n=100

n=10000

The Functional SLLN Define the continuous parameter stochastic process Functional SLLN Note that while SLLN says that at each t, Y n (t) converges to mt, FSLLN says that entire sample paths of the sequences of stochastic processes Y n converge to the non-random process mt.

Fluid limit for the non-stationary queue Theorem : If then, where Y is the stochastic fluid process with environment process E, deterministic flow rate r i = i -  i in state i and initial content Y(0)=y.

Example: MMPP/M/1 queue Take the reference environment process, E, to be the following 2-state continuous time Markov chain In state H the queue behaves like an M/M/1 with service rate  and arrival rate H ( H >  ) In state L the queue behaves like an M/M/1 with service rate  and arrival rate L ( L <  ) Fluid limit:

n=10

n=100

n=1000

Problems with fluid limits

Functional Central Limit theorem Define the ‘centered’ partial sums of X i as Central Limit Theorem Define the continuous time process Question: How does Z n (t) behave as n increases?

n=100

n=1000

n=10000

n=1,000,000

Functional Central Limit theorem FCLT (Donsker’s Theorem) where B(t) is the standard Brownian motion (with drift coefficient 0 and diffusion coefficient 1) Brownian motion with drift coefficient  and diffusion coefficient  2 is a real valued stochastic process with stationary and independent increments having continuous sample paths where

Functional Central Limit theorem While CLT says that for any t, FCLT also shows that Z n (t) converges to an (a.s.) continuous stochastic process with independent increments. Note that just as CLT is a refinement of the SLLN, the FCLT is a refinement of the FSLLN and hence is more accurate.

Diffusion limit for the non-stationary queue Theorem: If then where Z is a zero-drift Brownian motion with diffusion coefficient  2 z depending on the limiting fluid process, Y, and environment process, E, as follows –If Y(t)=0, then  2 z = 0 –If Y(t)>0 and E(t)=I, then  2 z = i 3   i 2 +  i 3  Si 2

Diffusion limit for the non-stationary queue Proof: Lemma: Let X i be a sequence of positive random variables. Define Let denote the counting process with X i as the interarrival times. Then,

Diffusion limit for the non-stationary queue Proof contd. Using the lemma on last slide, the counting process of arrivals, V A n (t) in environment i converges to Similarly, the counting process for service completions converges to Taking the difference of the above Brownian motions gives the diffusion limit.

Some implications of fluid and diffusion limits 1.The fluid limits only depend on the means of the service and arrival processes. Therefore, the variability of the environment process affects the queues more than the variability of the arrival and service processes within each environment state. 2.The limiting distribution does not depends on moments higher than the second moments of arrival and service processes. 3.The fluid and diffusion limits still hold when the arrival and service processes are not i.i.d but weakly dependent. This is a consequence of the fact that FSLLN and FCLT hold under much weaker conditions.

Conclusions Fluid and Diffusion limits are powerful tools that produce asymptotically exact distributions by appropriately scaling time and/or space for otherwise intractable problems by stripping away unnecessary details of the statistical processes involved. Engineering Applications –Buffer Provisioning for Network Switches and Routers –Scheduling Service for Multiple Sources

Thank you! (Please register for Random Distance Run today! Early registration still on)