Stochastic Processes1 CPSC 601.43: Stochastic Processes Instructor: Anirban Mahanti Reference Book “Computer Systems Performance.

Slides:



Advertisements
Similar presentations
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.
Advertisements

Many useful applications, especially in queueing systems, inventory management, and reliability analysis. A connection between discrete time Markov chains.
March 31, 2015Applied Discrete Mathematics Week 8: Advanced Counting 1 Discrete Probability Example I: A die is biased so that the number 3 appears twice.
1 Chapter 5 Continuous time Markov Chains Learning objectives : Introduce continuous time Markov Chain Model manufacturing systems using Markov Chain Able.
Flipping an unfair coin three times Consider the unfair coin with P(H) = 1/3 and P(T) = 2/3. If we flip this coin three times, the sample space S is the.
Lectures prepared by: Elchanan Mossel Yelena Shvets Introduction to probability Stat 134 FAll 2005 Berkeley Follows Jim Pitman’s book: Probability Section.
Stochastic Processes Dr. Nur Aini Masruroh. Stochastic process X(t) is the state of the process (measurable characteristic of interest) at time t the.
Introduction to stochastic process
CSE 221: Probabilistic Analysis of Computer Systems Topics covered: Discrete random variables Probability mass function Distribution function (Secs )
Chapter 4: Stochastic Processes Poisson Processes and Markov Chains
CSE 221: Probabilistic Analysis of Computer Systems Topics covered: Course outline and schedule Introduction Event Algebra (Sec )
Probability theory 2011 Outline of lecture 7 The Poisson process  Definitions  Restarted Poisson processes  Conditioning in Poisson processes  Thinning.
A random variable that has the following pmf is said to be a binomial random variable with parameters n, p The Binomial random variable.
CSE 221: Probabilistic Analysis of Computer Systems Topics covered: Course outline and schedule Introduction (Sec )
The moment generating function of random variable X is given by Moment generating function.
CSE 221: Probabilistic Analysis of Computer Systems Topics covered: Special discrete distributions Sec
C4: DISCRETE RANDOM VARIABLES CIS 2033 based on Dekking et al. A Modern Introduction to Probability and Statistics Longin Jan Latecki.
CSE 221: Probabilistic Analysis of Computer Systems Topics covered: Stochastic processes Bernoulli and Poisson processes (Sec. 6.1,6.3.,6.4)
Introduction to Stochastic Models GSLM 54100
Exponential Distribution & Poisson Process
1 Exponential Distribution & Poisson Process Memorylessness & other exponential distribution properties; Poisson process and compound P.P.’s.
Prof. SankarReview of Random Process1 Probability Sample Space (S) –Collection of all possible outcomes of a random experiment Sample Point –Each outcome.
McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies, Inc. All rights reserved. Discrete Random Variables Chapter 4.
General information CSE : Probabilistic Analysis of Computer Systems
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.
CPSC 531: Probability Review1 CPSC 531:Distributions Instructor: Anirban Mahanti Office: ICT Class Location: TRB 101.
Generalized Semi-Markov Processes (GSMP)
Modeling and Simulation CS 313
Intro. to Stochastic Processes
CPSC 531: Probability Review1 CPSC 531:Probability & Statistics: Review Instructor: Anirban Mahanti Office: ICT Class.
Random Variables. A random variable X is a real valued function defined on the sample space, X : S  R. The set { s  S : X ( s )  [ a, b ] is an event}.
Copyright © 2010 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin Chapter 5 Discrete Random Variables.
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.
2.1 Introduction In an experiment of chance, outcomes occur randomly. We often summarize the outcome from a random experiment by a simple number. Definition.
Generalized Semi- Markov Processes (GSMP). Summary Some Definitions The Poisson Process Properties of the Poisson Process  Interarrival times  Memoryless.
Markov Chains X(t) is a Markov Process if, for arbitrary times t1 < t2 < < tk < tk+1 If X(t) is discrete-valued If X(t) is continuous-valued i.e.
Chapter 61 Continuous Time Markov Chains Birth and Death Processes,Transition Probability Function, Kolmogorov Equations, Limiting Probabilities, Uniformization.
Model under consideration: Loss system Collection of resources to which calls with holding time  (c) and class c arrive at random instances. An arriving.
Probability Review CSE430 – Operating Systems. Overview of Lecture Basic probability review Important distributions Poison Process Markov Chains Queuing.
Probability Refresher COMP5416 Advanced Network Technologies.
Chapter 01 Probability and Stochastic Processes References: Wolff, Stochastic Modeling and the Theory of Queues, Chapter 1 Altiok, Performance Analysis.
CS433 Modeling and Simulation Lecture 07 – Part 01 Continuous Markov Chains Dr. Anis Koubâa 14 Dec 2008 Al-Imam.
CDA6530: Performance Models of Computers and Networks Chapter 3: Review of Practical Stochastic Processes.
4.3 More Discrete Probability Distributions NOTES Coach Bridges.
Chapter 4. Random Variables - 3
Queuing Theory.  Queuing Theory deals with systems of the following type:  Typically we are interested in how much queuing occurs or in the delays at.
CS433 Modeling and Simulation Lecture 11 Continuous Markov Chains Dr. Anis Koubâa 01 May 2009 Al-Imam Mohammad Ibn Saud University.
Copyright © 2011 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin Chapter 5 Discrete Random Variables.
Random Variables Lecture Lecturer : FATEN AL-HUSSAIN.
The Pure Birth Process Derivation of the Poisson Probability Distribution Assumptions events occur completely at random the probability of an event occurring.
Probabilistic Analysis of Computer Systems
Random variables (r.v.) Random variable
Random Variables.
水分子不時受撞,跳格子(c.p. 車行) 投骰子 (最穩定) 股票 (價格是不穏定,但報酬過程略穩定) 地震的次數 (不穩定)
Exponential Distribution & Poisson Process
Pertemuan ke-7 s/d ke-10 (minggu ke-4 dan ke-5)
V5 Stochastic Processes
Multinomial Distribution
CPSC 531: System Modeling and Simulation
Probability & Statistics Probability Theory Mathematical Probability Models Event Relationships Distributions of Random Variables Continuous Random.
Introduction to Probability and Statistics
Probability distributions
Distributions and expected value
Now it’s time to look at…
September 1, 2010 Dr. Itamar Arel College of Engineering
Tutorial 7 Probability and Calculus
IE 360: Design and Control of Industrial Systems I
CS723 - Probability and Stochastic Processes
Presentation transcript:

