Birth-Death Processes. Outline. EEC 686/785 Modeling & Performance Evaluation of Computer Systems. Relationship Among Stochastic Processes.

Size: px
Start display at page:

Download "Birth-Death Processes. Outline. EEC 686/785 Modeling & Performance Evaluation of Computer Systems. Relationship Among Stochastic Processes."

Transcription

1 EEC 686/785 Modelig & Perforace Evaluatio of Couter Systes Lecture Webig Zhao Deartet of Electrical ad Couter Egieerig Clevelad State Uiversity based o Dr. Raj jai s lecture otes Relatioshi Aog Stochastic Processes Markov rocess is broader tha birth-death rocess ad birth-death rocess is broader tha Poisso rocess The Poisso rocess ca be odeled as a ure birth rocess with costat birth rate All birth-death rocesses are Markov rocesses with the restrictio that the trasitios are restricted to eighborig states 3 3 Noveber 5 EEC686/785 Webig Zhao Outlie irth-death Processes 4 Review of lecture Aalysis of a sigle queue art II State-trasitio diagra j j- 3 j I state : j j j j j j j j New arrivals take lace at a rate The service rate is oth the iterarrival ties ad service ties are assued exoetially distributed 3 Noveber 5 EEC686/785 Webig Zhao 3 Noveber 5 EEC686/785 Webig Zhao

2 Theore: State Probability 5 Results for M/M/ Queues 7 The steady-state robability of a birth-death rocess beig i state i.e., there are jobs i the syste is give by:,,..., Here, is the robability of beig i the zero state o job i syste, i.e., syste is idle Utilizatio of the server: Mea uber of jobs i the syste: Variace of the uber of jobs: Mea resose tie: U E Var / Er Cuulative distributio fuctio of the resose r tie: F r e 3 Noveber 5 EEC686/785 Webig Zhao 3 Noveber 5 EEC686/785 Webig Zhao Results for M/M/ Queues j- j j irth-death rocesses with,,,...,,,..., Probability of jobs i the syste,,..., /: traffic itesity 6 Results for M/M/ Queues Cuulative distributio fuctio of the waitig tie F w e w This is a trucated exoetial distributio. Its q-ercetile is give by w q l q The above forula alies oly if q is greater tha -. All lower ercetiles are w w q ax, l q 8 3 Noveber 5 EEC686/785 Webig Zhao 3 Noveber 5 EEC686/785 Webig Zhao

3 Results for M/M/ Queues 9 Exale 3. Mea uber of jobs i the queue q usy eriod: the tie iterval betwee two successive idle itervals Arrival rate 5 s Service rate /. 5 s Gateway utilizatio /.5 Probability of ackets i the gateway Mea uber of ackets i the gateway /.5/ Mea tie set i the gateway /- /5/ illisecods 3 Noveber 5 EEC686/785 Webig Zhao 3 Noveber 5 EEC686/785 Webig Zhao Exale 3. Exale 3. O a etwork gateway, easureets show that the ackets arrive at a ea rate of 5 ackets er secod s ad the gateway takes about two illisecods to forward the. Usig a M/M/ odel, aalyze the gateway What is the robability of buffer overflow if the gateway had oly 3 buffers? How ay buffers do we eed to kee acket loss below oe acket er illio? Probability of buffer overflow Pore tha 3 ackets i gateway ackets er billio ackets To liit the robability of loss to less tha -6 : -6 or: > log -6 /log We eed about buffers The last two results about buffer overflow are aroxiate 3 Noveber 5 EEC686/785 Webig Zhao 3 Noveber 5 EEC686/785 Webig Zhao 3

4 3 5 Exale 3. M/M/ Queue Strictly seakig, the gateway should actually be odeled as a fiite buffer M/M// queue Sice the utilizatio is low ad the uber of buffers is far above the ea queue legth, the results obtaied are a close aroxiatio Used to odel ultirocessor systes or devices that have several idetical servers ad all jobs waitig for these server are ket i oe queue idetical servers each with a service rate of jobs er uit tie The arrival rate is jobs er uit tie For a M/M/ queue to be stable, the traffic itesity ust be less tha If ay of the servers are idle, the arrivig job is serviced iediately If all servers are busy, the arrivig jobs wait i a queue 3 Noveber 5 EEC686/785 Webig Zhao 3 Noveber 5 EEC686/785 Webig Zhao 4 6 Exale 3. M/M/ Queue The state of the syste is rereseted by the uber of jobs i the syste Noveber 5 EEC686/785 Webig Zhao 3 Noveber 5 EEC686/785 Webig Zhao 4

5 5 3 Noveber 5 EEC686/785 7 Webig Zhao Aalysis of M/M/ Queue Nuber of jobs i the syste is a birth-death rocess:,...,,,,...,,,,..., 3 Noveber 5 EEC686/785 8 Webig Zhao Aalysis of M/M/ Queue Probability of jobs i the syste: I ters of the traffic itesity /, we have:,...,,,,...,,...,,,,..., 3 Noveber 5 EEC686/785 9 Webig Zhao Aalysis of M/M/ Queue Probability of zero jobs i the syste: 3 Noveber 5 EEC686/785 Webig Zhao Aalysis of M/M/ Queue Probability that a arrivig job has to wait i the queue really should be, ca t iut it i PoitPoit : This is kow as Erlag s C forula. Notice that for, jobs P

6 6 3 Noveber 5 EEC686/785 Webig Zhao Aalysis of M/M/ Queue Mea uber of jobs i the queue q : E q Aalysis of M/M/ Queue Exected uber of jobs i service sice s E 3 Noveber 5 EEC686/785 3 Webig Zhao Aalysis of M/M/ Queue Exected uber of jobs i the syste: Variace of ad q ca siilarly be show as E E E s q q Var Var 3 Noveber 5 EEC686/785 4 Webig Zhao Aalysis of M/M/ Queue I T secods Total uber of jobs arrivig ad gettig service will be T Total busy tie of servers to service these jobs will be T/ Utilizatio of each server: T T U / / tie Total usy tie er server

