Queuing Theory. Basic properties, Markovian models, Networks of queues, General service time distributions, Finite source models, Multiserver queues
|
|
- Janel Lawrence
- 5 years ago
- Views:
Transcription
1 Queuig Theory Basic properties, Markovia models, Networks of queues, Geeral service time distributios, Fiite source models, Multiserver queues Chapter 8
2 Kedall s Notatio for Queuig Systems A/B/X/Y/Z: A = iterarrival time distributio B = service time distributio G = geeral (i.e., ot specified); M = Markovia (expoetial); D = determiistic X = umber of parallel service chaels Y = limit o system pop. (i queue + i service); default is Z = queue disciplie; default is FCFS (first come first served) Others are LCFS, radom, priority Chapter 8 2
3 Radom variables: Other Notatio X(t) = Number of customers i the system at time t S = Service time of a arbitrary customer W* = Amout of time a arbitrary customer speds i the system W Q * = Amout of time a arbitrary customer speds waitig for service Ofte we are most iterested i the averages or expectatios: S ( ) L= E X t LQ = Average umber i the queue L = Average umber i service Q [ *] W = E W W = E WQ* Chapter 8 3
4 Little s Formula w * is the time spet i the system by the th customer. Assume these k system times are uiformly fiite ad let w= lim k k w * = be the customer average time spet i the system. s Also, let X = lim s s X( t) dt 0 be the time average umber of jobs i the system. The uder very geeral coditios, X = λaw where λ a is the arrival rate. This is usually writte L = λ a W. The mea umber of customers i the system is proportioal to the mea time i the system! Chapter 8 4
5 Heuristic Proof of Little s Formula B(t) = cum. area betwee curves A(t) D(t) Two ways to compute BT ( ) = w * = X( tdt ) = 0 Mea time i system i (0,T): = = Mea umber i system i (0,T): XT ( ) = BT ( ) T The N T Chapter 8 5 T WT ( ) BT ( ) N BT ( ) AT ( ) BT ( ) AT ( ) lim X ( T) = lim = lim λ ( T) W( T), or L= λaw T T AT ( ) T T
6 Other Little s Formulae I queue: LQ = λawq I service: L = λ E S S [ ] ad their implicatios a [ ] Expected umber of busy servers LS = λae S ρ Expected umber of idle servers # servers ρ Sigle server utilizatio LS = λae[ S] = ρ Sigle server prob. of empty system ρ Chapter 8 6
7 Observatio Times { } P = lim t P X( t) =, = 0,,... a = Proportio of arrivig customers that fid i the system d = Proportio of departig customers that leave behid i the system If customers arrive oe at a time ad are served oe at a time the a = d But these proportios may ot match the limitig probability of havig i the system (log ru proportio of time that are i the system) However, if arrivals follow a Poisso process the a = P This is kow as PASTA (Poisso Arrivals See Time Averages) Chapter 8 7
8 M/M/ Model Sigle server, Poisso arrivals (rate λ), expoetial service times (rate µ) CTMC (birth-death) model: Chapter 8 8
9 M/M/ Steady-State Probabilities Level-crossig equatios: Solve for P i terms of P 0 { } P = lim P X( t) =, = 0,,... t λ P = µ P +, = 0,, P ( λ ) µ P0,,2, = = The use the facts that P 0 =, r = ( r) if r < = = 0 ad substitute ρ = λ / µ to get = ρ ( ρ), = 0,, if ρ < P Chapter 8 9
10 M/M/ Performace Measures Steady-state expected umber of customers i the system Mea time i system Mea time i queue Mea umber i queue ρ L= P, if 0 = ρ < = ρ W L = = = by Little's Formula λ µ ( ρ ) µ λ a W L Q Q = W = λw Q λ = µ µ µ -λ = 2 λ µ µλ ( ) ( - ) Chapter 8 0
11 M/M/ Performace Measures Distributio of time i system (FCFS) PW [ * x] = a PW [ * x arrival sees customers] = 0 = 0 = ( ρρ ) PW [ * x W* gamma( +, µ )] µ x l µ ( ρ) x ( ρρ ) e ( µ x) l! e, x 0 = 0 l= + = = Expoetial with parameter µ(-ρ) Reversibility: Departure process is Poisso with rate λ Chapter 8
12 Fiite Capacity: M/M//N Model Sigle server, expoetial service times (rate µ) Poisso arrivals (rate λ) as log as there are N i the system CTMC (birth-death) model: Chapter 8 2
13 M/M//N Steady-State Probabilities { } P = lim P X( t) =, = 0,,... t Level-crossig equatios: λ P = µ P +, = 0,,, N Solve for P i terms of P 0 The use the facts that N + N r P, (ote: eed ot be < ) 0 = r r = = = 0 r to get ( λµ ) ( λµ ) N ( λµ ) + P =, = 0,,, N Chapter 8 3
14 M/M//N Performace Measures (I the ulikely evet that λ = µ, for =,, N, ( ) P = P0 = N + ) Steady-state expected umber of customers i the system, L, has a messy closed form L Mea time i system W = by Little's Formula λ but here, λ a is the rate of arrival ito the system WQ W µ a = = λ ( ) L P W Q N Q λ a ( P ) = λ N Chapter 8 4
15 Tadem Queue λ µ µ 2 If arrivals to the first server follow a Poisso process ad service times are expoetial, the arrivals to the secod server also follow a Poisso process ad the two queues behave as idepedet M/M/ systems: P{ customers at server ad m customers at server 2} = λ λ λ λ µ µ µ µ 2 2 m Chapter 8 5
16 Ope Network of Queues k servers, customers arrive at server k from outside the system accordig to a Poisso process with rate r k, idepedet of the other servers Upo completig service at server i, customer goes to server j with probability P ij, where P j ij k For j =,, k, the total arrival rate to server j is λ r i= The umber of customers at each server is idepedet ad λ j If λ j < µ j for all j, the P{ customers at server j} that is, each acts like a idepedet M/M/ queue! = + λ P j j i ij λ j = µ j µ j Chapter 8 6
17 Closed Queuig Network m customers move amog k servers Upo completig service at server i, customer goes to server j with probability P ij, where P = j ij Let π be the statioary probabilities for the Markov chai describig the sequece of servers visited by a customer: k = = π π P, π j i ij j i= j= k The the probability distributio of the umber at each server is j k π k j Pm(, 2,..., k) = Cm if j = m j= µ j j= Chapter 8 7
18 CQN Performace Computatio of the ormalizig costat C m to get the statioary distributio ca be legthy; but may be mostly j iterested i the throughput λm = ( ) j = λ m j where λ m (j) is the arrival rate to (ad departure rate from) j. Arrival Theorem: I the CQN with m customers, the system as see by arrivals to server j has the same distributio as the whole system whe it cotais oly m- customers. This leads to mea value aalysis to fid λ m (j) alog with W m (j) = the average time a customer speds at server j, ad L m (j) = the average umber of customers at server j. Chapter 8 8
19 Mea Value Aalysis Solve iteratively: W m ( j) = + Lm µ j ( j) ( ) ( ) ( ), where ( ) L j = λ j W j λ j = π λ m m m m j m Begi with W ( j) λ m = µ j k i= m = throughput π W i m () i Chapter 8 9
20 M/G/ Best combiatio of tractability & usefuless Assumptio of Poisso arrivals may be reasoable based o Poisso approximatio to biomial distributio may potetial customers decide idepedetly about arrivig (arrival = success ), - each has small probability of arrivig i ay particular time iterval Probability of arrival i a small iterval is approximately proportioal to the legth of the iterval o bulk arrivals Amout of time sice last arrival gives o idicatio of amout of time util the ext arrival (expoetial memoryless) Chapter 8 20
21 M/G/ Best combiatio of tractability & usefuless Expoetial distributio is frequetly a bad model for service times memorylessess large probability of very short service times with occasioal very log service times May ot wat to use oe of the stadard distributios for service times, either i a real situatio, collect data o service times ad fit a empirical distributio Distributios of umber of customers i the system ad waitig time deped o service time distributio to be specified Chapter 8 2
22 M/G/ Best combiatio of tractability & usefuless Assumptio of Poisso arrivals may be reasoable based o Poisso approximatio to biomial distributio may potetial customers decide idepedetly about arrivig (arrival = success ), - each has small probability of arrivig i ay particular time iterval - Distributios of umber of customers i the system ad waitig time deped o service time distributio Chapter 8 22
23 M/G/ Performace How may customers? How much time? S is the legth of a arbitrary service time (radom variable) λ is the arrival rate of customers; defie ρ = λe[s] ad assume it is <. Expected values ca be foud from geeralizig Little s formula from # customers i the system to amout of work i the system: A arrivig customer brigs S time uits of work: The time average amout of work i the system (V) = λ * the customer average amout of work remaiig i the system Chapter 8 23
24 Work Cotet W Q * is the (radom variable) waitig time i queue Expected amout of work per customer is S * E SWQ + ( S x) dx 0 Work remaiig 2 E S * = E SW Q + 2 Eter Begi Depart If a customer s service time service is idepedet of ow wait i queue, get average work i system 2 λe S * V = λe[ S] E W Q + 2 S Chapter 8 24
25 Mea waitig time W Q = Customer mea waitig time = average work i the system whe a customer arrives From PASTA, W Q = V. Therefore, (Pollaczek-Khitchie formula) 2 2 λe S λe S WQ = λe[ S] WQ + W Q = 2 2 Ad the other measures of performace are: [ ] ( λe S ) [ ] ( λe S ) 2 2 λ E S LQ = λwq =, W = WQ + E[ S], L= λw 2 Chapter 8 25
26 Priority Queues Differet types of customers may differ i importace. Type i customers arrive accordig to a Poisso process with rate λ i ad require service times with distributio G i, i =, 2. Type customers have (opreemptive) priority: service does ot begi o a type 2 customer if there is a type customer waitig. If a type customer arrives durig a type 2 service, the service is cotiued to completio. What is the average wait i queue of a type i customer, i W Q Chapter 8 26
27 Two customer types w/o priority λ λ2 M/G/ model with λ = λ+ λ2 G x = G x + G2 x λ λ Average work i system is ( 2 2 ( ) ( ) ) 2 λe S λ λ λ E S λ2 λ E S + 2 V = = 2 λe S 2 λ λ λ E S + λ λ E S = ( [ ]) λ 2 2 E S + λ2e S2 ( λe[ S] λ2e[ S2] ) 2 ( ) ( ) ( ) (( ) [ ] ( 2 ) [ 2] ) ( ) If the server is ot allowed to be idle whe the system is ot empty, this quatity is the same for the system with priority. Chapter 8 27
28 Two customer types with priority Let V i be the average amout of type i work i the system 2 i i i i V ie[ Si] W λ E S = λ Q + 2 i queue i service i V Q Now focus o a type customer. Waitig time = amt. of type work i system + amt. of type 2 work i service whe this customer arrives, so 2 2 E S 2E S 2 2 WQ V VS E[ S] W λ λ = + = λ Q i V S Chapter 8 28
29 Two customer types with priority W Q 2 2 λe S + λ2e S 2 = if λe[ S] < 2 [ ] ( λ E S ) But a type 2 customer has to wait for everyoe ahead, plus ay type customers who arrive durig the type 2 wait, so [ ] W = V + λ E S W W = Q Q Q 2 2 λe S λ2e S [ ] [ ] λe[ S ] λ E[ S ] ( λe S λ E S )( λ E[ S ]) 2 2 if + < 2 2 Chapter 8 29
30 M/M/k Model k idetical machies i parallel, Poisso arrivals (rate λ), expoetial service times (rate µ) CTMC (birth-death) model: Chapter 8 30
31 M/M/k Steady-State Probabilities Level-crossig equatios: λ P = ( + ) µ P+, = 0,,..., k λ P = kµ P, = k, k+,... + Defie ρ=λ/kµ, solve for P i terms of P 0 P ( kρ )! P0, = 0,,..., k = k k ρ k! P0, = k+, k+ 2,... P =, r = ( r) if r < The use the facts that = 0 = 0 to get k k ( kρ) ( kρ) P0 = + if ρ = 0 <! ( ρ) k! ρ is the utilizatio of each server Chapter 8 3
32 M/M/k Performace Measures Steady-state expected umber of customers i the system Mea flow time k ( kρ) ρ L= P 0 = kρ+ P 2 0, if ρ = < k! ( ρ) k L ( kρ) W = = + P0 by Little's Formula λ µ kµ - λ k!( ρ) Expected waitig time WQ = W µ Expected umber i the queue (kρ is expected umber of busy servers) L = λw = L kρ Q Q Chapter 8 32
33 Erlag Loss System M/M/k/k system: k servers ad a capacity of k: a arrival who fids all servers busy does ot eter the system (is lost) ( kρ) P = P0, = 0,,..., k! i ( kρ) k ( kρ) Pi = 0, i = 0,..., k = i!! Above is called Erlag s loss formula, ad it holds for M/G/k/k as well, if kρ = λe S [ ] Chapter 8 33
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 informationB. 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 informationCS/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 informationSimulation 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 informationA 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 informationAnnouncements. 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 informationTCOM 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 informationReliability 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 informationSINGLE-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 informationTUFTS 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 informationIntroduction 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 informationLimit 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 informationGeneralized 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 informationDiscrete 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 informationhttp://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 information4.6 M/M/s/s Loss Queueing Model
4.6 M/M// Lo Queueig Model Characteritic 1. Iterarrival time i expoetial with rate Arrival proce i Poio Proce with rate 2. Iterarrival time i expoetial with rate µ Number of ervice i Poio Proce with rate
More informationApproximations 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 informationMATH 320: Probability and Statistics 9. Estimation and Testing of Parameters. Readings: Pruim, Chapter 4
MATH 30: Probability ad Statistics 9. Estimatio ad Testig of Parameters Estimatio ad Testig of Parameters We have bee dealig situatios i which we have full kowledge of the distributio of a radom variable.
More informationThe 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 informationOn Poisson Bulk Arrival Queue: M / M /2/ N with. Balking, Reneging and Heterogeneous servers
Applied Mathematical Scieces, Vol., 008, o. 4, 69-75 O oisso Bulk Arrival Queue: M / M // with Balkig, Reegig ad Heterogeeous servers M. S. El-aoumy Statistics Departmet, Faculty of Commerce, Dkhlia, Egypt
More informationThe coalescent coalescence theory
The coalescet coalescece theory Peter Beerli September 1, 009 Historical ote Up to 198 most developmet i populatio geetics was prospective ad developed expectatios based o situatios of today. Most work
More informationIncreasing timing capacity using packet coloring
003 Coferece o Iformatio Scieces ad Systems, The Johs Hopkis Uiversity, March 4, 003 Icreasig timig capacity usig packet colorig Xi Liu ad R Srikat[] Coordiated Sciece Laboratory Uiversity of Illiois e-mail:
More informationChapter 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 information4. Partial Sums and the Central Limit Theorem
1 of 10 7/16/2009 6:05 AM Virtual Laboratories > 6. Radom Samples > 1 2 3 4 5 6 7 4. Partial Sums ad the Cetral Limit Theorem The cetral limit theorem ad the law of large umbers are the two fudametal theorems
More informationCS284A: Representations and Algorithms in Molecular Biology
CS284A: Represetatios ad Algorithms i Molecular Biology Scribe Notes o Lectures 3 & 4: Motif Discovery via Eumeratio & Motif Represetatio Usig Positio Weight Matrix Joshua Gervi Based o presetatios by
More informationBirth-Death Processes. Outline. EEC 686/785 Modeling & Performance Evaluation of Computer Systems. Relationship Among Stochastic Processes.
EEC 686/785 Modelig & Perforace Evaluatio of Couter Systes Lecture Webig Zhao Deartet of Electrical ad Couter Egieerig Clevelad State Uiversity webig@ieee.org based o Dr. Raj jai s lecture otes Relatioshi
More informationB. 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 informationDiscrete Mathematics and Probability Theory Summer 2014 James Cook Note 15
CS 70 Discrete Mathematics ad Probability Theory Summer 2014 James Cook Note 15 Some Importat Distributios I this ote we will itroduce three importat probability distributios that are widely used to model
More informationChapter 3. Strong convergence. 3.1 Definition of almost sure convergence
Chapter 3 Strog covergece As poited out i the Chapter 2, there are multiple ways to defie the otio of covergece of a sequece of radom variables. That chapter defied covergece i probability, covergece i
More informationNOTES ON DISTRIBUTIONS
NOTES ON DISTRIBUTIONS MICHAEL N KATEHAKIS Radom Variables Radom variables represet outcomes from radom pheomea They are specified by two objects The rage R of possible values ad the frequecy fx with which
More informationCEE 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 informationThe 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 informationDiscrete Mathematics and Probability Theory Spring 2012 Alistair Sinclair Note 15
CS 70 Discrete Mathematics ad Probability Theory Sprig 2012 Alistair Siclair Note 15 Some Importat Distributios The first importat distributio we leared about i the last Lecture Note is the biomial distributio
More informationPRACTICE PROBLEMS FOR THE FINAL
PRACTICE PROBLEMS FOR THE FINAL Math 36Q Fall 25 Professor Hoh Below is a list of practice questios for the Fial Exam. I would suggest also goig over the practice problems ad exams for Exam ad Exam 2 to
More informationQueueing 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 informationc. Explain the basic Newsvendor model. Why is it useful for SC models? e. What additional research do you believe will be helpful in this area?
1. Research Methodology a. What is meat by the supply chai (SC) coordiatio problem ad does it apply to all types of SC s? Does the Bullwhip effect relate to all types of SC s? Also does it relate to SC
More informationLecture 6: Coupon Collector s problem
Radomized Algorithms Lecture 6: Coupo Collector s problem Sotiris Nikoletseas Professor CEID - ETY Course 2017-2018 Sotiris Nikoletseas, Professor Radomized Algorithms - Lecture 6 1 / 16 Variace: key features
More informationLecture 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 informationSimulation. Two Rule For Inverting A Distribution Function
Simulatio Two Rule For Ivertig A Distributio Fuctio Rule 1. If F(x) = u is costat o a iterval [x 1, x 2 ), the the uiform value u is mapped oto x 2 through the iversio process. Rule 2. If there is a jump
More informationThe 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 informationLecture 5: April 17, 2013
TTIC/CMSC 350 Mathematical Toolkit Sprig 203 Madhur Tulsiai Lecture 5: April 7, 203 Scribe: Somaye Hashemifar Cheroff bouds recap We recall the Cheroff/Hoeffdig bouds we derived i the last lecture idepedet
More informationLecture 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 informationChapter 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 informationAn Introduction to Randomized Algorithms
A Itroductio to Radomized Algorithms The focus of this lecture is to study a radomized algorithm for quick sort, aalyze it usig probabilistic recurrece relatios, ad also provide more geeral tools for aalysis
More informationAnalysis of a queueing model with service threshold
Rochester Istitute of Techology RIT Scholar Works Theses Thesis/Dissertatio Collectios 2-7-2 alysis of a queueig model with service threshold Kathry Graf Follow this ad additioal works at: http://scholarworks.rit.edu/theses
More informationDiscrete 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 information1 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 informationLecture 2: April 3, 2013
TTIC/CMSC 350 Mathematical Toolkit Sprig 203 Madhur Tulsiai Lecture 2: April 3, 203 Scribe: Shubhedu Trivedi Coi tosses cotiued We retur to the coi tossig example from the last lecture agai: Example. Give,
More informationMassachusetts Institute of Technology
6.0/6.3: Probabilistic Systems Aalysis (Fall 00) Problem Set 8: Solutios. (a) We cosider a Markov chai with states 0,,, 3,, 5, where state i idicates that there are i shoes available at the frot door i
More informationThis section is optional.
4 Momet Geeratig Fuctios* This sectio is optioal. The momet geeratig fuctio g : R R of a radom variable X is defied as g(t) = E[e tx ]. Propositio 1. We have g () (0) = E[X ] for = 1, 2,... Proof. Therefore
More informationFinal 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 informationWeight Moving Average = n
1 Forecastig Simple Movig Average- F = 1 N (D + D 1 + D 2 + D 3 + ) Movig Weight Average- Weight Movig Average = W id i i=1 W i Sigle (Simple) Expoetial Smoothig- F t = F t 1 + α(d t 1 F t 1 ) or F t =
More informationPRACTICE PROBLEMS FOR THE FINAL
PRACTICE PROBLEMS FOR THE FINAL Math 36Q Sprig 25 Professor Hoh Below is a list of practice questios for the Fial Exam. I would suggest also goig over the practice problems ad exams for Exam ad Exam 2
More informationSTAT 515 fa 2016 Lec Sampling distribution of the mean, part 2 (central limit theorem)
STAT 515 fa 2016 Lec 15-16 Samplig distributio of the mea, part 2 cetral limit theorem Karl B. Gregory Moday, Sep 26th Cotets 1 The cetral limit theorem 1 1.1 The most importat theorem i statistics.............
More information6. Uniform distribution mod 1
6. Uiform distributio mod 1 6.1 Uiform distributio ad Weyl s criterio Let x be a seuece of real umbers. We may decompose x as the sum of its iteger part [x ] = sup{m Z m x } (i.e. the largest iteger which
More informationStatistics 511 Additional Materials
Cofidece Itervals o mu Statistics 511 Additioal Materials This topic officially moves us from probability to statistics. We begi to discuss makig ifereces about the populatio. Oe way to differetiate probability
More information1 Inferential Methods for Correlation and Regression Analysis
1 Iferetial Methods for Correlatio ad Regressio Aalysis I the chapter o Correlatio ad Regressio Aalysis tools for describig bivariate cotiuous data were itroduced. The sample Pearso Correlatio Coefficiet
More informationKurskod: TAMS11 Provkod: TENB 21 March 2015, 14:00-18:00. English Version (no Swedish Version)
Kurskod: TAMS Provkod: TENB 2 March 205, 4:00-8:00 Examier: Xiagfeg Yag (Tel: 070 2234765). Please aswer i ENGLISH if you ca. a. You are allowed to use: a calculator; formel -och tabellsamlig i matematisk
More informationQueueing 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 information6.041/6.431 Spring 2009 Final Exam Thursday, May 21, 1:30-4:30 PM.
6.041/6.431 Sprig 2009 Fial Exam Thursday, May 21, 1:30-4:30 PM. Name: Recitatio Istructor: Questio Part Score Out of 0 2 1 all 18 2 all 24 3 a 4 b 4 c 4 4 a 6 b 6 c 6 5 a 6 b 6 6 a 4 b 4 c 4 d 5 e 5 7
More informationBinomial Distribution
0.0 0.5 1.0 1.5 2.0 2.5 3.0 0 1 2 3 4 5 6 7 0.0 0.5 1.0 1.5 2.0 2.5 3.0 Overview Example: coi tossed three times Defiitio Formula Recall that a r.v. is discrete if there are either a fiite umber of possible
More informationThere 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 informationProbability 2 - Notes 10. Lemma. If X is a random variable and g(x) 0 for all x in the support of f X, then P(g(X) 1) E[g(X)].
Probability 2 - Notes 0 Some Useful Iequalities. Lemma. If X is a radom variable ad g(x 0 for all x i the support of f X, the P(g(X E[g(X]. Proof. (cotiuous case P(g(X Corollaries x:g(x f X (xdx x:g(x
More information(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 informationProblems from 9th edition of Probability and Statistical Inference by Hogg, Tanis and Zimmerman:
Math 224 Fall 2017 Homework 4 Drew Armstrog Problems from 9th editio of Probability ad Statistical Iferece by Hogg, Tais ad Zimmerma: Sectio 2.3, Exercises 16(a,d),18. Sectio 2.4, Exercises 13, 14. Sectio
More informationGoodness-of-Fit Tests and Categorical Data Analysis (Devore Chapter Fourteen)
Goodess-of-Fit Tests ad Categorical Data Aalysis (Devore Chapter Fourtee) MATH-252-01: Probability ad Statistics II Sprig 2019 Cotets 1 Chi-Squared Tests with Kow Probabilities 1 1.1 Chi-Squared Testig................
More informationRandom Matrices with Blocks of Intermediate Scale Strongly Correlated Band Matrices
Radom Matrices with Blocks of Itermediate Scale Strogly Correlated Bad Matrices Jiayi Tog Advisor: Dr. Todd Kemp May 30, 07 Departmet of Mathematics Uiversity of Califoria, Sa Diego Cotets Itroductio Notatio
More informationDistribution of Random Samples & Limit theorems
STAT/MATH 395 A - PROBABILITY II UW Witer Quarter 2017 Néhémy Lim Distributio of Radom Samples & Limit theorems 1 Distributio of i.i.d. Samples Motivatig example. Assume that the goal of a study is to
More informationDiscrete Mathematics for CS Spring 2007 Luca Trevisan Lecture 22
CS 70 Discrete Mathematics for CS Sprig 2007 Luca Trevisa Lecture 22 Aother Importat Distributio The Geometric Distributio Questio: A biased coi with Heads probability p is tossed repeatedly util the first
More information7.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 informationSTOCHASTIC 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 informationRandom Models. Tusheng Zhang. February 14, 2013
Radom Models Tusheg Zhag February 14, 013 1 Radom Walks Let me describe the model. Radom walks are used to describe the motio of a movig particle (object). Suppose that a particle (object) moves alog the
More informationSample Size Estimation in the Proportional Hazards Model for K-sample or Regression Settings Scott S. Emerson, M.D., Ph.D.
ample ie Estimatio i the Proportioal Haards Model for K-sample or Regressio ettigs cott. Emerso, M.D., Ph.D. ample ie Formula for a Normally Distributed tatistic uppose a statistic is kow to be ormally
More informationLecture 12: November 13, 2018
Mathematical Toolkit Autum 2018 Lecturer: Madhur Tulsiai Lecture 12: November 13, 2018 1 Radomized polyomial idetity testig We will use our kowledge of coditioal probability to prove the followig lemma,
More informationKLMED8004 Medical statistics. Part I, autumn Estimation. We have previously learned: Population and sample. New questions
We have previously leared: KLMED8004 Medical statistics Part I, autum 00 How kow probability distributios (e.g. biomial distributio, ormal distributio) with kow populatio parameters (mea, variace) ca give
More informationEE 4TM4: Digital Communications II Probability Theory
1 EE 4TM4: Digital Commuicatios II Probability Theory I. RANDOM VARIABLES A radom variable is a real-valued fuctio defied o the sample space. Example: Suppose that our experimet cosists of tossig two fair
More informationLecture 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 information6.3 Testing Series With Positive Terms
6.3. TESTING SERIES WITH POSITIVE TERMS 307 6.3 Testig Series With Positive Terms 6.3. Review of what is kow up to ow I theory, testig a series a i for covergece amouts to fidig the i= sequece of partial
More informationMath 155 (Lecture 3)
Math 55 (Lecture 3) September 8, I this lecture, we ll cosider the aswer to oe of the most basic coutig problems i combiatorics Questio How may ways are there to choose a -elemet subset of the set {,,,
More informationThe Poisson Process *
OpeStax-CNX module: m11255 1 The Poisso Process * Do Johso This work is produced by OpeStax-CNX ad licesed uder the Creative Commos Attributio Licese 1.0 Some sigals have o waveform. Cosider the measuremet
More informationTHE ROYAL STATISTICAL SOCIETY GRADUATE DIPLOMA STATISTICAL THEORY AND METHODS PAPER I
THE ROYAL STATISTICAL SOCIETY 5 EXAMINATIONS SOLUTIONS GRADUATE DIPLOMA STATISTICAL THEORY AND METHODS PAPER I The Society provides these solutios to assist cadidates preparig for the examiatios i future
More informationIntroduction to Extreme Value Theory Laurens de Haan, ISM Japan, Erasmus University Rotterdam, NL University of Lisbon, PT
Itroductio to Extreme Value Theory Laures de Haa, ISM Japa, 202 Itroductio to Extreme Value Theory Laures de Haa Erasmus Uiversity Rotterdam, NL Uiversity of Lisbo, PT Itroductio to Extreme Value Theory
More informationLast time: Moments of the Poisson distribution from its generating function. Example: Using telescope to measure intensity of an object
6.3 Stochastic Estimatio ad Cotrol, Fall 004 Lecture 7 Last time: Momets of the Poisso distributio from its geeratig fuctio. Gs () e dg µ e ds dg µ ( s) µ ( s) µ ( s) µ e ds dg X µ ds X s dg dg + ds ds
More informationKinetics of Complex Reactions
Kietics of Complex Reactios by Flick Colema Departmet of Chemistry Wellesley College Wellesley MA 28 wcolema@wellesley.edu Copyright Flick Colema 996. All rights reserved. You are welcome to use this documet
More informationDiscrete Mathematics for CS Spring 2005 Clancy/Wagner Notes 21. Some Important Distributions
CS 70 Discrete Mathematics for CS Sprig 2005 Clacy/Wager Notes 21 Some Importat Distributios Questio: A biased coi with Heads probability p is tossed repeatedly util the first Head appears. What is the
More informationThe Maximum-Likelihood Decoding Performance of Error-Correcting Codes
The Maximum-Lielihood Decodig Performace of Error-Correctig Codes Hery D. Pfister ECE Departmet Texas A&M Uiversity August 27th, 2007 (rev. 0) November 2st, 203 (rev. ) Performace of Codes. Notatio X,
More informationLECTURE 8: ASYMPTOTICS I
LECTURE 8: ASYMPTOTICS I We are iterested i the properties of estimators as. Cosider a sequece of radom variables {, X 1}. N. M. Kiefer, Corell Uiversity, Ecoomics 60 1 Defiitio: (Weak covergece) A sequece
More information( ) = p and P( i = b) = q.
MATH 540 Radom Walks Part 1 A radom walk X is special stochastic process that measures the height (or value) of a particle that radomly moves upward or dowward certai fixed amouts o each uit icremet of
More information4. Basic probability theory
Cotets Basic cocepts Discrete radom variables Discrete distributios (br distributios) Cotiuous radom variables Cotiuous distributios (time distributios) Other radom variables Lect04.ppt S-38.45 - Itroductio
More informationQueueing Theory (Part 3)
Queueig Theory art 3 M/M/ Queueig Sytem with Variatio M/M/, M/M///K, M/M//// Queueig Theory- M/M/ Queueig Sytem We defie λ mea arrival rate mea ervice rate umber of erver > ρ λ / utilizatio ratio We require
More informationEE / EEE SAMPLE STUDY MATERIAL. GATE, IES & PSUs Signal System. Electrical Engineering. Postal Correspondence Course
Sigal-EE Postal Correspodece Course 1 SAMPLE STUDY MATERIAL Electrical Egieerig EE / EEE Postal Correspodece Course GATE, IES & PSUs Sigal System Sigal-EE Postal Correspodece Course CONTENTS 1. SIGNAL
More informationLecture 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 informationSRC Technical Note June 17, Tight Thresholds for The Pure Literal Rule. Michael Mitzenmacher. d i g i t a l
SRC Techical Note 1997-011 Jue 17, 1997 Tight Thresholds for The Pure Literal Rule Michael Mitzemacher d i g i t a l Systems Research Ceter 130 Lytto Aveue Palo Alto, Califoria 94301 http://www.research.digital.com/src/
More informationThis exam contains 19 pages (including this cover page) and 10 questions. A Formulae sheet is provided with the exam.
Probability ad Statistics FS 07 Secod Sessio Exam 09.0.08 Time Limit: 80 Miutes Name: Studet ID: This exam cotais 9 pages (icludig this cover page) ad 0 questios. A Formulae sheet is provided with the
More informationA Question. Output Analysis. Example. What Are We Doing Wrong? Result from throwing a die. Let X be the random variable
A Questio Output Aalysis Let X be the radom variable Result from throwig a die 5.. Questio: What is E (X? Would you throw just oce ad take the result as your aswer? Itroductio to Simulatio WS/ - L 7 /
More informationDesign and Analysis of Algorithms
Desig ad Aalysis of Algorithms Probabilistic aalysis ad Radomized algorithms Referece: CLRS Chapter 5 Topics: Hirig problem Idicatio radom variables Radomized algorithms Huo Hogwei 1 The hirig problem
More information0, otherwise. EX = E(X 1 + X n ) = EX j = np and. Var(X j ) = np(1 p). Var(X) = Var(X X n ) =
PROBABILITY MODELS 35 10. Discrete probability distributios I this sectio, we discuss several well-ow discrete probability distributios ad study some of their properties. Some of these distributios, lie
More informationDiscrete 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 informationChapter 22. Comparing Two Proportions. Copyright 2010 Pearson Education, Inc.
Chapter 22 Comparig Two Proportios Copyright 2010 Pearso Educatio, Ic. Comparig Two Proportios Comparisos betwee two percetages are much more commo tha questios about isolated percetages. Ad they are more
More informationChapter 22. Comparing Two Proportions. Copyright 2010, 2007, 2004 Pearson Education, Inc.
Chapter 22 Comparig Two Proportios Copyright 2010, 2007, 2004 Pearso Educatio, Ic. Comparig Two Proportios Read the first two paragraphs of pg 504. Comparisos betwee two percetages are much more commo
More information