Many useful applications, especially in queueing systems, inventory management, and reliability analysis. A connection between discrete time Markov chains.

Slides:



Advertisements
Similar presentations
Exponential Distribution
Advertisements

ST3236: Stochastic Process Tutorial 9
Let X 1, X 2,..., X n be a set of independent random variables having a common distribution, and let E[ X i ] = . then, with probability 1 Strong law.
Exponential and Poisson Chapter 5 Material. 2 Poisson Distribution [Discrete] Poisson distribution describes many random processes quite well and is mathematically.
Exponential Distribution
1 Continuous random variables Continuous random variable Let X be such a random variable Takes on values in the real space  (-infinity; +infinity)  (lower.
E&CE 418: Tutorial-4 Instructor: Prof. Xuemin (Sherman) Shen
Exponential Distribution. = mean interval between consequent events = rate = mean number of counts in the unit interval > 0 X = distance between events.
Continuous-Time Markov Chains Nur Aini Masruroh. LOGO Introduction  A continuous-time Markov chain is a stochastic process having the Markovian property.
INDR 343 Problem Session
TCOM 501: Networking Theory & Fundamentals
1 Part III Markov Chains & Queueing Systems 10.Discrete-Time Markov Chains 11.Stationary Distributions & Limiting Probabilities 12.State Classification.
Continuous Time Markov Chains and Basic Queueing Theory
Stochastic Processes Dr. Nur Aini Masruroh. Stochastic process X(t) is the state of the process (measurable characteristic of interest) at time t the.
Lecture 13 – Continuous-Time Markov Chains
Introduction to stochastic process
Engineering Probability and Statistics - SE-205 -Chap 4 By S. O. Duffuaa.
Performance analysis for high speed switches Lecture 6.
Chapter 4: Stochastic Processes Poisson Processes and Markov Chains
Queueing Theory: Part I
Probability theory 2011 Outline of lecture 7 The Poisson process  Definitions  Restarted Poisson processes  Conditioning in Poisson processes  Thinning.
Continuous Random Variables and Probability Distributions
7/3/2015© 2007 Raymond P. Jefferis III1 Queuing Systems.
Lecture 4 Mathematical and Statistical Models in Simulation.
Introduction to Stochastic Models GSLM 54100
4-1 Continuous Random Variables 4-2 Probability Distributions and Probability Density Functions Figure 4-1 Density function of a loading on a long,

Chapter 4. Continuous Probability Distributions
Lecture 7  Poisson Processes (a reminder)  Some simple facts about Poisson processes  The Birth/Death Processes in General  Differential-Difference.
Exponential Distribution & Poisson Process
1 Exponential Distribution & Poisson Process Memorylessness & other exponential distribution properties; Poisson process and compound P.P.’s.
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.
Exponential and Chi-Square Random Variables
Copyright ©: Nahrstedt, Angrave, Abdelzaher, Caccamo1 Queueing Systems.
Generalized Semi-Markov Processes (GSMP)
Intro. to Stochastic Processes
Stochastic Models Lecture 2 Poisson Processes
Queuing Theory Basic properties, Markovian models, Networks of queues, General service time distributions, Finite source models, Multiserver queues Chapter.
1 Queuing Models Dr. Mahmoud Alrefaei 2 Introduction Each one of us has spent a great deal of time waiting in lines. One example in the Cafeteria. Other.
1 Birth and death process N(t) Depends on how fast arrivals or departures occur Objective N(t) = # of customers at time t. λ arrivals (births) departures.
Generalized Semi- Markov Processes (GSMP). Summary Some Definitions The Poisson Process Properties of the Poisson Process  Interarrival times  Memoryless.
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.
School of Information Technologies Poisson-1 The Poisson Process Poisson process, rate parameter e.g. packets/second Three equivalent viewpoints of the.
Winter 2004EE384x1 Poisson Process Review Session 2 EE384X.
4.3 More Discrete Probability Distributions NOTES Coach Bridges.
Random Variables Example:
Stochastic Processes1 CPSC : Stochastic Processes Instructor: Anirban Mahanti Reference Book “Computer Systems Performance.
 Recall your experience when you take an elevator.  Think about usually how long it takes for the elevator to arrive.  Most likely, the experience.
CS433 Modeling and Simulation Lecture 11 Continuous Markov Chains Dr. Anis Koubâa 01 May 2009 Al-Imam Mohammad Ibn Saud University.
From DeGroot & Schervish. Example Occupied Telephone Lines Suppose that a certain business office has five telephone lines and that any number of these.
Let E denote some event. Define a random variable X by Computing probabilities by conditioning.
Renewal Theory Definitions, Limit Theorems, Renewal Reward Processes, Alternating Renewal Processes, Age and Excess Life Distributions, Inspection Paradox.
The Poisson probability distribution
Probability Distributions: a review
Engineering Probability and Statistics - SE-205 -Chap 4
The Exponential and Gamma Distributions
Exponential Distribution & Poisson Process
The Poisson Process.
Basic Modeling Components
Pertemuan ke-7 s/d ke-10 (minggu ke-4 dan ke-5)
V5 Stochastic Processes
Multinomial Distribution
ECE 358 Examples #1 Xuemin (Sherman) Shen Office: EIT 4155
CPSC 531: System Modeling and Simulation
Random Variables A random variable is a rule that assigns exactly one value to each point in a sample space for an experiment. A random variable can be.
Poisson Process and Related Distributions
CS723 - Probability and Stochastic Processes
PROBABILITY AND STATISTICS
Presentation transcript:

Many useful applications, especially in queueing systems, inventory management, and reliability analysis. A connection between discrete time Markov chains and continuous time Markov chains. Exponential distribution and the Poisson process

The exponential distribution

The memoryless property

 Exponentially distributed random variables are memoryless.

It can be shown that the exponential distribution is the only distribution that has the memoryless property.

Example 1: The amount of time one spends in a bank is exponentially distributed with mean ten minutes ( = 1/10). What is the probability that a customer spends more than 15 minutes? What is the probability that the customer spends more than 15 minutes given that she is in the bank after 10 minutes?

Example 2: Consider a branch of a bank with two agents serving customers. The time an agent takes with a customer is exponentially distributed with mean 1/. A customer enters and finds the two agents busy serving two other customers. What is the probability that the customer that just entered would be last to leave?

Suppose that X 1, X 2,..., X n are independent exponential random variables, with X i having rate  i, i =1,..., n. What is P( min( X 1, X 2,..., X n )> x )? The minimum of n exponentially distributed random variables

Suppose that X 1, X 2,..., X n are independent exponential random variables, with X i having rate  i, i =1,..., n. What is P( min( X 1, X 2,..., X n )> x )? The minimum of n exponentially distributed random variables

Suppose that X 1 and X 2 are independent exponentially distributed random variables with rates 1 and 2. What is P(X 1 < X 2 )? Comparing two exponentially distributed random variables

Suppose that X 1 and X 2 are independent exponentially distributed random variables with rates 1 and 2. What is P(X 1 < X 2 )? Comparing two exponentially distributed random variables

Suppose that X 1 and X 2 are independent exponential random variables with rates 1 = 2 =. What is the distribution of f X 1 +X 2 ( x )?)? The sum of 2 identical exponentially distributed random variables