7 Aalysis of M/M/ Queue 5 Aalysis of M/M/ Queue 7 Mea resose tie usig Little s law / r Mea waitig tie q w Cuulative distributio fuctio of the waitig tie: F w e w sice w has a trucated exoetial distributio fuctio, its q-ercetile: w q ax, l q If the robability of queueig is less tha -q/, the secod ter i the above equatio ca be egative. The correct aswer i those cases is 3 Noveber 5 EEC686/785 Webig Zhao 3 Noveber 5 EEC686/785 Webig Zhao Aalysis of M/M/ Queue Cuulative distributio fuctio of tie resose tie: r r r e e e / F r r r e re / r > Notice that the resose tie r is ot exoetially distributed uless I geeral, the coefficiet of variatio of r is less tha C.o.v stadard deviatio / exected value 6 Exale 3. Studets arrive at the uiversity couter ceter i a Poisso aer at a average rate of te er hour. Each studet seds a average of iutes at the terial ad the tie ca be assued to be exoetially distributed. The ceter curretly has five terials. Soe studets have bee colaiig that waitig ties are too log. Let us aalyze the ceter usage usig a queueig odel M/M/5 queueig syste with /6 er iute / er iute 8 3 Noveber 5 EEC686/785 Webig Zhao 3 Noveber 5 EEC686/785 Webig Zhao 7

8 Exale 3. 9 Exale 3. 3 Traffic itesity /.67/ Probability of all terials beig idle is: Average uber of studets waitig i the queue is: q Average uber of studets usig the terials is: s q 3 Noveber 5 EEC686/785 Webig Zhao 3 Noveber 5 EEC686/785 Webig Zhao Exale 3. 3 Exale 3. 3 Probability of all terials beig busy is: Average terial utilizatio.67 Average uber of studets i the ceter is: E The ea ad variace of the tie set i the ceter are:.33 r Var r Thus, each studet seds a average of 4 iutes i the ceter iutes workig 4 iutes waitig Noveber 5 EEC686/785 Webig Zhao 3 Noveber 5 EEC686/785 Webig Zhao 8

9 Exale 3. Mea waitig tie:.33 w ercetile of the waitig tie is: w 4 ax, l ax, l % of the studets wait ore tha 4 iutes 33 Exale 3.3 With 6 terials: Traffic itesity:.67/ Probability of all terials beig idle.346 Probability of all terials beig busy.5 Average waitig tie w. iutes The 9-ercetile of waitig tie is:. ax, l > With just oe ore terial we will be able to satisfy the studets deads 35 3 Noveber 5 EEC686/785 Webig Zhao 3 Noveber 5 EEC686/785 Webig Zhao Exale Exale The studets would like to liit their waitig tie to a average of two iutes ad o ore tha five iutes i 9% of the cases. Is it feasible? If yes the how ay terials are required?.67 ad.5 Cosider what would have haeed if the five terials i exale 3. were located i five differet locatios o the caus, thereby eedig a searate queue for each Five searate M/M/ queues,.67/5.333, ad.5 Traffic itesity:.333/ Noveber 5 EEC686/785 Webig Zhao 3 Noveber 5 EEC686/785 Webig Zhao 9

10 Exale 3.4 The ea tie set i the terial roo is: / /.5 r 6.67 The variace of the tie set i the terial roo is: / /.5 Var r Coare this to the ea of 4 iutes ad a variace of 479 i exale 3. > sigle queue alterative is better 37 M/M/ Queue Ifiite servers. Jobs ever wait Resose tie service tie Mea resose tie ea service tie regardless of the arrival rate > Called delay ceters Used to rereset dedicated resources, such as terials i tiesharig systes Proerties of such queues ca be easily derived fro those for M/M/ queues Also see results for M/G/ queues 39 3 Noveber 5 EEC686/785 Webig Zhao 3 Noveber 5 EEC686/785 Webig Zhao Exale M/M// Queue with Fiite uffers 4 Walkig tie was igored. Havig several terial roos distributed across the caus ay reduce the walkig tie cosiderably If all jobs are idetical, it is better to have just oe queue tha to have ultile queues If soe studets eed very short terial sessios ad others eed very log sessios, searate queues ay be better Siilar to the M/M/ queue but uber of buffers is fiite All arrivals, after buffers are full, are lost is greater tha or equal to ; otherwise soe servers will ever be able to oerate > M/M// queue 3 Noveber 5 EEC686/785 Webig Zhao 3 Noveber 5 EEC686/785 Webig Zhao

11 3 Noveber 5 EEC686/785 4 Webig Zhao Aalysis of M/M// Queue irth-death rocess: -,...,,,,...,,,,..., 3 Noveber 5 EEC686/785 4 Webig Zhao Aalysis of M/M// Queue Probability of jobs i the syste: I ters of the traffic itesity /:,...,,,,...,,...,,,,..., 3 Noveber 5 EEC686/ Webig Zhao Aalysis of M/M// Queue Probability of zero jobs i the syste: 3 Noveber 5 EEC686/ Webig Zhao Aalysis of M/M// Queue Mea uber of jobs i the syste : Mea uber of jobs i the queue q : E q E

12 Aalysis of M/M// Queue 45 Aalysis of M/M// Queue 47 Variace ad other statistics o ad q ca be siilarly couted All arrivals occurrig whe the syste is i the state are lost. Rate of the jobs actually eterig the syste, called effective arrival rate, is: ' The differece reresets the loss rate Utilizatio of each server: usy tie er server ' T / / ' U Total tie T Probability of the full syste 3 Noveber 5 EEC686/785 Webig Zhao 3 Noveber 5 EEC686/785 Webig Zhao Aalysis of M/M// Queue 46 Aalysis of M/M// Queue 48 Mea resose tie usig Little s law: For a M/M// syste, loss robability is: r ' Siilarly, the ea waitig tie is: q q w ' / j j j This is Erlag s loss forula Used to coute the robability of lost hoe calls. Valid also for M/G// queues 3 Noveber 5 EEC686/785 Webig Zhao 3 Noveber 5 EEC686/785 Webig Zhao

13 Exale Exale Cosider the gateway of exale 3. agai. Let us aalyze the gateway assuig it has oly two buffers. The arrival rate ad the service rate, as before, are 5 s ad 5 s, resectively. I this case: 5, 5,, ad Traffic itesity: /5/ 5.5 Mea uber of jobs i the syste: Mea uber of jobs i the queue: q Effective arrival rate i the syste: ' s 3 Noveber 5 EEC686/785 Webig Zhao 3 Noveber 5 EEC686/785 Webig Zhao Exale Exale for,,, are:.5 Packet loss rate 596s Mea resose tie.5.65 is deteried by suig all robabilities: >.5.65 / Substitutig for i, we get: r.4 ' 9 Mea tie waitig i the queue q.476 w 4. ' 9 3 secods 4 secods 3 Noveber 5 EEC686/785 Webig Zhao 3 Noveber 5 EEC686/785 Webig Zhao 3

