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

Slides:



Advertisements
Similar presentations
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?
Advertisements

Flows and Networks Plan for today (lecture 2): Questions? Continuous time Markov chain Birth-death process Example: pure birth process Example: pure death.
Optimization of thermal processes2007/2008 Optimization of thermal processes Maciej Marek Czestochowa University of Technology Institute of Thermal Machinery.
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
Constrained Maximization
Economics 214 Lecture 37 Constrained Optimization.
Lecture 38 Constrained Optimization
Modeling and Analysis of Manufacturing Systems Session 2 QUEUEING MODELS January 2001.
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.
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.
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,
Networks of Queues Plan for today (lecture 6): Last time / Questions? Product form preserving blocking Interpretation traffic equations Kelly / Whittle.
Flows and Networks Plan for today (lecture 4): Last time / Questions? Output simple queue Tandem network Jackson network: definition Jackson network: equilibrium.
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.
Model under consideration: Loss system Collection of resources to which calls with holding time  (c) and class c arrive at random instances. An arriving.
ECON 4910 seminar 21 ECON 4910 Spring 2007 Second seminar Lecturer Finn R. Førsund.
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...
Part 4 Nonlinear Programming 4.1 Introduction. Standard Form.
Flows and Networks Plan for today (lecture 6): Last time / Questions? Kelly / Whittle network Optimal design of a Kelly / Whittle network: optimisation.
Mathe III Lecture 8 Mathe III Lecture 8. 2 Constrained Maximization Lagrange Multipliers At a maximum point of the original problem the derivatives of.
1 Networks of queues Networks of queues reversibility, output theorem, tandem networks, partial balance, product-form distribution, blocking, insensitivity,
Flows and Networks (158052) Richard Boucherie Stochastische Operations Research -- TW wwwhome.math.utwente.nl/~boucherierj/onderwijs/158052/ html.
Optimization and Lagrangian. Partial Derivative Concept Consider a demand function dependent of both price and advertising Q = f(P,A) Analyzing a multivariate.
Economics 2301 Lecture 37 Constrained Optimization.
Schedule Reading material for DEA: F:\COURSES\UGRADS\INDR\INDR471\SHARE\reading material Homework 1 is due to tomorrow 17:00 ( ). Homework 2 will.
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.
The Farm Portfolio Problem: Part I Lecture V. An Empirical Model of Mean- Variance Deriving the EV Frontier –Let us begin with the traditional portfolio.
Part 3 Linear Programming 3.3 Theoretical Analysis.
Tuesday, March 19 The Network Simplex Method for Solving the Minimum Cost Flow Problem Handouts: Lecture Notes Warning: there is a lot to the network.
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.
1 Support Vector Machines: Maximum Margin Classifiers Machine Learning and Pattern Recognition: September 23, 2010 Piotr Mirowski Based on slides by Sumit.
Lecture 14 – Queuing Networks
Networks of queues Networks of queues reversibility, output theorem, tandem networks, partial balance, product-form distribution, blocking, insensitivity,
Water Resources Planning and Management Daene McKinney
Flows and Networks Plan for today (lecture 3):
Chapter 11 Optimization with Equality Constraints
Flows and Networks Plan for today (lecture 4):
Queuing Theory Jackson Networks
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
Lecture 38 Constrained Optimization
LECTURE 09 QUEUEING THEORY PART3
Presentation transcript:

Flows and Networks Plan for today (lecture 5): Last time / Questions? Blocking of transitions 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? Blocking of transitions 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

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

Exercises Exercise Blocking Consider a tandem network of two simple queues. Let the arrival rate to queue 1 be Poisson , and let the service rate at each queue be exponential  i, i=1,2. Let queue 1 have capacity N1. Queue 2 is a standard simple queue. For N1= , give the equilibrium distribution. For N1<  formulate three distinct blocking protocols that preserve product form, indicate graphically what the implication of these protocols is on the transition diagram, and proof (by partial balance) that the equilbrium distribution is of product form.

Flows and Networks Plan for today (lecture 5): Last time / Questions? Blocking of transitions 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

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

Examples Independent service, Poisson arrivals Alternative

Examples Simple queue s-server queue Infinite server queue Each station may have different service type

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

Flows and Networks Plan for today (lecture 5): Last time / Questions? Blocking of transitions 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

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 :

Flows and Networks Plan for today (lecture 5): Last time / Questions? Blocking of transitions 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

Exercise: Optimal design of Jackson network (1) Consider an open Jackson network with transition rates Assume 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 j to station k be (i) Formulate the design problem (allocation of routing probabilities) as an optimisation problem. (ii) Consider the case of parallel simple queues, i.e. a fresh job routes to station j with probability and leaves the network upon completion at that station. Provide the solution to the optimization problem for the case for all j,k

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) Now consider the case of a tandem network, and provide the solution to the optimisation problem