Flows and Networks Plan for today (lecture 6): Last time / Questions? Kelly / Whittle network Optimal design of a Kelly / Whittle network: optimisation.

Slides:



Advertisements
Similar presentations
Many useful applications, especially in queueing systems, inventory management, and reliability analysis. A connection between discrete time Markov chains.
Advertisements

Lecture 6  Calculating P n – how do we raise a matrix to the n th power?  Ergodicity in Markov Chains.  When does a chain have equilibrium probabilities?
Flows and Networks Plan for today (lecture 2): Questions? Continuous time Markov chain Birth-death process Example: pure birth process Example: pure death.
TCOM 501: Networking Theory & Fundamentals
Flows and Networks (158052) Richard Boucherie Stochastische Operations Research -- TW wwwhome.math.utwente.nl/~boucherierj/onderwijs/158052/ html.
Competitive Routing in Multi-User Communication Networks Presentation By: Yuval Lifshitz In Seminar: Computational Issues in Game Theory (2002/3) By: Prof.
TCOM 501: Networking Theory & Fundamentals
Network Bandwidth Allocation (and Stability) In Three Acts.
Little’s Theorem Examples Courtesy of: Dr. Abdul Waheed (previous instructor at COE)
Queuing Networks: Burke’s Theorem, Kleinrock’s Approximation, and Jackson’s Theorem Wade Trappe.
1 TCOM 501: Networking Theory & Fundamentals Lecture 8 March 19, 2003 Prof. Yannis A. Korilis.
1 Chapter 7 Dynamic Job Shops Advantages/Disadvantages Planning, Control and Scheduling Open Queuing Network Model.
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.
Flows and Networks Plan for today (lecture 5): Last time / Questions? Waiting time simple queue Little Sojourn time tandem network Jackson network: mean.
Flows and Networks Plan for today (lecture 5): Last time / Questions? Blocking of transitions Kelly / Whittle network Optimal design of a Kelly / Whittle.
A Unified Modeling Framework for Distributed Resource Allocation of General Fork and Join Processing Networks in ACM SIGMETRICS
1 Chapter 5 Flow Lines Types Issues in Design and Operation Models of Asynchronous Lines –Infinite or Finite Buffers Models of Synchronous (Indexing) Lines.
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,
NETE4631:Capacity Planning (2)- Lecture 10 Suronapee Phoomvuthisarn, Ph.D. /
Flows and Networks Plan for today (lecture 6): Last time / Questions? Kelly / Whittle network Optimal design of a Kelly / Whittle network: optimisation.
ECES 741: Stochastic Decision & Control Processes – Chapter 1: The DP Algorithm 31 Alternative System Description If all w k are given initially as Then,
Introduction to Queueing Theory
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.
Queuing Networks Jean-Yves Le Boudec 1. Networks of Queues Stability Queuing networks are frequently used models The stability issue may, in general,
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.
Chapter 61 Continuous Time Markov Chains Birth and Death Processes,Transition Probability Function, Kolmogorov Equations, Limiting Probabilities, Uniformization.
Model under consideration: Loss system Collection of resources to which calls with holding time  (c) and class c arrive at random instances. An arriving.
Flows and Networks Plan for today (lecture 2): Questions? Birth-death process Example: pure birth process Example: pure death process Simple queue General.
M/M/1 Queues Customers arrive according to a Poisson process with rate. There is only one server. Service time is exponential with rate  j-1 jj+1...
The M/M/ N / N Queue etc COMP5416 Advanced Network Technologies.
CS433 Modeling and Simulation Lecture 07 – Part 01 Continuous Markov Chains Dr. Anis Koubâa 14 Dec 2008 Al-Imam.
Flows and Networks Plan for today (lecture 6): Last time / Questions? Kelly / Whittle network Optimal design of a Kelly / Whittle network: optimisation.
1 Networks of queues Networks of queues reversibility, output theorem, tandem networks, partial balance, product-form distribution, blocking, insensitivity,
Chapter 6 Product-Form Queuing Network Models Prof. Ali Movaghar.
Queuing Theory.  Queuing Theory deals with systems of the following type:  Typically we are interested in how much queuing occurs or in the delays at.
Flows and Networks (158052) Richard Boucherie Stochastische Operations Research -- TW wwwhome.math.utwente.nl/~boucherierj/onderwijs/158052/ html.
Linear Programming Short-run decision making model –Optimizing technique –Purely mathematical Product prices and input prices fixed Multi-product production.
Economics 2301 Lecture 37 Constrained Optimization.
CS433 Modeling and Simulation Lecture 11 Continuous Markov Chains Dr. Anis Koubâa 01 May 2009 Al-Imam Mohammad Ibn Saud University.
Chapter 5 Elementary Stochastic Analysis Prof. Ali Movaghar.
© 2015 McGraw-Hill Education. All rights reserved. Chapter 17 Queueing Theory.
Flows and Networks Plan for today (lecture 3): Last time / Questions? Output simple queue Tandem network Jackson network: definition Jackson network: equilibrium.
QUEUING. CONTINUOUS TIME MARKOV CHAINS {X(t), t >= 0} is a continuous time process with > sojourn times S 0, S 1, S 2,... > embedded process X n = X(S.
Flows and Networks (158052) Richard Boucherie Stochastische Operations Research -- TW wwwhome.math.utwente.nl/~boucherierj/onderwijs/158052/ html.
Queueing Theory II.
Networks (3TU) Plan for today (lecture 5): Last time / Questions? Tandem network Jackson network: definition Jackson network: equilibrium distribution.
Lecture 14 – Queuing Networks
Networks of queues Networks of queues reversibility, output theorem, tandem networks, partial balance, product-form distribution, blocking, insensitivity,
Flows and Networks Plan for today (lecture 3):
Flows and Networks Plan for today (lecture 4):
Finite M/M/1 queue Consider an M/M/1 queue with finite waiting room.
Queueing Theory II.
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,
Flows and Networks Plan for today (lecture 6):
Queueing networks.
Lecture 14 – Queuing Networks
Queuing Networks Mean Value Analysis
LECTURE 09 QUEUEING THEORY PART3
Presentation transcript:

Flows and Networks Plan for today (lecture 6): Last time / Questions? Kelly / Whittle network Optimal design of a Kelly / Whittle network: optimisation problem Intermezzo: mathematical programming Optimal design of a Kelly / Whittle network: Lagrangian and interpretation Optimal design of a Kelly / Whittle network: Solution optimisation problem Optimal design of a Kelly / Whittle network: network structure Summary Exercises Questions

Flows and Networks Plan for today (lecture 5): Last time / Questions? Waiting time simple queue Little Sojourn time tandem network Jackson network: mean sojourn time Product form preserving blocking Summary / Next Exercises

Blocking in tandem networks of simple queues (1) Simple queues, exponential service queue j, j=1,…,J state move depart arrive Transition rates Traffic equations Solution

Blocking in tandem networks of simple queues (2) Simple queues, exponential service queue j, j=1,…,J Transition rates Traffic equations Solution Equilibrium distribution Partial balance PICTURE J=2

Blocking in tandem networks of simple queues (3) Simple queues, exponential service queue j, j=1,…,J Suppose queue 2 has capacity constraint: n2<N2 Transition rates Partial balance? PICTURE J=2 Stop protocol, repeat protocol, jump-over protocol

Kelly / Whittle network Transition rates for some functions  :S  [0,  ), Traffic equations Open network Partial balance equations: Theorem: Assume then satisfies partial balance, and is equilibrium distribution Kelly / Whittle network

Interpretation traffic equations Transition rates for some functions  :S  (0,  ), Traffic equations Open network Theorem: Suppose that the equilibrium distribution is then and rate j  k PROOF

Source How to route jobs, and how to allocate capacity over the nodes? sink

Optimal design of Kelly / Whittle network (1) Transition rates for some functions  :S  [0,  ), Routing rules for open network to clear input traffic as efficiently as possible Cost per time unit in state n : a(n) Cost for routing j  k : Design : b_j0=+  : cannot leave from j; sequence of queues Expected cost rate

Optimal design of Kelly / Whittle network (2) Transition rates Given: input traffic Maximal service rate Optimization problem : minimize costs Under constraints

Intermezzo: mathematical programming Optimisation problem Lagrangian Lagrangian optimization problem Theorem : Under regularity conditions: any point that satisfies Lagrangian optimization problem yields optimal solution of Optimisation problem

Intermezzo: mathematical programming (2) Optimisation problem Introduce slack variables Kuhn-Tucker conditions: Theorem : Under regularity conditions: any point that satisfies Lagrangian optimization problem yields optimal solution of Optimisation problem Interpretation multipliers: shadow price for constraint. If RHS constraint increased by , then optimal objective value increases by  i 

Optimal design of Kelly / Whittle network (3) Optimisation problem Lagrangian form Interpretation Lagrange multipliers :

Optimal design of Kelly / Whittle network (4) KT-conditions Computing derivatives:

Optimal design of Kelly / Whittle network (5) Theorem : (i) the marginal costs of input satisfy with equality for those nodes j which are used in the optimal design. (ii) If the routing j  k is used in the optimal design the equality holds in (i) and the minimum in the rhs is attained at given k. (iii) If node j is not used in the optimal design then α j =0. If it is used but at less that full capacity then c j =0. Dynamic programming equations for nodes that are used

Optimal design of Kelly / Whittle network (6) PROOF: Kuhn-Tucker conditions :

Customer types : routes Customer type identified route Poisson arrival rate per type Type i: arrival rate  (i), i=1,…,I Route r(i,1), r(i,2),…,r(i,S(i)) Type i at stage s in queue r(i,s) Fixed number of visits; cannot use Markov routing 1, 2. or 3 visits to queue: use 3 types

Customer types : queue discipline Customers ordered at queue Consider queue j, containing n j jobs Queue j contains jobs in positions 1,…, n j Operation of the queue j: (i) Each job requires exponential(1) amount of service. (ii) Total service effort supplied at rate  j (n j )  (iii) Proportion  j (k,n j ) of this effort directed to job in position k, k=1,…, n j ; when this job leaves, his service is completed, jobs in positions k+1,…, n j move to positions k,…, n j -1. (iv) When a job arrives at queue j he moves into position k with probability  j (k,n j + 1), k=1,…, n j +1; jobs previously in positions k,…, n j move to positions k+1,…, n j +1.

Customer types : equilibrium distribution Transition rates type i job arrival (note that queue which job arrives is determined by type) type i job completion (job must be on last stage of route through the network) type i job towards next stage of its route Notice that each route behaves as tandem network, where each stage is queue in tandem Thus: arrival rate of type i to stage s :  (i) Let State of the network: Equilibrium distribution

Symmetric queues; insensitivity Operation of the queue j: (i) Each job requires exponential(1) amount of service. (ii) Total service effort supplied at rate  j (n j )  (iii) Proportion  j (k,n j ) of this effort directed to job in position k, k=1,…, n j ; when this job leaves, his service is completed, jobs in positions k+1,…, n j move to positions k,…, n j -1. (iv) When a job arrives at queue j he moves into position k with probability  j (k,n j + 1), k=1,…, n j +1; jobs previously in positions k,…, n j move to positions k+1,…, n j +1. Symmetric queue is insensitive

Flows and network: summary stochastic networks Contents 1.Introduction; Markov chains 2.Birth-death processes; Poisson process, simple queue; reversibility; detailed balance 3.Output of simple queue; Tandem network; equilibrium distribution 4.Jackson networks; Partial balance 5.Sojourn time simple queue and tandem network 6.Performance measures for Jackson networks: throughput, mean sojourn time, blocking 7.Application: service rate allocation for throughput optimisation Application: optimal routing further reading[R+SN] chapter 3: customer types; chapter 4: examples

Exercises [R+SN] 3.1.2, 3.2.3,

Exercise: Optimal design of Jackson network (1) Consider an open Jackson network with transition rates Assume that the service rates and arrival rates are given Let the costs per time unit for a job residing at queue j be Let the costs for routing a job from station i to station j be (i) Formulate the design problem (allocation of routing probabilities) as an optimisation problem. (ii) Provide the solution to this problem

Exercise: Optimal design of Jackson network (2) Consider an open Jackson network with transition rates Assume that the routing probabilities and arrival rates are given Let the costs per time unit for a job residing at queue j be Let the costs for routing a job from station i to station j be Let the total service rate that can be distributed over the queues be, i.e., (i) Formulate the design problem (allocation of service rates) as an optimisation problem. (ii) Provide the solution to this problem (iii) Now consider the case of a tandem network, and provide the solution to the optimisation problem for the case for all j,k