14 Exale Variace ad other statistics for the uber of jobs i the syste ca also be couted sice the colete robability ass fuctio is kow. For exale: Var Noveber 5 EEC686/785 Webig Zhao 4

Queueing 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. General Distributions Queueig Theory II Suary M/M/1 Output process Networks of Queue Method of Stages Erlag Distributio Hyperexpoetial Distributio Geeral Distributios Ebedded Markov Chais 1 M/M/1 Output Process Burke s Theore:

More information

S. A. ALIEV, Y. I. YELEYKO, Y. V. ZHERNOVYI. STEADY-STATE DISTRIBUTIONS FOR CERTAIN MODIFICATIONS OF THE M/M/1/m QUEUEING SYSTEM

S. A. ALIEV, Y. I. YELEYKO, Y. V. ZHERNOVYI. STEADY-STATE DISTRIBUTIONS FOR CERTAIN MODIFICATIONS OF THE M/M/1/m QUEUEING SYSTEM Trasactios of Azerbaija Natioal Acadey of Scieces, Series of Physical-Techical ad Matheatical Scieces: Iforatics ad Cotrol Probles 009 Vol XXIX, 6 P 50-58 S A ALIEV, Y I YELEYKO, Y V ZHERNOVYI STEADY-STATE

More information

CS/ECE 715 Spring 2004 Homework 5 (Due date: March 16)

CS/ECE 715 Spring 2004 Homework 5 (Due date: March 16) CS/ECE 75 Sprig 004 Homework 5 (Due date: March 6) Problem 0 (For fu). M/G/ Queue with Radom-Sized Batch Arrivals. Cosider the M/G/ system with the differece that customers are arrivig i batches accordig

More information

The statistical pattern of the arrival can be indicated through the probability distribution of the number of the arrivals in an interval.

The statistical pattern of the arrival can be indicated through the probability distribution of the number of the arrivals in an interval. Itroductio Queuig are the most freuetly ecoutered roblems i everyday life. For examle, ueue at a cafeteria, library, bak, etc. Commo to all of these cases are the arrivals of objects reuirig service ad

More information

B. Maddah ENMG 622 ENMG /27/07

B. Maddah ENMG 622 ENMG /27/07 B. Maddah ENMG 622 ENMG 5 3/27/7 Queueig Theory () What is a queueig system? A queueig system cosists of servers (resources) that provide service to customers (etities). A Customer requestig service will

More information

Queuing Theory. Basic properties, Markovian models, Networks of queues, General service time distributions, Finite source models, Multiserver queues

Queuing Theory. Basic properties, Markovian models, Networks of queues, General service time distributions, Finite source models, Multiserver queues Queuig Theory Basic properties, Markovia models, Networks of queues, Geeral service time distributios, Fiite source models, Multiserver queues Chapter 8 Kedall s Notatio for Queuig Systems A/B/X/Y/Z: A

More information

First come, first served (FCFS) Batch

First come, first served (FCFS) Batch Queuig Theory Prelimiaries A flow of customers comig towards the service facility forms a queue o accout of lack of capacity to serve them all at a time. RK Jaa Some Examples: Persos waitig at doctor s

More information

Lecture 6 Chi Square Distribution (χ 2 ) and Least Squares Fitting

Lecture 6 Chi Square Distribution (χ 2 ) and Least Squares Fitting Lecture 6 Chi Square Distributio (χ ) ad Least Squares Fittig Chi Square Distributio (χ ) Suppose: We have a set of measuremets {x 1, x, x }. We kow the true value of each x i (x t1, x t, x t ). We would

More information

Lecture 6 Chi Square Distribution (χ 2 ) and Least Squares Fitting

Lecture 6 Chi Square Distribution (χ 2 ) and Least Squares Fitting Lecture 6 Chi Square Distributio (χ ) ad Least Squares Fittig Chi Square Distributio (χ ) Suppose: We have a set of measuremets {x 1, x, x }. We kow the true value of each x i (x t1, x t, x t ). We would

More information

8.3 Perturbation theory

8.3 Perturbation theory 8.3 Perturbatio theory Slides: Video 8.3.1 Costructig erturbatio theory Text referece: Quatu Mechaics for Scietists ad gieers Sectio 6.3 (u to First order erturbatio theory ) Perturbatio theory Costructig

More information

The Hypergeometric Coupon Collection Problem and its Dual

The Hypergeometric Coupon Collection Problem and its Dual Joural of Idustrial ad Systes Egieerig Vol., o., pp -7 Sprig 7 The Hypergeoetric Coupo Collectio Proble ad its Dual Sheldo M. Ross Epstei Departet of Idustrial ad Systes Egieerig, Uiversity of Souther

More information

Announcements. Queueing Systems: Lecture 1. Lecture Outline. Topics in Queueing Theory

Announcements. Queueing Systems: Lecture 1. Lecture Outline. Topics in Queueing Theory Aoucemets Queueig Systems: Lecture Amedeo R. Odoi October 4, 2006 PS #3 out this afteroo Due: October 9 (graded by 0/23) Office hours Odoi: Mo. 2:30-4:30 - Wed. 2:30-4:30 o Oct. 8 (No office hrs 0/6) _

More information

(s)h(s) = K( s + 8 ) = 5 and one finite zero is located at z 1

(s)h(s) = K( s + 8 ) = 5 and one finite zero is located at z 1 ROOT LOCUS TECHNIQUE 93 should be desiged differetly to eet differet specificatios depedig o its area of applicatio. We have observed i Sectio 6.4 of Chapter 6, how the variatio of a sigle paraeter like

More information

A queueing system can be described as customers arriving for service, waiting for service if it is not immediate, and if having waited for service,

A queueing system can be described as customers arriving for service, waiting for service if it is not immediate, and if having waited for service, Queuig System A queueig system ca be described as customers arrivig for service, waitig for service if it is ot immediate, ad if havig waited for service, leavig the service after beig served. The basic