Suppose that X 1 and X 2 are independent exponential random variables with rates 1 = 2 =. What is the distribution of f X 1 +X 2 ( x )? The sum of 2 identical exponentially distributed random variables

Suppose that X 1,..., X N are independent exponential random variables with rates i = for i =1,..., n. What is the distribution of f X X n ( x )?  X 1,..., X N has the gamma distribution with parameters n and. The sum of n identical exponentially distributed random variables

Suppose that X 1 and X 2 are independent exponential random variables with rates 1 ≠ 2. What is the distribution of f X 1 +X 2 ( x )? The sum of 2 exponentially distributed random variables

Suppose that X 1 and X 2 are independent exponential random variables with rates 1 ≠ 2. What is the distribution of f X 1 +X 2 ( x )? The sum of 2 exponentially distributed random variables

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 by time t (i.e., in the time interval [0, t ]). Counting Processes

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 by time t (i.e., in the time interval [0, t ]). Example 1: N ( t ) is the number of customers that enter a store at or prior to time t. An event corresponds to a person entering the store. Counting Processes

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 by time t (i.e., in the time interval [0, t ]). Example 1: N ( t ) is the number of customers that enter a store at or prior to time t. An event corresponds to a person entering the store. Example 2: N ( t ) is the number of individuals born at or prior to time t. An event occurs whenever a child is born. Counting Processes

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 by time t (i.e., in the time interval [0, t ]). Example 1: N ( t ) is the number of customers that enter a store at or prior to time t. An event corresponds to a person entering the store. Example 2: N ( t ) is the number of individuals born at or prior to time t. An event occurs whenever a child is born. Example 3: N ( t ) is the number of calls made to a technical help line at or prior to time t. An event occurs whenever a call is placed. Counting Processes

