Random matrices, phase transitions & queuing theory. Raj Rao Nadakuditi
|
|
- Muriel Bond
- 6 years ago
- Views:
Transcription
1 Random matrices, phase transitions & queuing theory Raj Rao Nadakuditi Dept. of Electrical Engg. & Computer Science Joint works with Jinho Baik, Igor Markov and Mingyan Liu 1
2 Queuing theory 2
3 A fundamental problem in queuing theory F I F O 1 F I F O 2 F I F O m Job 1 Job 2 Job n Stage 1 0 Time Job 1 Job 2 Job n Stage 2 0 -idle Time Job 1 Job 2 Job n Stage 3 0 Time End-to-end latency m = # servers, n = # customers (or jobs) Objective: Characterize L(m, n) = exit time for n-th customer from m-th queue Model for production systems, multi-hop networks, pipelined computation 3
4 Why is characterizing latency important? F I F O 1 F I F O 2 F I F O m Many existing applications 0 are delay-sensitve Time Stage 1 Production systems, Streaming audio and video - particularly audio Optimal scheduling/provisioning Job 1 Job 2 delay-throughput Job n tradeoff 0 Job 1 Job 2 -idle Job n Emerging applications Stage 2 envision control and inference over large networks Telemedicine, sensor networks andjob distributed 1 Job computation 2 Job n Quality of Service 0 (QoS) guarantees important Time Stage 3 Network topology design End-to-end latency Ad-hoc, multi-hop networks prevalent (e.g. deliver interet to rural areas) Optimal placement of hops? Remote diagnosis of service bottlenecks? Statistical characterization of delay important Time 4
5 A basic model F I F O 1 F I F O 2 F I F O m Notation: Stage 1 S i = Server i {1,..., m} Stage Job 1 Job 2 C j = Customer j {1,. 0.-idle., n} Stage 2 w(i, j) = Service time for C j at S i Assumptions: Infinitely long buffer Arrival process is Poissonian with rate α Job n Job 1 Job 2 Job n w(i, j) ind. exp(1/µ i ) M/M/m queue Job 1 Job 2 Job n End-to-end latency Time Time Time Question: Average Delay? 5
6 Little s Law and average delay Informally: Avg. Time in System = Avg. # of Cust. Eff. Arrival Rate By Burke s Theorem: Consequently: P(#Cust. in Queue i = k) = ( 1 µ ) k ( ) i µi α α for k = 0, 1,... Avg.# Cust. in System = m i=1 µ i µ i α i 6
7 What Little s law says and does not say Avg.# Time in System = 1 α m i=1 µ i µ i α i Mathematically: Avg.# Time in System = lim t α(t) i=0 Time spent by Customer i α(t) α(t) = # Customers who arrived in the interval [0, t] No insights on: variance, pdf, bottleneck behavior, etc. Contrast with L(m, n) = exit time for Customer n from Server m Transient-like statistic! Computable? 7
8 What Little s law says and does not say Avg.# Time in System = 1 α m i=1 µ i µ i α i Mathematically: Avg.# Time in System = lim t α(t) i=0 Time spent by Customer i α(t) α(t) = # Customers who arrived in the interval [0, t] No insights on: variance, pdf, bottleneck behavior, etc. Contrast with L(m, n) = exit time for Customer n from Server m Transient-like statistic! Computable? Yes! - Using random matrix theory! 8
9 What makes the problem difficult? F I F O 1 F I F O 2 F I F O m Job 1 Job 2 Job n Stage 1 0 Time Job 1 Job 2 Job n Stage 2 0 -idle Time Job 1 Job 2 Job n Stage 3 0 Time End-to-end latency m = # servers, n = # customers (or jobs) Objective: Characterize L(m, n) = exit time for n-th customer from m-th queue Strong interaction between arrival and departure process no independence 9
10 New insights beyond Little s Law: Main message Latency mean and variance can be explicitly computed! Analysis reveals emergence of phase transitions Rigorous basis for statistical anomaly testing Can show that O(n 1/3 ) jobs have statistically independent latencies Extends easily to quasi-reversible networks (thanks Demos!) Analysis of queue-state dependent servicing (inspired by backpressure algorithms) Results appear to hold even for non-exponential service times Universality conjecture! All made possible due to connection with random matrix theory! 10
11 Phase transitions 11
12 A numerical example G = Gaussian random matrix G = randn(n,n) or G = sign(randn(n,n)) X n = G + G 2n X n = X n + P n P n = θ u u u is a fixed, non-random unit norm vector X n has i.i.d. zero mean, variance 1/2n entries (on off-diagonal) Question: Largest eigenvalue? Variation with θ? 12
13 One experimental realization ρ θ = 4, n = 500 Bulk obeys semi-circle law on [ 2, 2] Largest eig
14 An eigenvalue phase transition 12 λ1(xn + Pn) Theory Experiment: n = 50 Experiment: n = θ Clear phase θ = 1 with increasing n 14
15 Theorem: Consider X n = X n + θuu Phase transition prediction λ 1 ũ 1, u 2 a.s. a.s. θ + 1 θ, θ > 1 2, otherwise (1 1θ ), θ > 1 2 0, otherwise Eigenvalue result first due to Peche (2006), Peche-Feral (2007) Eigenvector result new (and derived by us) Eigenvalues and eigenvectors are biased 15
16 Phase transitions & Random matrix theory or What theory predicts the phase transition? 16
17 Definitions and assumptions Spectral measure: Eigenvalues of X n are λ 1,..., λ n : n µ X n = 1 n i=1 δ λi Assumptions: 1. µ X n a.s. µ X 2. supp µ X compactly supported on [a, b] 3. max(eig) a.s. to b 17
18 A basic signal-plus-noise model X n = θuu H + X n Assumptions: X n is symmetric with n real eigenvalues θ 1 >... > θ k > 0 X n = QΛQ where Q is a Haar distributed unitary (or orthogonal) matrix u is a unit-norm vector X n = GG will satisfy conditions 18
19 Phase transition in the eigenvalues Theorem [Benaych-Georges and N.]: As n, λ 1 ( X n ) a.s. { G 1 µ (1/θ i) if θ > θ c := 1/G µ (b + ), b otherwise, Critical threshold depends explicitly on spectral measure of noise Cauchy transform of µ: G µ (z) = 1 z y dµ(y) for z / supp µ X. 19
20 Phase transition of eigenvectors Theorem [Benaych-Georges and N.]: As n, for θ > θ c : ũ 1, u 2 a.s. 1 θi 2G µ (ρ) ρ = G 1 µ (1/θ i) is the corresponding eigenvalue limit Theorem: As n, for θ θ c : ũ 1, u a.s. 0 Eigenvalue density at edge needed of form (x b) α with α (0, 1] 20
21 Above phase transition u ũ a b ρ (a) Eigenvalue: θ > θc (b) Eigenvector: θ > θc 21
22 Below phase transition ũ u a b (c) Eigenvalue: θ θc (d) Eigenvector: θ θc 22 1
23 The queuing theory connection 23
24 Problem setup F I F O 1 F I F O 2 F I F O m Assumptions: Infinitely long buffer Stage 1 0 Job 1 Job 2 Job n Job 1 Job 2 Job n Arrival process is Poissonian 0 -idle with rate α Stage 2 w(i, j) ind. exp(1/µ i ) M/M/m queue 0 Time Objective: Compute L(m, Stage 3 n) = exit time for batch of n customers when Job 1 Job 2 Job n End-to-end latency Queues are in equilibrium before the batch of n customers arrive Time Time 24
25 Theorem [Baik & N., 2012]: The random matrix connection L(m, n) D = λ 1 (W ) W = Γ 1/2 gg Γ 1/2 + Σ 1/2 GG Σ 1/2 G is an m (n 1) matrix of i.i.d. CN(0, 1) entries g is an m 1 vector of i.i.d CN(0, 1) entries Σ = diag(1/µ 1,..., 1/µ m ) Γ = diag (1/(µ 1 α),..., 1/(µ m α)) Sanity check: α = 0, n = 1, L(m, n) = i 1/µ i g i 2 g i 2 is chi-squared with 2 d.o.f. Exponential! 25
26 Theorem [Baik & N., 2012]: The random matrix connection L(m, n) D = λ 1 (W ) W = Γ 1/2 gg Γ 1/2 + Σ 1/2 GG Σ 1/2 Rank-one-signal plus noise expect phase transition! G is an m (n 1) matrix of i.i.d. CN(0, 1) entries g is an m 1 vector of i.i.d CN(0, 1) entries Σ = diag(1/µ 1,..., 1/µ m ) Γ = diag (1/(µ 1 α),..., 1/(µ m α)) 26
27 Recall: New insight: phase transitions in queuing behavior Arrival process is Poissonian with rate α < µ i w(i, j) ind. exp(1/µ i ) M/M/m queue A critical rate: l crit = z such that i 1 (µ i z) 2 n z 2 = 0, z = l crit (0, µ min ) Theorem [Baik & N., 2012]: Case 1: 0 < l crit < α arrival rate is faster than critical rate L(m, n) is normally distributed: mean O(n), variance O(m) Case 2: l crit > µ min slowest server is slower than critical rate L(m, n) is normally distributed: mean O(n), variance O(m) Case 3: α < l crit < µ min slowest server fast enough, arrival rate slow enough L(m, n) is Tracy-Widom distributed: mean O(n) and variance O(m 2/3 ) 27
28 Tracy-Widom versus Normal TW 2 distr. PDF Normal distr
29 New insights: phase transitions and more A critical rate: l crit = z such that i 1 (µ i z) 2 n z 2 = 0, z = l crit (0, µ min ) Theorem [Baik & N., 2012]: Case 1: 0 < l crit < α arrival rate is faster than critical rate L(m, n) is normally distributed: mean O(n), variance O(m) Case 2: l crit > µ min slowest server is slower than critical rate L(m, n) is normally distributed: mean O(n), variance O(m) Case 3: α < l crit < µ min slowest server fast enough, arrival rate slow enough L(m, n) is Tracy-Widom distributed: mean O(n) and variance O(m 2/3 ) 29
30 An elementary bound: The importance of the variance scaling result var max X i i var X i Upper-bounding latency: var L(m, n) O(n) Insight 1: Upper bound matched only when there is a bottleneck! Insight 2: Realized variance is much less than upper bound! Service prov. due to upp. bound very conservative Opportunity for perf. gains or relax system specs to meet existing QoS reqs! Work with Mingyan Liu on optimal file-split.in multi-route, multi-hop ntwk 30
31 Numerical results Mean Variance m n Experiment Theory Experiment Theory Empirical mean and variance of compared to theoretical predictions. Here µ 1 =... = µ m = 1 8 = 31
32 Mean end to end latency per stage Numerical results Experiment: n = m = 80 Experiment: n = m = 1000 Theory λ Here n = m, µ 1 =... = µ m 1 = 1, µ m = 1/λ; exponential service time Regime where the bottleneck does not affect distribution! 32
33 Mean end to end latency per stage Numerical results Lognormal expt.: m = 80 Lognormal expt.: m = 320 Exponential theory Predicted stoch. phase λ = λ Here n = m, µ 1 =... = µ m 1 = 1, µ m = 1/λ; lognormal service time Conjecture: Distribution-independent limiting distribution 33
34 A fundamental recursion Notation: S i = Server i {1,..., m} C j = Customer j {1,..., n} w(i, j) = Service time for C j at S i L(i, j) = Exit time for C j from S i Fact (Glynn & Whitt, Tembe & Wolff): L(i, j) = w(i, j) + { L(i 1, j) when L(i, j 1) < L(i 1, j), L(i, j 1) when L(i, j 1) > L(i 1, j). Equivalently, L(i, j) = max{l(i 1, j), L(i, j 1)} + w(i, j) 34
35 The directed last-passage percolation problem (1,n) (m,n) (1,1) (m,1) L(m, n) = max{l(m 1, n), L(m, n 1)} + w(m, n) 35
36 The directed last-passage percolation problem (1,n) (m,n) (1,1) (m,1) L(m, n) = ( ) max w(k, l) π P (m,m) (k,l) π P (m, n) is the set of up/right paths ending at (m, n) 36
37 The random matrix connection L(m, j) = Theorem [Borodin & Peché]: Assume w(i, j) exp(1/(a i + b j )) ( ) 1 X ij CN 0, a i +b j ( ) max w(k, l) π P (m,n) (k,l) π L(m, n) D = λ 1 (XX ) Related work by Johansson (2000) Result easily extended to Poissonian (discrete) random variables 37
38 The percolation mapping for our problem C 6 µ 1 C 5 µ 1 µ 2 µ 2 µ 3 µ 3 µ 4 µ 4 µ 5 µ 5 µ 6 µ 6 µ 7 µ 7 C 4 C 3 µ 1 µ 1 µ 2 µ 2 µ 3 µ 3 µ 4 µ 4 µ 5 µ 5 µ 6 µ 6 µ 7 µ 7 C 2 C 1 µ 1 µ 2 µ 3 µ 4 µ 5 µ 6 µ 7 µ 1 α µ 2 α µ 3 α µ 4 α µ 5 α µ 6 α µ 7 α S 1 S 2 S 3 S 4 S 5 S 6 S 7 Note that queues are in equilibrium before first customer enters Queue lengths are random and have (shifted) geometric distribution First customer served at S i with rate µ i α, rest with µ i PASTA property = Poissonian Arrivals See Time Averages 38
39 Theorem [Baik & N., 2012]: Ergo the random matrix connection L(m, n) D = λ 1 (W ) W = Γ 1/2 gg Γ 1/2 + Σ 1/2 GG Σ 1/2 Rank-one-signal plus noise expect phase transition! G is an m (n 1) matrix of i.i.d. CN(0, 1) entries g is an m 1 vector of i.i.d CN(0, 1) entries Σ = diag(1/µ 1,..., 1/µ m ) Γ = diag (1/(µ 1 α),..., 1/(µ m α)) 39
40 Why the random matrix connection? 40
41 F I F O 1 F I F O 2 F I F O m Where are the non-intersecting random walks? Job 1 Job 2 Job n Stage 1 0 Time Job 1 Job 2 Job n Stage 2 0 -idle Time Job 1 Job 2 Job n Stage 3 0 Time End-to-end latency FIFO protocol means exit time trajectories do not intersect Mathematics of random walks classical probability theory Mathematics of random walks conditioned not to intersect random matrix theory 41
42 Bijection with TASEP & corner growth model 42
43 Non-interesecting random walks are everywhere! Taken from Andrei Okounkov s 2006 Fields Medal Citation 43
44 The traveling salesman problem (1,n) (m,n) (1,1) (m,1) L(m, n) = ( ) max w(k, l) π P (m,n) (k,l) π Fix w(k, l), what order of processing minimizes delay? Limits of scheduling? Application-motivated extensions of RMT! 44
45 New insights beyond Little s Law: Main message Latency mean and variance can be explicitly computed! Analysis reveals emergence of phase transitions Rigorous basis for statistical anomaly testing Can show that O(n 1/3 ) jobs have statistically independent latencies Extends easily to quasi-reversible networks (thanks Demos!) Analysis of queue-state dependent servicing (inspired by backpressure algorithms) Results appear to hold even for non-exponential service times Universality conjecture! All made possible due to connection with random matrix theory! 45
Batch latency analysis and phase transitions for a tandem of queues with exponentially distributed service times
Noname manuscript No. (will be inserted by the editor) Batch latency analysis and phase transitions for a tandem of queues with exponentially distributed service times Jinho Baik and Raj Rao Nadakuditi
More informationBatch latency analysis and phase transitions for a tandem of queues with exponentially distributed service times
Batch latency analysis and phase transitions for a tandem of queues with exponentially distributed service times Jinho Baik and Raj Rao Nadakuditi June 14, 2012 Abstract We analyze the latency or sojourn
More informationPerformance Evaluation of Queuing Systems
Performance Evaluation of Queuing Systems Introduction to Queuing Systems System Performance Measures & Little s Law Equilibrium Solution of Birth-Death Processes Analysis of Single-Station Queuing Systems
More informationConcentration Inequalities for Random Matrices
Concentration Inequalities for Random Matrices M. Ledoux Institut de Mathématiques de Toulouse, France exponential tail inequalities classical theme in probability and statistics quantify the asymptotic
More informationSolutions to Homework Discrete Stochastic Processes MIT, Spring 2011
Exercise 6.5: Solutions to Homework 0 6.262 Discrete Stochastic Processes MIT, Spring 20 Consider the Markov process illustrated below. The transitions are labelled by the rate q ij at which those transitions
More informationNon white sample covariance matrices.
Non white sample covariance matrices. S. Péché, Université Grenoble 1, joint work with O. Ledoit, Uni. Zurich 17-21/05/2010, Université Marne la Vallée Workshop Probability and Geometry in High Dimensions
More informationQueues and Queueing Networks
Queues and Queueing Networks Sanjay K. Bose Dept. of EEE, IITG Copyright 2015, Sanjay K. Bose 1 Introduction to Queueing Models and Queueing Analysis Copyright 2015, Sanjay K. Bose 2 Model of a Queue Arrivals
More informationMarkov operators, classical orthogonal polynomial ensembles, and random matrices
Markov operators, classical orthogonal polynomial ensembles, and random matrices M. Ledoux, Institut de Mathématiques de Toulouse, France 5ecm Amsterdam, July 2008 recent study of random matrix and random
More informationAnalysis of Software Artifacts
Analysis of Software Artifacts System Performance I Shu-Ngai Yeung (with edits by Jeannette Wing) Department of Statistics Carnegie Mellon University Pittsburgh, PA 15213 2001 by Carnegie Mellon University
More informationBIRTH DEATH PROCESSES AND QUEUEING SYSTEMS
BIRTH DEATH PROCESSES AND QUEUEING SYSTEMS Andrea Bobbio Anno Accademico 999-2000 Queueing Systems 2 Notation for Queueing Systems /λ mean time between arrivals S = /µ ρ = λ/µ N mean service time traffic
More informationNICTA Short Course. Network Analysis. Vijay Sivaraman. Day 1 Queueing Systems and Markov Chains. Network Analysis, 2008s2 1-1
NICTA Short Course Network Analysis Vijay Sivaraman Day 1 Queueing Systems and Markov Chains Network Analysis, 2008s2 1-1 Outline Why a short course on mathematical analysis? Limited current course offering
More informationExponential tail inequalities for eigenvalues of random matrices
Exponential tail inequalities for eigenvalues of random matrices M. Ledoux Institut de Mathématiques de Toulouse, France exponential tail inequalities classical theme in probability and statistics quantify
More informationQueueing systems. Renato Lo Cigno. Simulation and Performance Evaluation Queueing systems - Renato Lo Cigno 1
Queueing systems Renato Lo Cigno Simulation and Performance Evaluation 2014-15 Queueing systems - Renato Lo Cigno 1 Queues A Birth-Death process is well modeled by a queue Indeed queues can be used to
More informationTHE EIGENVALUES AND EIGENVECTORS OF FINITE, LOW RANK PERTURBATIONS OF LARGE RANDOM MATRICES
THE EIGENVALUES AND EIGENVECTORS OF FINITE, LOW RANK PERTURBATIONS OF LARGE RANDOM MATRICES FLORENT BENAYCH-GEORGES AND RAJ RAO NADAKUDITI Abstract. We consider the eigenvalues and eigenvectors of finite,
More informationQueueing 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 " Erlang Distribution " Hyperexponential Distribution! General Distributions " Embedded Markov Chains M/M/1 Output
More informationCPSC 531: System Modeling and Simulation. Carey Williamson Department of Computer Science University of Calgary Fall 2017
CPSC 531: System Modeling and Simulation Carey Williamson Department of Computer Science University of Calgary Fall 2017 Motivating Quote for Queueing Models Good things come to those who wait - poet/writer
More informationSimulation. Where real stuff starts
1 Simulation Where real stuff starts ToC 1. What is a simulation? 2. Accuracy of output 3. Random Number Generators 4. How to sample 5. Monte Carlo 6. Bootstrap 2 1. What is a simulation? 3 What is a simulation?
More informationLecture 20: Reversible Processes and Queues
Lecture 20: Reversible Processes and Queues 1 Examples of reversible processes 11 Birth-death processes We define two non-negative sequences birth and death rates denoted by {λ n : n N 0 } and {µ n : n
More informationApplications of random matrix theory to principal component analysis(pca)
Applications of random matrix theory to principal component analysis(pca) Jun Yin IAS, UW-Madison IAS, April-2014 Joint work with A. Knowles and H. T Yau. 1 Basic picture: Let H be a Wigner (symmetric)
More informationQueueing Theory I Summary! Little s Law! Queueing System Notation! Stationary Analysis of Elementary Queueing Systems " M/M/1 " M/M/m " M/M/1/K "
Queueing Theory I Summary Little s Law Queueing System Notation Stationary Analysis of Elementary Queueing Systems " M/M/1 " M/M/m " M/M/1/K " Little s Law a(t): the process that counts the number of arrivals
More informationMIMO Capacities : Eigenvalue Computation through Representation Theory
MIMO Capacities : Eigenvalue Computation through Representation Theory Jayanta Kumar Pal, Donald Richards SAMSI Multivariate distributions working group Outline 1 Introduction 2 MIMO working model 3 Eigenvalue
More informationData analysis and stochastic modeling
Data analysis and stochastic modeling Lecture 7 An introduction to queueing theory Guillaume Gravier guillaume.gravier@irisa.fr with a lot of help from Paul Jensen s course http://www.me.utexas.edu/ jensen/ormm/instruction/powerpoint/or_models_09/14_queuing.ppt
More informationQUEUING SYSTEM. Yetunde Folajimi, PhD
QUEUING SYSTEM Yetunde Folajimi, PhD Part 2 Queuing Models Queueing models are constructed so that queue lengths and waiting times can be predicted They help us to understand and quantify the effect of
More informationCDA5530: Performance Models of Computers and Networks. Chapter 4: Elementary Queuing Theory
CDA5530: Performance Models of Computers and Networks Chapter 4: Elementary Queuing Theory Definition Queuing system: a buffer (waiting room), service facility (one or more servers) a scheduling policy
More informationNetworking = Plumbing. Queueing Analysis: I. Last Lecture. Lecture Outline. Jeremiah Deng. 29 July 2013
Networking = Plumbing TELE302 Lecture 7 Queueing Analysis: I Jeremiah Deng University of Otago 29 July 2013 Jeremiah Deng (University of Otago) TELE302 Lecture 7 29 July 2013 1 / 33 Lecture Outline Jeremiah
More informationQueueing Theory. VK Room: M Last updated: October 17, 2013.
Queueing Theory VK Room: M1.30 knightva@cf.ac.uk www.vincent-knight.com Last updated: October 17, 2013. 1 / 63 Overview Description of Queueing Processes The Single Server Markovian Queue Multi Server
More informationUniversality of distribution functions in random matrix theory Arno Kuijlaars Katholieke Universiteit Leuven, Belgium
Universality of distribution functions in random matrix theory Arno Kuijlaars Katholieke Universiteit Leuven, Belgium SEA 06@MIT, Workshop on Stochastic Eigen-Analysis and its Applications, MIT, Cambridge,
More informationMULTIPLE CHOICE QUESTIONS DECISION SCIENCE
MULTIPLE CHOICE QUESTIONS DECISION SCIENCE 1. Decision Science approach is a. Multi-disciplinary b. Scientific c. Intuitive 2. For analyzing a problem, decision-makers should study a. Its qualitative aspects
More informationQUEUING MODELS AND MARKOV PROCESSES
QUEUING MODELS AND MARKOV ROCESSES Queues form when customer demand for a service cannot be met immediately. They occur because of fluctuations in demand levels so that models of queuing are intrinsically
More informationCover Page. The handle holds various files of this Leiden University dissertation
Cover Page The handle http://hdl.handle.net/1887/39637 holds various files of this Leiden University dissertation Author: Smit, Laurens Title: Steady-state analysis of large scale systems : the successive
More informationChapter 6 Queueing Models. Banks, Carson, Nelson & Nicol Discrete-Event System Simulation
Chapter 6 Queueing Models Banks, Carson, Nelson & Nicol Discrete-Event System Simulation Purpose Simulation is often used in the analysis of queueing models. A simple but typical queueing model: Queueing
More informationEIGENVECTOR OVERLAPS (AN RMT TALK) J.-Ph. Bouchaud (CFM/Imperial/ENS) (Joint work with Romain Allez, Joel Bun & Marc Potters)
EIGENVECTOR OVERLAPS (AN RMT TALK) J.-Ph. Bouchaud (CFM/Imperial/ENS) (Joint work with Romain Allez, Joel Bun & Marc Potters) Randomly Perturbed Matrices Questions in this talk: How similar are the eigenvectors
More informationStochastic Processes. Theory for Applications. Robert G. Gallager CAMBRIDGE UNIVERSITY PRESS
Stochastic Processes Theory for Applications Robert G. Gallager CAMBRIDGE UNIVERSITY PRESS Contents Preface page xv Swgg&sfzoMj ybr zmjfr%cforj owf fmdy xix Acknowledgements xxi 1 Introduction and review
More informationAdvanced Computer Networks Lecture 3. Models of Queuing
Advanced Computer Networks Lecture 3. Models of Queuing Husheng Li Min Kao Department of Electrical Engineering and Computer Science University of Tennessee, Knoxville Spring, 2016 1/13 Terminology of
More informationBulk scaling limits, open questions
Bulk scaling limits, open questions Based on: Continuum limits of random matrices and the Brownian carousel B. Valkó, B. Virág. Inventiones (2009). Eigenvalue statistics for CMV matrices: from Poisson
More informationSimulation. Where real stuff starts
Simulation Where real stuff starts March 2019 1 ToC 1. What is a simulation? 2. Accuracy of output 3. Random Number Generators 4. How to sample 5. Monte Carlo 6. Bootstrap 2 1. What is a simulation? 3
More informationSlides 9: Queuing Models
Slides 9: Queuing Models Purpose Simulation is often used in the analysis of queuing models. A simple but typical queuing model is: Queuing models provide the analyst with a powerful tool for designing
More informationPart I Stochastic variables and Markov chains
Part I Stochastic variables and Markov chains Random variables describe the behaviour of a phenomenon independent of any specific sample space Distribution function (cdf, cumulative distribution function)
More informationExercises Solutions. Automation IEA, LTH. Chapter 2 Manufacturing and process systems. Chapter 5 Discrete manufacturing problems
Exercises Solutions Note, that we have not formulated the answers for all the review questions. You will find the answers for many questions by reading and reflecting about the text in the book. Chapter
More informationStochastic Optimization for Undergraduate Computer Science Students
Stochastic Optimization for Undergraduate Computer Science Students Professor Joongheon Kim School of Computer Science and Engineering, Chung-Ang University, Seoul, Republic of Korea 1 Reference 2 Outline
More informationThis lecture is expanded from:
This lecture is expanded from: HIGH VOLUME JOB SHOP SCHEDULING AND MULTICLASS QUEUING NETWORKS WITH INFINITE VIRTUAL BUFFERS INFORMS, MIAMI Nov 2, 2001 Gideon Weiss Haifa University (visiting MS&E, Stanford)
More informationFluctuations of the free energy of spherical spin glass
Fluctuations of the free energy of spherical spin glass Jinho Baik University of Michigan 2015 May, IMS, Singapore Joint work with Ji Oon Lee (KAIST, Korea) Random matrix theory Real N N Wigner matrix
More informationGlossary availability cellular manufacturing closed queueing network coefficient of variation (CV) conditional probability CONWIP
Glossary availability The long-run average fraction of time that the processor is available for processing jobs, denoted by a (p. 113). cellular manufacturing The concept of organizing the factory into
More informationIntroduction to Markov Chains, Queuing Theory, and Network Performance
Introduction to Markov Chains, Queuing Theory, and Network Performance Marceau Coupechoux Telecom ParisTech, departement Informatique et Réseaux marceau.coupechoux@telecom-paristech.fr IT.2403 Modélisation
More informationAssessing the dependence of high-dimensional time series via sample autocovariances and correlations
Assessing the dependence of high-dimensional time series via sample autocovariances and correlations Johannes Heiny University of Aarhus Joint work with Thomas Mikosch (Copenhagen), Richard Davis (Columbia),
More informationDesigning load balancing and admission control policies: lessons from NDS regime
Designing load balancing and admission control policies: lessons from NDS regime VARUN GUPTA University of Chicago Based on works with : Neil Walton, Jiheng Zhang ρ K θ is a useful regime to study the
More informationIntroduction to Queueing Theory
Introduction to Queueing Theory Raj Jain Washington University in Saint Louis Jain@eecs.berkeley.edu or Jain@wustl.edu A Mini-Course offered at UC Berkeley, Sept-Oct 2012 These slides and audio/video recordings
More informationIEOR 6711, HMWK 5, Professor Sigman
IEOR 6711, HMWK 5, Professor Sigman 1. Semi-Markov processes: Consider an irreducible positive recurrent discrete-time Markov chain {X n } with transition matrix P (P i,j ), i, j S, and finite state space.
More informationQueuing Networks: Burke s Theorem, Kleinrock s Approximation, and Jackson s Theorem. Wade Trappe
Queuing Networks: Burke s Theorem, Kleinrock s Approximation, and Jackson s Theorem Wade Trappe Lecture Overview Network of Queues Introduction Queues in Tandem roduct Form Solutions Burke s Theorem What
More informationLinear Model Predictive Control for Queueing Networks in Manufacturing and Road Traffic
Linear Model Predictive Control for ueueing Networks in Manufacturing and Road Traffic Yoni Nazarathy Swinburne University of Technology, Melbourne. Joint work with: Erjen Lefeber (manufacturing), Hai
More informationQuiz 1 EE 549 Wednesday, Feb. 27, 2008
UNIVERSITY OF SOUTHERN CALIFORNIA, SPRING 2008 1 Quiz 1 EE 549 Wednesday, Feb. 27, 2008 INSTRUCTIONS This quiz lasts for 85 minutes. This quiz is closed book and closed notes. No Calculators or laptops
More informationFigure 10.1: Recording when the event E occurs
10 Poisson Processes Let T R be an interval. A family of random variables {X(t) ; t T} is called a continuous time stochastic process. We often consider T = [0, 1] and T = [0, ). As X(t) is a random variable
More informationQueueing Review. Christos Alexopoulos and Dave Goldsman 10/25/17. (mostly from BCNN) Georgia Institute of Technology, Atlanta, GA, USA
1 / 26 Queueing Review (mostly from BCNN) Christos Alexopoulos and Dave Goldsman Georgia Institute of Technology, Atlanta, GA, USA 10/25/17 2 / 26 Outline 1 Introduction 2 Queueing Notation 3 Transient
More informationComputer Networks More general queuing systems
Computer Networks More general queuing systems Saad Mneimneh Computer Science Hunter College of CUNY New York M/G/ Introduction We now consider a queuing system where the customer service times have a
More informationProgress in the method of Ghosts and Shadows for Beta Ensembles
Progress in the method of Ghosts and Shadows for Beta Ensembles Alan Edelman (MIT) Alex Dubbs (MIT) and Plamen Koev (SJS) Oct 8, 2012 1/47 Wishart Matrices (arbitrary covariance) G=mxn matrix of Gaussians
More informationA TANDEM QUEUE WITH SERVER SLOW-DOWN AND BLOCKING
Stochastic Models, 21:695 724, 2005 Copyright Taylor & Francis, Inc. ISSN: 1532-6349 print/1532-4214 online DOI: 10.1081/STM-200056037 A TANDEM QUEUE WITH SERVER SLOW-DOWN AND BLOCKING N. D. van Foreest
More informationQueueing Review. Christos Alexopoulos and Dave Goldsman 10/6/16. (mostly from BCNN) Georgia Institute of Technology, Atlanta, GA, USA
1 / 24 Queueing Review (mostly from BCNN) Christos Alexopoulos and Dave Goldsman Georgia Institute of Technology, Atlanta, GA, USA 10/6/16 2 / 24 Outline 1 Introduction 2 Queueing Notation 3 Transient
More informationReconstruction in the Generalized Stochastic Block Model
Reconstruction in the Generalized Stochastic Block Model Marc Lelarge 1 Laurent Massoulié 2 Jiaming Xu 3 1 INRIA-ENS 2 INRIA-Microsoft Research Joint Centre 3 University of Illinois, Urbana-Champaign GDR
More informationNear extreme eigenvalues and the first gap of Hermitian random matrices
Near extreme eigenvalues and the first gap of Hermitian random matrices Grégory Schehr LPTMS, CNRS-Université Paris-Sud XI Sydney Random Matrix Theory Workshop 13-16 January 2014 Anthony Perret, G. S.,
More informationNon Markovian Queues (contd.)
MODULE 7: RENEWAL PROCESSES 29 Lecture 5 Non Markovian Queues (contd) For the case where the service time is constant, V ar(b) = 0, then the P-K formula for M/D/ queue reduces to L s = ρ + ρ 2 2( ρ) where
More informationIntroduction to Queueing Theory
Introduction to Queueing Theory Raj Jain Washington University in Saint Louis Saint Louis, MO 63130 Jain@cse.wustl.edu Audio/Video recordings of this lecture are available at: 30-1 Overview Queueing Notation
More informationQueueing Theory and Simulation. Introduction
Queueing Theory and Simulation Based on the slides of Dr. Dharma P. Agrawal, University of Cincinnati and Dr. Hiroyuki Ohsaki Graduate School of Information Science & Technology, Osaka University, Japan
More informationKendall notation. PASTA theorem Basics of M/M/1 queue
Elementary queueing system Kendall notation Little s Law PASTA theorem Basics of M/M/1 queue 1 History of queueing theory An old research area Started in 1909, by Agner Erlang (to model the Copenhagen
More informationElementary queueing system
Elementary queueing system Kendall notation Little s Law PASTA theorem Basics of M/M/1 queue M/M/1 with preemptive-resume priority M/M/1 with non-preemptive priority 1 History of queueing theory An old
More informationIntro Refresher Reversibility Open networks Closed networks Multiclass networks Other networks. Queuing Networks. Florence Perronnin
Queuing Networks Florence Perronnin Polytech Grenoble - UGA March 23, 27 F. Perronnin (UGA) Queuing Networks March 23, 27 / 46 Outline Introduction to Queuing Networks 2 Refresher: M/M/ queue 3 Reversibility
More informationMulti Stage Queuing Model in Level Dependent Quasi Birth Death Process
International Journal of Statistics and Systems ISSN 973-2675 Volume 12, Number 2 (217, pp. 293-31 Research India Publications http://www.ripublication.com Multi Stage Queuing Model in Level Dependent
More informationProbability Models in Electrical and Computer Engineering Mathematical models as tools in analysis and design Deterministic models Probability models
Probability Models in Electrical and Computer Engineering Mathematical models as tools in analysis and design Deterministic models Probability models Statistical regularity Properties of relative frequency
More informationPage 0 of 5 Final Examination Name. Closed book. 120 minutes. Cover page plus five pages of exam.
Final Examination Closed book. 120 minutes. Cover page plus five pages of exam. To receive full credit, show enough work to indicate your logic. Do not spend time calculating. You will receive full credit
More informationWays to study a system System
Simulation What is simulation? Simple synonym: imitation We are interested in studying a system Instead of experimenting with the system itself we experiment with a model of the system Ways to study a
More informationReadings: Finish Section 5.2
LECTURE 19 Readings: Finish Section 5.2 Lecture outline Markov Processes I Checkout counter example. Markov process: definition. -step transition probabilities. Classification of states. Example: Checkout
More informationLink Models for Circuit Switching
Link Models for Circuit Switching The basis of traffic engineering for telecommunication networks is the Erlang loss function. It basically allows us to determine the amount of telephone traffic that can
More informationChapter 2 Queueing Theory and Simulation
Chapter 2 Queueing Theory and Simulation Based on the slides of Dr. Dharma P. Agrawal, University of Cincinnati and Dr. Hiroyuki Ohsaki Graduate School of Information Science & Technology, Osaka University,
More informationLecture 7: Simulation of Markov Processes. Pasi Lassila Department of Communications and Networking
Lecture 7: Simulation of Markov Processes Pasi Lassila Department of Communications and Networking Contents Markov processes theory recap Elementary queuing models for data networks Simulation of Markov
More informationOptimal Sleep Scheduling for a Wireless Sensor Network Node
1 Optimal Sleep Scheduling for a Wireless Sensor Network Node David Shuman and Mingyan Liu Electrical Engineering and Computer Science Department University of Michigan Ann Arbor, MI 4819-2122 dishuman,mingyan}@umich.edu
More informationEE 368. Weeks 3 (Notes)
EE 368 Weeks 3 (Notes) 1 State of a Queuing System State: Set of parameters that describe the condition of the system at a point in time. Why do we need it? Average size of Queue Average waiting time How
More informationOperational Laws Raj Jain
Operational Laws 33-1 Overview What is an Operational Law? 1. Utilization Law 2. Forced Flow Law 3. Little s Law 4. General Response Time Law 5. Interactive Response Time Law 6. Bottleneck Analysis 33-2
More informationRandom Correlation Matrices, Top Eigenvalue with Heavy Tails and Financial Applications
Random Correlation Matrices, Top Eigenvalue with Heavy Tails and Financial Applications J.P Bouchaud with: M. Potters, G. Biroli, L. Laloux, M. A. Miceli http://www.cfm.fr Portfolio theory: Basics Portfolio
More informationScaling exponents for certain 1+1 dimensional directed polymers
Scaling exponents for certain 1+1 dimensional directed polymers Timo Seppäläinen Department of Mathematics University of Wisconsin-Madison 2010 Scaling for a polymer 1/29 1 Introduction 2 KPZ equation
More informationPBW 654 Applied Statistics - I Urban Operations Research
PBW 654 Applied Statistics - I Urban Operations Research Lecture 2.I Queuing Systems An Introduction Operations Research Models Deterministic Models Linear Programming Integer Programming Network Optimization
More informationLink Models for Packet Switching
Link Models for Packet Switching To begin our study of the performance of communications networks, we will study a model of a single link in a message switched network. The important feature of this model
More informationBuzen s algorithm. Cyclic network Extension of Jackson networks
Outline Buzen s algorithm Mean value analysis for Jackson networks Cyclic network Extension of Jackson networks BCMP network 1 Marginal Distributions based on Buzen s algorithm With Buzen s algorithm,
More informationQueueing Networks and Insensitivity
Lukáš Adam 29. 10. 2012 1 / 40 Table of contents 1 Jackson networks 2 Insensitivity in Erlang s Loss System 3 Quasi-Reversibility and Single-Node Symmetric Queues 4 Quasi-Reversibility in Networks 5 The
More information6 Solving Queueing Models
6 Solving Queueing Models 6.1 Introduction In this note we look at the solution of systems of queues, starting with simple isolated queues. The benefits of using predefined, easily classified queues will
More informationA STAFFING ALGORITHM FOR CALL CENTERS WITH SKILL-BASED ROUTING: SUPPLEMENTARY MATERIAL
A STAFFING ALGORITHM FOR CALL CENTERS WITH SKILL-BASED ROUTING: SUPPLEMENTARY MATERIAL by Rodney B. Wallace IBM and The George Washington University rodney.wallace@us.ibm.com Ward Whitt Columbia University
More information8.1 Concentration inequality for Gaussian random matrix (cont d)
MGMT 69: Topics in High-dimensional Data Analysis Falll 26 Lecture 8: Spectral clustering and Laplacian matrices Lecturer: Jiaming Xu Scribe: Hyun-Ju Oh and Taotao He, October 4, 26 Outline Concentration
More informationSpectral Efficiency of CDMA Cellular Networks
Spectral Efficiency of CDMA Cellular Networks N. Bonneau, M. Debbah, E. Altman and G. Caire INRIA Eurecom Institute nicolas.bonneau@sophia.inria.fr Outline 2 Outline Uplink CDMA Model: Single cell case
More informationTASEP on a ring in sub-relaxation time scale
TASEP on a ring in sub-relaxation time scale Jinho Baik and Zhipeng Liu October 27, 2016 Abstract Interacting particle systems in the KPZ universality class on a ring of size L with OL number of particles
More informationStochastic process. X, a series of random variables indexed by t
Stochastic process X, a series of random variables indexed by t X={X(t), t 0} is a continuous time stochastic process X={X(t), t=0,1, } is a discrete time stochastic process X(t) is the state at time t,
More informationSection 1.2: A Single Server Queue
Section 12: A Single Server Queue Discrete-Event Simulation: A First Course c 2006 Pearson Ed, Inc 0-13-142917-5 Discrete-Event Simulation: A First Course Section 12: A Single Server Queue 1/ 30 Section
More informationMath 307 Learning Goals
Math 307 Learning Goals May 14, 2018 Chapter 1 Linear Equations 1.1 Solving Linear Equations Write a system of linear equations using matrix notation. Use Gaussian elimination to bring a system of linear
More informationBulk input queue M [X] /M/1 Bulk service queue M/M [Y] /1 Erlangian queue M/E k /1
Advanced Markovian queues Bulk input queue M [X] /M/ Bulk service queue M/M [Y] / Erlangian queue M/E k / Bulk input queue M [X] /M/ Batch arrival, Poisson process, arrival rate λ number of customers in
More informationCPSC 531: System Modeling and Simulation. Carey Williamson Department of Computer Science University of Calgary Fall 2017
CPSC 531: System Modeling and Simulation Carey Williamson Department of Computer Science University of Calgary Fall 2017 Quote of the Day A person with one watch knows what time it is. A person with two
More informationNEW FRONTIERS IN APPLIED PROBABILITY
J. Appl. Prob. Spec. Vol. 48A, 209 213 (2011) Applied Probability Trust 2011 NEW FRONTIERS IN APPLIED PROBABILITY A Festschrift for SØREN ASMUSSEN Edited by P. GLYNN, T. MIKOSCH and T. ROLSKI Part 4. Simulation
More informationCover Page. The handle holds various files of this Leiden University dissertation
Cover Page The handle http://hdlhandlenet/1887/39637 holds various files of this Leiden University dissertation Author: Smit, Laurens Title: Steady-state analysis of large scale systems : the successive
More informationIntroduction to Queueing Theory
Introduction to Queueing Theory Raj Jain Washington University in Saint Louis Saint Louis, MO 63130 Jain@cse.wustl.edu Audio/Video recordings of this lecture are available at: http://www.cse.wustl.edu/~jain/cse567-11/
More informationMath 307 Learning Goals. March 23, 2010
Math 307 Learning Goals March 23, 2010 Course Description The course presents core concepts of linear algebra by focusing on applications in Science and Engineering. Examples of applications from recent
More informationDynamic Control of Parallel-Server Systems
Dynamic Control of Parallel-Server Systems Jim Dai Georgia Institute of Technology Tolga Tezcan University of Illinois at Urbana-Champaign May 13, 2009 Jim Dai (Georgia Tech) Many-Server Asymptotic Optimality
More informationDISCRETE STOCHASTIC PROCESSES Draft of 2nd Edition
DISCRETE STOCHASTIC PROCESSES Draft of 2nd Edition R. G. Gallager January 31, 2011 i ii Preface These notes are a draft of a major rewrite of a text [9] of the same name. The notes and the text are outgrowths
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science
MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science 6.262 Discrete Stochastic Processes Midterm Quiz April 6, 2010 There are 5 questions, each with several parts.
More informationJ. MEDHI STOCHASTIC MODELS IN QUEUEING THEORY
J. MEDHI STOCHASTIC MODELS IN QUEUEING THEORY SECOND EDITION ACADEMIC PRESS An imprint of Elsevier Science Amsterdam Boston London New York Oxford Paris San Diego San Francisco Singapore Sydney Tokyo Contents
More information