Stochastic Processes1 CPSC : Stochastic Processes Instructor: Anirban Mahanti Reference Book “Computer Systems Performance Evaluation and Prediction” by P. Fortier and H. Michel, Digital Press, 2004.

Stochastic Processes2 Outline r Definitions m Discrete, continuous, independent, stationary r Bernoulli Process r Poisson Process r Birth Death Process r Markov Process (next time)

Stochastic Processes3 r Definition: A family of random variables, denoted X(t), where one value of the random variable X exists for each value of t. r Example T = {heads, tails} <- the index set x = {0, 1} <- the state space X(heads) = 0; X(tails) = 1;

Stochastic Processes4 Stochastic Processes (2) Examples r Number of commands, N(t), received by a time-sharing computer system during some time interval (0, t) -> discrete state, continuous index r Number of heads returned, N(n), by tossing a fair coin n times? Stochastic Processes discrete continuous

Stochastic Processes5 Stochastic Processes (3) Independent increments x(t 2 ) - x(t 1 ) != x(t 4 ) – x(t 3 ) E.g., number of phone calls, N(t), handled by a call center between noon and 3pm on a weekday. Stationary Increments x(t+h) – x(s+h) == x(t) – x(s) t1t1 t3t3 t2t2 t4t4 s t s+h t+h

Stochastic Processes6 Bernoulli Process Let X i ( i>= 0) be an independent and identically distributed Bernoulli random variable, such that: X i = 1, with probability p, and, X i = 0, with probability (1-p) Let S n = X 1 + X 2 + … + X n (i.e., counting number of successes in n trials) S n is a Bernoulli process. Why?

Stochastic Processes7 Poisson Process

Stochastic Processes8 Merging Poisson Streams λ1λ1 λ2λ2 λ=λ1+λ2λ=λ1+λ2

Stochastic Processes9 Dividing Poisson Streams papa pbpb λ λpaλpa λpbλpb

Stochastic Processes10 More on Poisson Process r Number of occurrences in intervals of equal length are identically distributed. r Poisson process is “memory less”, i.e., past history does not aid in predicting future events. r Probability of k arrivals in an interval of length t (k is an integer >= 0) follows the Poisson Density Function

Stochastic Processes11 Birth Death (BD) Processes A continuous parameter, discrete state space stochastic process {X(t), t >= 0} E(n), n = 0, 1, 2, 3 … describe the state X(t) = n means that X(t) is in state E(n) at time t

Stochastic Processes12 Properties of BD Processes r State changes only in increments of +- 1 r E n >= 0 r If the system is in state E n at time t, the probability of a transition to state E n+1 during interval (t,t+h) is λ n h + o(h), and to state E n-1 is µ n h + o(h), where λ n = birth rate µ n = death rate r Probability of more than one transition during an interval of length h is o(h)

Stochastic Processes13 Time Dependent Solutions for BD

Stochastic Processes14 Equilibrium Solution for BD r Rate entering = Rate leaving λ 0 p 0 = µ n p 1 and p 0 + p 1 = 1 So, now you can solve! λ0λ0 µ1µ1 1 0