A counting process satisfies the following properties. (i) N ( t ) ≥ 0. (ii) N ( t ) is integer valued. (iii) If s < t, then N ( s ) ≤ N ( t ). (iv) For s < t, N ( t ) – N ( s ) equals the number of events that occurs in the time interval ( s, t ]. Properties of counting processes

A counting process is said to possess independent increments if the number of events that occur in disjoint intervals are independent.

Example 1: The number of customers N (10) that enter the store in the interval [0, 10] is independent from the number of customers N (15) – N (10) that enter the store in the interval (10, 15].

A counting process is said to possess independent increments if the number of events that occur in disjoint intervals are independent. Example 1: The number of customers N (10) that enter the store in the interval [0, 10] is independent from the number of customers N (15) – N (10) that enter the store in the interval (10, 15]. Example 2: The number of individuals N (10) born in the interval [1996, 2000] is not independent from the number of individuals N (2004) – N (2000) that enter the store in the interval (2000, 2004].

A counting process is said to possess stationary increments if the distribution of the number of events that occur in an interval depend only on the length of the interval and not the starting time of the interval.

Example 1: The number of customers N ( t ) – N ( s ) that enter the store in the interval ( s, t ] does not depend on s (this is true if there is not a particular time of day where more customers enter the store).

The Poisson processes The counting process { N ( t ) t ≥ 0} is said to be a Poisson process having rate, > 0, if (i) N ( 0 ) = 0. (ii) The process has independent increments. (iii) The number of events in any interval of length t is Poisson distributed with mean t. That is for all s, t ≥ 0

The distribution of interarrival times Let T n describe the time that elapses between ( n -1)th event and the n th event for n > 1 and let T 1 be the time of the first event. The sequence { T n, n = 1, 2,...} is called the sequence of interarrival times.

The distribution of interarrival times Let T n describe the time that elapses between ( n -1)th event and the n th event for n > 1 and let T 1 be the time of the first event. The sequence { T n, n = 1, 2,...} is called the sequence of interarrival times. Example: if T 1 = 5 and T 2 = 10  the first event arrives at time t = 5 and event 2 occurs at time t = 15.

The distribution of interarrival times P ( T 1 > t ) = P(N(t ) = 0) = e - t  T 1 has the exponential distribution.

The distribution of interarrival times P ( T 1 > t ) = P(N(t ) = 0) = e - t  T 1 has the exponential distribution. P ( T 2 > t ) = E[ P ( T 2 > t|T 1 ) ] Since P ( T 2 > t|T 1 = s ) = P (0 events in ( s, s + t ]| T 1 = s ) = P (0 events in ( s, s + t ]) = e - t Then, P ( T 2 > t ) = E[ P ( T 2 > t|T 1 ) ] = e - t  T 2 has the exponential

The distribution of interarrival times P ( T 1 > t ) = P(N(t ) = 0) = e - t  T 1 has the exponential distribution. P ( T 2 > t ) = E[ P ( T 2 > t|T 1 ) ] Since P ( T 2 > t|T 1 = s ) = P (0 events in ( s, s + t ]| T 1 = s ) = P (0 events in ( s, s + t ]) = e - t Then, P ( T 2 > t ) = E[ P ( T 2 > t|T 1 ) ] = e - t  T 2 has the exponential The same applies to other values of n  T n has the exponential distribution.

The distribution of interarrival times Let T n denote the inter-arrival time between the ( n -1)th event and the n th event of a Poisson process, then the T n ( n =1, 2,...) are independent, identically distributed exponential random variables having mean 1/.