1 TCOM 501: Networking Theory & Fundamentals Lecture 8 March 19, 2003 Prof. Yannis A. Korilis.

Slides:



Advertisements
Similar presentations
Lecture 10 Queueing Theory. There are a few basic elements common to almost all queueing theory application. Customers arrive, they wait for service in.
Advertisements

Joint and marginal distribution functions For any two random variables X and Y defined on the same sample space, the joint c.d.f. is For an example, see.
TCOM 501: Networking Theory & Fundamentals
1 Part III Markov Chains & Queueing Systems 10.Discrete-Time Markov Chains 11.Stationary Distributions & Limiting Probabilities 12.State Classification.
Lecture 13 – Continuous-Time Markov Chains
Queueing Theory: Recap
 2003 G.L. Li and V. O.K. Li, The University of Hong Kong 1 Networks of Queues: Myth and Reality Guang-Liang Li and Victor O.K. Li The University of Hong.
#11 QUEUEING THEORY Systems Fall 2000 Instructor: Peter M. Hahn
Performance analysis for high speed switches Lecture 6.
TCOM 501: Networking Theory & Fundamentals
1 Performance Evaluation of Computer Networks Objectives  Introduction to Queuing Theory  Little’s Theorem  Standard Notation of Queuing Systems  Poisson.
Queueing Theory: Part I
1 TCOM 501: Networking Theory & Fundamentals Lecture 7 February 25, 2003 Prof. Yannis A. Korilis.
Modeling and Analysis of Manufacturing Systems Session 2 QUEUEING MODELS January 2001.
1 TCOM 501: Networking Theory & Fundamentals Lectures 9 & 10 M/G/1 Queue Prof. Yannis A. Korilis.
Queuing Networks: Burke’s Theorem, Kleinrock’s Approximation, and Jackson’s Theorem Wade Trappe.
Dimitrios Konstantas, Evangelos Grigoroudis, Vassilis S. Kouikoglou and Stratos Ioannidis Department of Production Engineering and Management Technical.
Queuing Networks. Input source Queue Service mechanism arriving customers exiting customers Structure of Single Queuing Systems Note: 1.Customers need.
yahoo.com SUT-System Level Performance Models yahoo.com SUT-System Level Performance Models8-1 chapter12 Single Class MVA.
Flows and Networks Plan for today (lecture 5): Last time / Questions? Waiting time simple queue Little Sojourn time tandem network Jackson network: mean.
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  …
M EAN -V ALUE A NALYSIS Manijeh Keshtgary O VERVIEW Analysis of Open Queueing Networks Mean-Value Analysis 2.
Flows and Networks Plan for today (lecture 5): Last time / Questions? Blocking of transitions Kelly / Whittle network Optimal design of a Kelly / Whittle.
2.4 Sequences and Summations
CPE 619 Queueing Networks Aleksandar Milenković The LaCASA Laboratory Electrical and Computer Engineering Department The University of Alabama in Huntsville.
Lecture 14 – Queuing Networks Topics Description of Jackson networks Equations for computing internal arrival rates Examples: computation center, job shop.
1 Networks of queues Networks of queues reversibility, output theorem, tandem networks, partial balance, product-form distribution, blocking, insensitivity,
Chapter 4: Numerical Solution of Models The ultimate goal of much performance analysis is to generate numerical performance results for a particular system.
Flows and Networks Plan for today (lecture 6): Last time / Questions? Kelly / Whittle network Optimal design of a Kelly / Whittle network: optimisation.
Manijeh Keshtgary. Queuing Network: model in which jobs departing from one queue arrive at another queue (or possibly the same queue)  Open and Closed.
Network Design and Analysis-----Wang Wenjie Queueing System IV: 1 © Graduate University, Chinese academy of Sciences. Network Design and Analysis Wang.
Networks of Queues Plan for today (lecture 6): Last time / Questions? Product form preserving blocking Interpretation traffic equations Kelly / Whittle.
Queuing Theory Basic properties, Markovian models, Networks of queues, General service time distributions, Finite source models, Multiserver queues Chapter.
Flows and Networks Plan for today (lecture 4): Last time / Questions? Output simple queue Tandem network Jackson network: definition Jackson network: equilibrium.
Modeling and Analysis of Computer Networks
1 Networks of queues Networks of queues reversibility, output theorem, tandem networks, partial balance, product-form distribution, blocking, insensitivity,
Queuing Networks Jean-Yves Le Boudec 1. Contents 1.The Class of Multi-Class Product Form Networks 2.The Elements of a Product-Form Network 3.The Product-Form.
Networks Plan for today (lecture 8): Last time / Questions? Quasi reversibility Network of quasi reversible queues Symmetric queues, insensitivity Partial.
1 Chapters 8 Overview of Queuing Analysis. Chapter 8 Overview of Queuing Analysis 2 Projected vs. Actual Response Time.
Ali Movaghar Winter 2009 Modeling and Analysis of Computer Networks (Delay Models in Data Networks)
1 Networks of queues Networks of queues reversibility, output theorem, tandem networks, partial balance, product-form distribution, blocking, insensitivity,
Network Design and Analysis-----Wang Wenjie Queuing Theory III: 1 © Graduate University, Chinese academy of Sciences. Network Design and Performance Analysis.
CDA6530: Performance Models of Computers and Networks Chapter 7: Basic Queuing Networks TexPoint fonts used in EMF. Read the TexPoint manual before you.
Why Wait?!? Bryan Gorney Joe Walker Dave Mertz Josh Staidl Matt Boche.
Cheng-Fu Chou, CMLab, CSIE, NTU Open Queueing Network and MVA Cheng-Fu Chou.
EE 685 presentation Optimization Flow Control, I: Basic Algorithm and Convergence By Steven Low and David Lapsley.
Chapter 4: Fundamentals of Queuing Models Structure and Performance Parameters Operational Analysis of Queuing Network General Features of Queuing Network.
Flows and Networks Plan for today (lecture 6): Last time / Questions? Kelly / Whittle network Optimal design of a Kelly / Whittle network: optimisation.
Network Design and Analysis-----Wang Wenjie Queueing Theory II: 1 © Graduate University, Chinese academy of Sciences. Network Design and Performance Analysis.
1 Networks of queues Networks of queues reversibility, output theorem, tandem networks, partial balance, product-form distribution, blocking, insensitivity,
Copyright ©: Nahrstedt, Angrave, Abdelzaher, Caccamo1 Queueing Systems.
Chapter 6 Product-Form Queuing Network Models Prof. Ali Movaghar.
Chapter 5 Elementary Stochastic Analysis Prof. Ali Movaghar.
Flows and Networks Plan for today (lecture 3): Last time / Questions? Output simple queue Tandem network Jackson network: definition Jackson network: equilibrium.
Flows and Networks Plan for today (lecture 6): Last time / Questions? Kelly / Whittle network Optimal design of a Kelly / Whittle network: optimisation.
Queuing Theory Simulation & Modeling.
Flows and Networks (158052) Richard Boucherie Stochastische Operations Research -- TW wwwhome.math.utwente.nl/~boucherierj/onderwijs/158052/ html.
Networks (3TU) Plan for today (lecture 5): Last time / Questions? Tandem network Jackson network: definition Jackson network: equilibrium distribution.
Lecture 14 – Queuing Networks
Flows and Networks Plan for today (lecture 3):
Flows and Networks Plan for today (lecture 4):
Lecture on Markov Chain
Variability 8/24/04 Paul A. Jensen
Flows and Networks Plan for today (lecture 6):
Networks of queues Networks of queues reversibility, output theorem, tandem networks, partial balance, product-form distribution, blocking, insensitivity,
Queueing networks.
Lecture 14 – Queuing Networks
Queuing Networks Mean Value Analysis
CSE 550 Computer Network Design
Presentation transcript:

1 TCOM 501: Networking Theory & Fundamentals Lecture 8 March 19, 2003 Prof. Yannis A. Korilis

8-2 Topics Closed Jackson Networks Convolution Algorithm Calculating the Throughput in a Closed Network Arrival Theorem for Closed Networks Mean-Value Analysis Norton’s Equivalent

8-3 Closed Jackson Networks Closed Network: K nodes with exponential servers No external arrivals (γ i =0), no departures (r i0 =0) Fixed number M of circulating customers Appropriate model for systems with “limited” resources, e.g., flow control mechanisms Steady-state distribution will be shown to be of “product-form” type

8-4 Closed Jackson Network Aggregate arrival rates Relative arrival rates – visit ratios Can only be determined up to a constant Use an additional equation to obtain unique solution to the above system, e.g. Set λ j =1, for some node j Set λ j =μ j, for some node j Set λ 1 + λ 2 +…+ λ K =1 n i : number of customers at node i Possible states for the closed network n=(n 1, n 2,…,n K ), with Let F(M) denote the set of all such states

8-5 Closed Jackson Network Let x i be the number of customers at station i, at steady state Random variables x 1, x 2,…, x K are not independent – their sum must be equal to M The state x=(x 1, x 2,…, x K ) of the closed network can take values n=(n 1, n 2,…,n K ), with Let F(M) denote the set of all such states Define ρ i ≡ λ i /μ i – this is not the actual utilization factor of station i Jackson’s theorem for closed networks gives the stationary distribution