More information

We have also learned that, thanks to the Central Limit Theorem and the Law of Large Numbers,

We have also learned that, thanks to the Central Limit Theorem and the Law of Large Numbers, Cofidece Itervals III What we kow so far: We have see how to set cofidece itervals for the ea, or expected value, of a oral probability distributio, both whe the variace is kow (usig the stadard oral,

More information

Reliability and Queueing

Reliability and Queueing Copyright 999 Uiversity of Califoria Reliability ad Queueig by David G. Messerschmitt Supplemetary sectio for Uderstadig Networked Applicatios: A First Course, Morga Kaufma, 999. Copyright otice: Permissio

More information

PH 425 Quantum Measurement and Spin Winter SPINS Lab 1

PH 425 Quantum Measurement and Spin Winter SPINS Lab 1 PH 425 Quatum Measuremet ad Spi Witer 23 SPIS Lab Measure the spi projectio S z alog the z-axis This is the experimet that is ready to go whe you start the program, as show below Each atom is measured

More information

Chapter 2. Asymptotic Notation

Chapter 2. Asymptotic Notation Asyptotic Notatio 3 Chapter Asyptotic Notatio Goal : To siplify the aalysis of ruig tie by gettig rid of details which ay be affected by specific ipleetatio ad hardware. [1] The Big Oh (O-Notatio) : It

More information

AVERAGE MARKS SCALING

AVERAGE MARKS SCALING TERTIARY INSTITUTIONS SERVICE CENTRE Level 1, 100 Royal Street East Perth, Wester Australia 6004 Telephoe (08) 9318 8000 Facsiile (08) 95 7050 http://wwwtisceduau/ 1 Itroductio AVERAGE MARKS SCALING I

More information

TCOM 501: Networking Theory & Fundamentals. Lecture 3 January 29, 2003 Prof. Yannis A. Korilis

TCOM 501: Networking Theory & Fundamentals. Lecture 3 January 29, 2003 Prof. Yannis A. Korilis TCOM 5: Networkig Theory & Fudametals Lecture 3 Jauary 29, 23 Prof. Yais A. Korilis 3-2 Topics Markov Chais Discrete-Time Markov Chais Calculatig Statioary Distributio Global Balace Equatios Detailed Balace

More information

SINGLE-CHANNEL QUEUING PROBLEMS APPROACH

SINGLE-CHANNEL QUEUING PROBLEMS APPROACH SINGLE-CHANNEL QUEUING ROBLEMS AROACH Abdurrzzag TAMTAM, Doctoral Degree rogramme () Dept. of Telecommuicatios, FEEC, BUT E-mail: xtamta@stud.feec.vutbr.cz Supervised by: Dr. Karol Molár ABSTRACT The paper

More information

http://www.xelca.l/articles/ufo_ladigsbaa_houte.aspx imulatio Output aalysis 3/4/06 This lecture Output: A simulatio determies the value of some performace measures, e.g. productio per hour, average queue

More information

B. Maddah ENMG 622 ENMG /20/09

B. Maddah ENMG 622 ENMG /20/09 B. Maddah ENMG 6 ENMG 5 5//9 Queueig Theory () Distributio of waitig time i M/M/ Let T q be the waitig time i queue of a ustomer. The it a be show that, ( ) t { q > } =. T t e Let T be the total time of

More information

Taylor Series (BC Only)

Taylor Series (BC Only) Studet Study Sessio Taylor Series (BC Oly) Taylor series provide a way to fid a polyomial look-alike to a o-polyomial fuctio. This is doe by a specific formula show below (which should be memorized): Taylor

More information

Simulation of Discrete Event Systems

Simulation of Discrete Event Systems Simulatio of Discrete Evet Systems Uit 9 Queueig Models Fall Witer 2014/2015 Uiv.-Prof. Dr.-Ig. Dipl.-Wirt.-Ig. Christopher M. Schlick Chair ad Istitute of Idustrial Egieerig ad Ergoomics RWTH Aache Uiversity

More information

Discrete probability distributions

Discrete probability distributions Discrete probability distributios I the chapter o probability we used the classical method to calculate the probability of various values of a radom variable. I some cases, however, we may be able to develop

More information

Define a Markov chain on {1,..., 6} with transition probability matrix P =

Define a Markov chain on {1,..., 6} with transition probability matrix P = Pla Group Work 0. The title says it all Next Tie: MCMC ad Geeral-state Markov Chais Midter Exa: Tuesday 8 March i class Hoework 4 due Thursday Uless otherwise oted, let X be a irreducible, aperiodic Markov

More information

TUFTS UNIVERSITY DEPARTMENT OF CIVIL AND ENVIRONMENTAL ENGINEERING ES 152 ENGINEERING SYSTEMS Spring Lesson 14. Queue System Theory

TUFTS UNIVERSITY DEPARTMENT OF CIVIL AND ENVIRONMENTAL ENGINEERING ES 152 ENGINEERING SYSTEMS Spring Lesson 14. Queue System Theory TUFTS UNIVERSITY DEARTMENT OF CIVI AND ENVIRONMENTA ENGINEERING ES 52 ENGINEERING SYSTEMS Sprig 2 esso 4 Queue System Theory There exists a cosiderable body of theoretical aalysis of ueues. (Chapter 7

More information

Data Analysis and Statistical Methods Statistics 651

Data Analysis and Statistical Methods Statistics 651 Data Aalysis ad Statistical Methods Statistics 651 http://www.stat.tau.edu/~suhasii/teachig.htl Suhasii Subba Rao Exaple The itroge cotet of three differet clover plats is give below. 3DOK1 3DOK5 3DOK7

More information

Ratio of Two Random Variables: A Note on the Existence of its Moments

Ratio of Two Random Variables: A Note on the Existence of its Moments Metodološki zvezki, Vol. 3, o., 6, -7 Ratio of wo Rado Variables: A ote o the Existece of its Moets Ato Cedilik, Kataria Košel, ad Adre Bleec 3 Abstract o eable correct statistical iferece, the kowledge

More information

ECE 901 Lecture 4: Estimation of Lipschitz smooth functions

ECE 901 Lecture 4: Estimation of Lipschitz smooth functions ECE 9 Lecture 4: Estiatio of Lipschitz sooth fuctios R. Nowak 5/7/29 Cosider the followig settig. Let Y f (X) + W, where X is a rado variable (r.v.) o X [, ], W is a r.v. o Y R, idepedet of X ad satisfyig

More information

Queueing theory and Replacement model

Queueing theory and Replacement model Queueig theory ad Replacemet model. Trucks at a sigle platform weigh-bridge arrive accordig to Poisso probability distributio. The time required to weigh the truck follows a expoetial probability distributio.

More information

Chapter 11 Output Analysis for a Single Model. Banks, Carson, Nelson & Nicol Discrete-Event System Simulation

Chapter 11 Output Analysis for a Single Model. Banks, Carson, Nelson & Nicol Discrete-Event System Simulation Chapter Output Aalysis for a Sigle Model Baks, Carso, Nelso & Nicol Discrete-Evet System Simulatio Error Estimatio If {,, } are ot statistically idepedet, the S / is a biased estimator of the true variace.

More information

Introduction to probability Stochastic Process Queuing systems. TELE4642: Week2

Introduction to probability Stochastic Process Queuing systems. TELE4642: Week2 Itroductio to probability Stochastic Process Queuig systems TELE4642: Week2 Overview Refresher: Probability theory Termiology, defiitio Coditioal probability, idepedece Radom variables ad distributios

More information

Output Analysis (2, Chapters 10 &11 Law)

Output Analysis (2, Chapters 10 &11 Law) B. Maddah ENMG 6 Simulatio Output Aalysis (, Chapters 10 &11 Law) Comparig alterative system cofiguratio Sice the output of a simulatio is radom, the comparig differet systems via simulatio should be doe

More information

Summer MA Lesson 13 Section 1.6, Section 1.7 (part 1)

Summer MA Lesson 13 Section 1.6, Section 1.7 (part 1) Suer MA 1500 Lesso 1 Sectio 1.6, Sectio 1.7 (part 1) I Solvig Polyoial Equatios Liear equatio ad quadratic equatios of 1 variable are specific types of polyoial equatios. Soe polyoial equatios of a higher

More information

Primes of the form n 2 + 1

Primes of the form n 2 + 1 Itroductio Ladau s Probles are four robles i Nuber Theory cocerig rie ubers: Goldbach s Cojecture: This cojecture states that every ositive eve iteger greater tha ca be exressed as the su of two (ot ecessarily

More information

Lecture Chapter 6: Convergence of Random Sequences

Lecture Chapter 6: Convergence of Random Sequences ECE5: Aalysis of Radom Sigals Fall 6 Lecture Chapter 6: Covergece of Radom Sequeces Dr Salim El Rouayheb Scribe: Abhay Ashutosh Doel, Qibo Zhag, Peiwe Tia, Pegzhe Wag, Lu Liu Radom sequece Defiitio A ifiite

More information

1 Introduction to reducing variance in Monte Carlo simulations

1 Introduction to reducing variance in Monte Carlo simulations Copyright c 010 by Karl Sigma 1 Itroductio to reducig variace i Mote Carlo simulatios 11 Review of cofidece itervals for estimatig a mea I statistics, we estimate a ukow mea µ = E(X) of a distributio by

More information

CEE 522 Autumn Uncertainty Concepts for Geotechnical Engineering

CEE 522 Autumn Uncertainty Concepts for Geotechnical Engineering CEE 5 Autum 005 Ucertaity Cocepts for Geotechical Egieerig Basic Termiology Set A set is a collectio of (mutually exclusive) objects or evets. The sample space is the (collectively exhaustive) collectio

More information

Modeling and Performance Analysis with Discrete-Event Simulation

Modeling and Performance Analysis with Discrete-Event Simulation Simulatio Modelig ad Performace Aalysis with Discrete-Evet Simulatio Chapter 5 Statistical Models i Simulatio Cotets Basic Probability Theory Cocepts Useful Statistical Models Discrete Distributios Cotiuous

More information

IE 230 Seat # Name < KEY > Please read these directions. Closed book and notes. 60 minutes.

IE 230 Seat # Name < KEY > Please read these directions. Closed book and notes. 60 minutes. IE 230 Seat # Name < KEY > Please read these directios. Closed book ad otes. 60 miutes. Covers through the ormal distributio, Sectio 4.7 of Motgomery ad Ruger, fourth editio. Cover page ad four pages of

More information

GENERALIZED KERNEL AND MIXED INTEGRAL EQUATION OF FREDHOLM - VOLTERRA TYPE R. T. Matoog

GENERALIZED KERNEL AND MIXED INTEGRAL EQUATION OF FREDHOLM - VOLTERRA TYPE R. T. Matoog GENERALIZED KERNEL AND MIXED INTEGRAL EQUATION OF FREDHOLM - VOLTERRA TYPE R. T. Matoog Assistat Professor. Deartet of Matheatics, Faculty of Alied Scieces,U Al-Qura Uiversity, Makkah, Saudi Arabia Abstract:

More information

CSCI-6971 Lecture Notes: Stochastic processes

CSCI-6971 Lecture Notes: Stochastic processes CSCI-6971 Lecture Notes: Stochastic processes Kristopher R. Beevers Departet of Coputer Sciece Resselaer Polytechic Istitute beevek@cs.rpi.edu February 2, 2006 1 Overview Defiitio 1.1. A stochastic process

More information

There is no straightforward approach for choosing the warmup period l.

There is no straightforward approach for choosing the warmup period l. B. Maddah INDE 504 Discrete-Evet Simulatio Output Aalysis () Statistical Aalysis for Steady-State Parameters I a otermiatig simulatio, the iterest is i estimatig the log ru steady state measures of performace.

More information

Limit Theorems. Convergence in Probability. Let X be the number of heads observed in n tosses. Then, E[X] = np and Var[X] = np(1-p).

Limit Theorems. Convergence in Probability. Let X be the number of heads observed in n tosses. Then, E[X] = np and Var[X] = np(1-p). Limit Theorems Covergece i Probability Let X be the umber of heads observed i tosses. The, E[X] = p ad Var[X] = p(-p). L O This P x p NM QP P x p should be close to uity for large if our ituitio is correct.

More information

Confidence Interval for Standard Deviation of Normal Distribution with Known Coefficients of Variation

Confidence Interval for Standard Deviation of Normal Distribution with Known Coefficients of Variation Cofidece Iterval for tadard Deviatio of Normal Distributio with Kow Coefficiets of Variatio uparat Niwitpog Departmet of Applied tatistics, Faculty of Applied ciece Kig Mogkut s Uiversity of Techology

More information

Discrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Note 19

Discrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Note 19 CS 70 Discrete Mathematics ad Probability Theory Sprig 2016 Rao ad Walrad Note 19 Some Importat Distributios Recall our basic probabilistic experimet of tossig a biased coi times. This is a very simple

More information

Chapter 4. Fourier Series

Chapter 4. Fourier Series Chapter 4. Fourier Series At this poit we are ready to ow cosider the caoical equatios. Cosider, for eample the heat equatio u t = u, < (4.) subject to u(, ) = si, u(, t) = u(, t) =. (4.) Here,

More information

STAT 350 Handout 19 Sampling Distribution, Central Limit Theorem (6.6)

STAT 350 Handout 19 Sampling Distribution, Central Limit Theorem (6.6) STAT 350 Hadout 9 Samplig Distributio, Cetral Limit Theorem (6.6) A radom sample is a sequece of radom variables X, X 2,, X that are idepedet ad idetically distributed. o This property is ofte abbreviated

More information

Section 11.8: Power Series

Section 11.8: Power Series Sectio 11.8: Power Series 1. Power Series I this sectio, we cosider geeralizig the cocept of a series. Recall that a series is a ifiite sum of umbers a. We ca talk about whether or ot it coverges ad i

More information

Final Review for MATH 3510

Final Review for MATH 3510 Fial Review for MATH 50 Calculatio 5 Give a fairly simple probability mass fuctio or probability desity fuctio of a radom variable, you should be able to compute the expected value ad variace of the variable

More information

distinct distinct n k n k n! n n k k n 1 if k n, identical identical p j (k) p 0 if k > n n (k)

distinct distinct n k n k n! n n k k n 1 if k n, identical identical p j (k) p 0 if k > n n (k) THE TWELVEFOLD WAY FOLLOWING GIAN-CARLO ROTA How ay ways ca we distribute objects to recipiets? Equivaletly, we wat to euerate equivalece classes of fuctios f : X Y where X = ad Y = The fuctios are subject

More information

The Poisson Distribution

The Poisson Distribution MATH 382 The Poisso Distributio Dr. Neal, WKU Oe of the importat distributios i probabilistic modelig is the Poisso Process X t that couts the umber of occurreces over a period of t uits of time. This

More information

Answer Key, Problem Set 1, Written

Answer Key, Problem Set 1, Written Cheistry 1 Mies, Sprig, 018 Aswer Key, Proble Set 1, Writte 1. 14.3;. 14.34 (add part (e): Estiate / calculate the iitial rate of the reactio); 3. NT1; 4. NT; 5. 14.37; 6. 14.39; 7. 14.41; 8. NT3; 9. 14.46;

More information

Jacobi symbols. p 1. Note: The Jacobi symbol does not necessarily distinguish between quadratic residues and nonresidues. That is, we could have ( a

Jacobi symbols. p 1. Note: The Jacobi symbol does not necessarily distinguish between quadratic residues and nonresidues. That is, we could have ( a Jacobi sybols efiitio Let be a odd positive iteger If 1, the Jacobi sybol : Z C is the costat fuctio 1 1 If > 1, it has a decopositio ( as ) a product of (ot ecessarily distict) pries p 1 p r The Jacobi

More information

6.4 Binomial Coefficients

6.4 Binomial Coefficients 64 Bioial Coefficiets Pascal s Forula Pascal s forula, aed after the seveteeth-cetury Frech atheaticia ad philosopher Blaise Pascal, is oe of the ost faous ad useful i cobiatorics (which is the foral ter

More information

Orthogonal Functions

Orthogonal Functions Royal Holloway Uiversity of odo Departet of Physics Orthogoal Fuctios Motivatio Aalogy with vectors You are probably failiar with the cocept of orthogoality fro vectors; two vectors are orthogoal whe they

More information

Lecture 11: A Fourier Transform Primer

Lecture 11: A Fourier Transform Primer PHYS 34 Fall 1 ecture 11: A Fourier Trasform Primer Ro Reifeberger Birck aotechology Ceter Purdue Uiversity ecture 11 1 f() I may edeavors, we ecouter sigals that eriodically reeat f(t) T t Such reeatig

More information

Probability and statistics: basic terms

Probability and statistics: basic terms Probability ad statistics: basic terms M. Veeraraghava August 203 A radom variable is a rule that assigs a umerical value to each possible outcome of a experimet. Outcomes of a experimet form the sample

More information

To make comparisons for two populations, consider whether the samples are independent or dependent.

To make comparisons for two populations, consider whether the samples are independent or dependent. Sociology 54 Testig for differeces betwee two samle meas Cocetually, comarig meas from two differet samles is the same as what we ve doe i oe-samle tests, ecet that ow the hyotheses focus o the arameters

More information

The Hong Kong University of Science & Technology ISOM551 Introductory Statistics for Business Assignment 3 Suggested Solution

The Hong Kong University of Science & Technology ISOM551 Introductory Statistics for Business Assignment 3 Suggested Solution The Hog Kog Uiversity of ciece & Techology IOM55 Itroductory tatistics for Busiess Assigmet 3 uggested olutio Note All values of statistics i Q ad Q4 are obtaied by Excel. Qa. Let be the robability that

More information

The Random Walk For Dummies

The Random Walk For Dummies The Radom Walk For Dummies Richard A Mote Abstract We look at the priciples goverig the oe-dimesioal discrete radom walk First we review five basic cocepts of probability theory The we cosider the Beroulli

More information

Lecture 2: Poisson Sta*s*cs Probability Density Func*ons Expecta*on and Variance Es*mators

Lecture 2: Poisson Sta*s*cs Probability Density Func*ons Expecta*on and Variance Es*mators Lecture 2: Poisso Sta*s*cs Probability Desity Fuc*os Expecta*o ad Variace Es*mators Biomial Distribu*o: P (k successes i attempts) =! k!( k)! p k s( p s ) k prob of each success Poisso Distributio Note

More information

Generalized Semi- Markov Processes (GSMP)

Generalized Semi- Markov Processes (GSMP) Geeralized Semi- Markov Processes (GSMP) Summary Some Defiitios Markov ad Semi-Markov Processes The Poisso Process Properties of the Poisso Process Iterarrival times Memoryless property ad the residual

More information

Zeros of Polynomials

Zeros of Polynomials Math 160 www.timetodare.com 4.5 4.6 Zeros of Polyomials I these sectios we will study polyomials algebraically. Most of our work will be cocered with fidig the solutios of polyomial equatios of ay degree

More information

A PROBABILITY PROBLEM

A PROBABILITY PROBLEM A PROBABILITY PROBLEM A big superarket chai has the followig policy: For every Euros you sped per buy, you ear oe poit (suppose, e.g., that = 3; i this case, if you sped 8.45 Euros, you get two poits,

More information

Control chart for number of customers in the system of M [X] / M / 1 Queueing system

Control chart for number of customers in the system of M [X] / M / 1 Queueing system Iteratioal Joural of Iovative Research i Sciece, Egieerig ad Techology (A ISO 3297: 07 Certified Orgaiatio) Cotrol chart for umber of customers i the system of M [X] / M / Queueig system T.Poogodi, Dr.

More information

Complete Solutions to Supplementary Exercises on Infinite Series

Complete Solutions to Supplementary Exercises on Infinite Series Coplete Solutios to Suppleetary Eercises o Ifiite Series. (a) We eed to fid the su ito partial fractios gives By the cover up rule we have Therefore Let S S A / ad A B B. Covertig the suad / the by usig

More information

(b) What is the probability that a particle reaches the upper boundary n before the lower boundary m?

(b) What is the probability that a particle reaches the upper boundary n before the lower boundary m? MATH 529 The Boudary Problem The drukard s walk (or boudary problem) is oe of the most famous problems i the theory of radom walks. Oe versio of the problem is described as follows: Suppose a particle

More information

f x x c x c x c... x c...

f x x c x c x c... x c... CALCULUS BC WORKSHEET ON POWER SERIES. Derive the Taylor series formula by fillig i the blaks below. 4 5 Let f a a c a c a c a4 c a5 c a c What happes to this series if we let = c? f c so a Now differetiate

More information

7.1 Convergence of sequences of random variables

7.1 Convergence of sequences of random variables Chapter 7 Limit Theorems Throughout this sectio we will assume a probability space (, F, P), i which is defied a ifiite sequece of radom variables (X ) ad a radom variable X. The fact that for every ifiite

More information

The Binomial Multi- Section Transformer

The Binomial Multi- Section Transformer 4/4/26 The Bioial Multisectio Matchig Trasforer /2 The Bioial Multi- Sectio Trasforer Recall that a ulti-sectio atchig etwork ca be described usig the theory of sall reflectios as: where: ( ω ) = + e +

More information

Topic 1 2: Sequences and Series. A sequence is an ordered list of numbers, e.g. 1, 2, 4, 8, 16, or

Topic 1 2: Sequences and Series. A sequence is an ordered list of numbers, e.g. 1, 2, 4, 8, 16, or Topic : Sequeces ad Series A sequece is a ordered list of umbers, e.g.,,, 8, 6, or,,,.... A series is a sum of the terms of a sequece, e.g. + + + 8 + 6 + or... Sigma Notatio b The otatio f ( k) is shorthad

More information

Kolmogorov-Smirnov type Tests for Local Gaussianity in High-Frequency Data

Kolmogorov-Smirnov type Tests for Local Gaussianity in High-Frequency Data Proceedigs 59th ISI World Statistics Cogress, 5-30 August 013, Hog Kog (Sessio STS046) p.09 Kolmogorov-Smirov type Tests for Local Gaussiaity i High-Frequecy Data George Tauche, Duke Uiversity Viktor Todorov,

More information

Lecture 19: Convergence

Lecture 19: Convergence Lecture 19: Covergece Asymptotic approach I statistical aalysis or iferece, a key to the success of fidig a good procedure is beig able to fid some momets ad/or distributios of various statistics. I may

More information

Contents Two Sample t Tests Two Sample t Tests

Contents Two Sample t Tests Two Sample t Tests Cotets 3.5.3 Two Saple t Tests................................... 3.5.3 Two Saple t Tests Setup: Two Saples We ow focus o a sceario where we have two idepedet saples fro possibly differet populatios. Our

More information

Binomial transform of products

Binomial transform of products Jauary 02 207 Bioial trasfor of products Khristo N Boyadzhiev Departet of Matheatics ad Statistics Ohio Norther Uiversity Ada OH 4580 USA -boyadzhiev@ouedu Abstract Give the bioial trasfors { b } ad {

More information

COMP 2804 Solutions Assignment 1

COMP 2804 Solutions Assignment 1 COMP 2804 Solutios Assiget 1 Questio 1: O the first page of your assiget, write your ae ad studet uber Solutio: Nae: Jaes Bod Studet uber: 007 Questio 2: I Tic-Tac-Toe, we are give a 3 3 grid, cosistig

More information

Approximations and more PMFs and PDFs

Approximations and more PMFs and PDFs Approximatios ad more PMFs ad PDFs Saad Meimeh 1 Approximatio of biomial with Poisso Cosider the biomial distributio ( b(k,,p = p k (1 p k, k λ: k Assume that is large, ad p is small, but p λ at the limit.

More information

7.1 Convergence of sequences of random variables

7.1 Convergence of sequences of random variables Chapter 7 Limit theorems Throughout this sectio we will assume a probability space (Ω, F, P), i which is defied a ifiite sequece of radom variables (X ) ad a radom variable X. The fact that for every ifiite

More information

1.010 Uncertainty in Engineering Fall 2008

1.010 Uncertainty in Engineering Fall 2008 MIT OpeCourseWare http://ocw.mit.edu.00 Ucertaity i Egieerig Fall 2008 For iformatio about citig these materials or our Terms of Use, visit: http://ocw.mit.edu.terms. .00 - Brief Notes # 9 Poit ad Iterval

More information

Linear Regression Models

Linear Regression Models Liear Regressio Models Dr. Joh Mellor-Crummey Departmet of Computer Sciece Rice Uiversity johmc@cs.rice.edu COMP 528 Lecture 9 15 February 2005 Goals for Today Uderstad how to Use scatter diagrams to ispect

More information

Chapter 6: BINOMIAL PROBABILITIES

Chapter 6: BINOMIAL PROBABILITIES Charles Bocelet, Probability, Statistics, ad Radom Sigals," Oxford Uiversity Press, 016. ISBN: 978-0-19-00051-0 Chater 6: BINOMIAL PROBABILITIES Sectios 6.1 Basics of the Biomial Distributio 6. Comutig

More information

IE 230 Probability & Statistics in Engineering I. Closed book and notes. No calculators. 120 minutes.

IE 230 Probability & Statistics in Engineering I. Closed book and notes. No calculators. 120 minutes. Closed book ad otes. No calculators. 120 miutes. Cover page, five pages of exam, ad tables for discrete ad cotiuous distributios. Score X i =1 X i / S X 2 i =1 (X i X ) 2 / ( 1) = [i =1 X i 2 X 2 ] / (

More information

X. Perturbation Theory

X. Perturbation Theory X. Perturbatio Theory I perturbatio theory, oe deals with a ailtoia that is coposed Ĥ that is typically exactly solvable of two pieces: a referece part ad a perturbatio ( Ĥ ) that is assued to be sall.

More information

PUTNAM TRAINING PROBABILITY

PUTNAM TRAINING PROBABILITY PUTNAM TRAINING PROBABILITY (Last udated: December, 207) Remark. This is a list of exercises o robability. Miguel A. Lerma Exercises. Prove that the umber of subsets of {, 2,..., } with odd cardiality

More information

Chapter 20. Comparing Two Proportions. BPS - 5th Ed. Chapter 20 1

Chapter 20. Comparing Two Proportions. BPS - 5th Ed. Chapter 20 1 Chapter 0 Comparig Two Proportios BPS - 5th Ed. Chapter 0 Case Study Machie Reliability A study is performed to test of the reliability of products produced by two machies. Machie A produced 8 defective

More information

Discrete Mathematics for CS Spring 2008 David Wagner Note 22

Discrete Mathematics for CS Spring 2008 David Wagner Note 22 CS 70 Discrete Mathematics for CS Sprig 2008 David Wager Note 22 I.I.D. Radom Variables Estimatig the bias of a coi Questio: We wat to estimate the proportio p of Democrats i the US populatio, by takig

More information

Chapter 6 Sampling Distributions

Chapter 6 Sampling Distributions Chapter 6 Samplig Distributios 1 I most experimets, we have more tha oe measuremet for ay give variable, each measuremet beig associated with oe radomly selected a member of a populatio. Hece we eed to

More information

The Binomial Multi-Section Transformer

The Binomial Multi-Section Transformer 4/15/2010 The Bioial Multisectio Matchig Trasforer preset.doc 1/24 The Bioial Multi-Sectio Trasforer Recall that a ulti-sectio atchig etwork ca be described usig the theory of sall reflectios as: where:

More information

Surveying the Variance Reduction Methods

Surveying the Variance Reduction Methods Available olie at www.scizer.co Austria Joural of Matheatics ad Statistics, Vol 1, Issue 1, (2017): 10-15 ISSN 0000-0000 Surveyig the Variace Reductio Methods Arash Mirtorabi *1, Gholahossei Gholai 2 1.

More information

STOCHASTIC NETWORKS EXAMPLE SHEET 2 SOLUTIONS

STOCHASTIC NETWORKS EXAMPLE SHEET 2 SOLUTIONS STOCHASTIC NETWORKS EXAMPLE SHEET 2 SOLUTIONS ELENA YUDOVINA Exercise. Show that the traffic equatios for a ope migratio process have a uique solutio, ad that this solutio is positive. [Hit: From the irreducibility

More information

19.1 The dictionary problem

19.1 The dictionary problem CS125 Lecture 19 Fall 2016 19.1 The dictioary proble Cosider the followig data structural proble, usually called the dictioary proble. We have a set of ites. Each ite is a (key, value pair. Keys are i

More information

Statistical Analysis on Uncertainty for Autocorrelated Measurements and its Applications to Key Comparisons

Statistical Analysis on Uncertainty for Autocorrelated Measurements and its Applications to Key Comparisons Statistical Aalysis o Ucertaity for Autocorrelated Measuremets ad its Applicatios to Key Comparisos Nie Fa Zhag Natioal Istitute of Stadards ad Techology Gaithersburg, MD 0899, USA Outlies. Itroductio.

More information

Statisticians use the word population to refer the total number of (potential) observations under consideration

Statisticians use the word population to refer the total number of (potential) observations under consideration 6 Samplig Distributios Statisticias use the word populatio to refer the total umber of (potetial) observatios uder cosideratio The populatio is just the set of all possible outcomes i our sample space

More information

Hypothesis tests and confidence intervals

Hypothesis tests and confidence intervals Hypothesis tests ad cofidece itervals The 95% cofidece iterval for µ is the set of values, µ 0, such that the ull hypothesis H 0 : µ = µ 0 would ot be rejected by a two-sided test with α = 5%. The 95%

More information

Stat 200 -Testing Summary Page 1

Stat 200 -Testing Summary Page 1 Stat 00 -Testig Summary Page 1 Mathematicias are like Frechme; whatever you say to them, they traslate it ito their ow laguage ad forthwith it is somethig etirely differet Goethe 1 Large Sample Cofidece

More information

ECE534, Spring 2018: Final Exam

ECE534, Spring 2018: Final Exam ECE534, Srig 2018: Fial Exam Problem 1 Let X N (0, 1) ad Y N (0, 1) be ideedet radom variables. variables V = X + Y ad W = X 2Y. Defie the radom (a) Are V, W joitly Gaussia? Justify your aswer. (b) Comute

More information

THE GREATEST ORDER OF THE DIVISOR FUNCTION WITH INCREASING DIMENSION

THE GREATEST ORDER OF THE DIVISOR FUNCTION WITH INCREASING DIMENSION MATHEMATICA MONTISNIGRI Vol XXVIII (013) 17-5 THE GREATEST ORDER OF THE DIVISOR FUNCTION WITH INCREASING DIMENSION GLEB V. FEDOROV * * Mechaics ad Matheatics Faculty Moscow State Uiversity Moscow, Russia

More information