8-6 Theorem 1: The stationary distribution of a closed Jackson network is where the normalization constant G(M) is a function of M G(M) guarantees that {p(n)} is a valid probability distribution This stationary distribution is said to have a product-form However: at steady-state the queues are not independent {p i (n i )}: marginal stationary distribution of queue i Jackson’s Theorem for Closed Networks

8-7 Jackson’s Theorem for Closed Networks (proof) Theorem 2: The reversed chain of a stationary closed Jackson network is also a stationary closed Jackson network with the same service rates and routing probabilities: Proof of Theorems 1 & 2: Show that for the corresponding forward and reversed chains Need to prove only for m=T ij n Verify, exactly as in the open-network case, that:

8-8 Closed Jackson Network Example: Closed network model for CPU (rate μ 1 ) and I/O (rate μ 2 ) system. Upon service completion in 1, customer routed to 2 with probability p 2 =1-p 1, or back to 1 with probability p 1. M =fixed number of customers Stationary distribution: n customers in 2 and M-n in 1 Normalization constant Utilization factor and throughput of node 1:

8-9 Closed Networks: Normalization Constant Normalization constant as a function of M and K: All performance measures of interest – throughput, average delay – can be obtained in terms of G(M,K) Computational complexity is exponential in M and K: Recursive methods can be used to reduce complexity Iterative algorithm [due to Buzen] Normalization constant will be treated as a function of both M and K and denoted G(M,K) only in the context of the iterative algorithm

8-10 Iterative Computation of G(M) For any m and k (m=0,…, M; k=1,…, K) define: For a closed network of single-server queues G(M,K) can be computed iteratively using the following recursive relation: with boundary conditions:

8-11 Iterative Algorithm (proof)

8-12 Iterative Algorithm – Example Visit ratios λ i determined up to a multiplicative constant Letting λ 1 = 2μ, we have: Calculation of G(M,5) based on the iterative algorithm using these values

8-13 Iterative Algorithm – Example Boundary conditions: Iteration: Example:

8-14 Marginal Distribution Proposition 1: In a closed Jackson network with M customers, the probability that at steady-state, the number of customers in station j greater than or equal to m is: Proof 1:

8-15 Marginal Distribution Proposition 2: In a closed Jackson network with M customers, the probability that in steady state there are m customers at station j is: Proof 2: Proposition 3: In a closed Jackson network with M customers, the average number of customers at queue j is: Proof 3:

8-16 Proposition 4: In a closed Jackson network with M customers, the average throughput of queue j is: Proof 4: Average throughput is the average rate at which customers are serviced in the queue. For a single-server queue the service rate is μ j when there are one or more customers in the queue, and 0 when the queue is empty. Thus: Average Throughput

8-17 Example:./M/1 Queues in Tandem

8-18 Example:./M/1 Queues in Tandem (cont.) Average throughput: For queue j=1,…,K: Average time-delay:

8-19 Arrival Theorem for Closed Networks Theorem: In a closed Jackson network with M customers, the occupancy distribution seen by a customer upon arrival at queue j is the same as the occupancy distribution in a closed network with the arriving customer removed. Corollary: In a closed network with M customers, the expected number of customers found upon arrival by a customer at queue j is equal to the average number of customers at queue j, when the total number of customers in the closed network is M-1. Intuition: an arriving customer sees the system at a state that does not include itself.

8-20 Arrival Theorem (proof)

8-21 Mean-Value Analysis Closed network with M customers; performance measures N j (M): average number of customers in queue j T j (M): average a customer spends (per visit) in queue j γ j (M): average throughput of queue j Mean-Value Analysis: Calculates N j (M) and T j (M) directly, without first computing G(M) or deriving the stationary distribution of the network Iterative calculation: with initial condition: Average throughput

8-22 Arrival Theorem → expected number of customers that an arrival finds at queue j is N j (m-1). Service rate for all customer at the queue μ j. λ 1,…,λ K : visit ratios – a solution to flow conservation equations Actual throughput of queue j: Using Little’s Theorem: Summing for all j and noting that ∑ j N j (m) = m: Then: Mean Value Analysis (proof)

8-23 Example:./M/1 Queues in Tandem

8-24 State-Dependent Service Rates Theorem: The stationary distribution of a closed Jackson network where the nodes have state-dependent service rates is where the normalization constant G(M) is a function of M, the fixed number of customers in the network Normalization constant: Proof similar to the one for open networks