Linear Model Predictive Control for Queueing Networks in Manufacturing and Road Traffic
|
|
- Coral McBride
- 5 years ago
- Views:
Transcription
1 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 Vu, Bao Vo, Tung Le and Serge Hoogendoorn (road traffic) ANZIAM, Jan 30, 2012.
2 Overview and Main Story Central control of: Manufacturing networks Urban traffic networks Model as a ueueing Network: Jobs (lots, cars) Servers (manufacturing machines, signaled intersections) ueues (lots waiting for processing, cars waiting at intersections) Routes: Fixed, random, partially controlled, incentive driven Delayed movement Policy for resource allocation and routing Desired: High throughout, low WIP, steady output, fairness... Sensible computable control Methodological and mathematical structure of the control In this talk: A control (policy) methodology based on MPC
3 Most of the talk focuses on the manufacturing setting
4 S S S D D
5 Precise ueueing Network Model Definition Discrete time n = 0, 1,... K job classes, L servers Types of classes: Source ueue D Delay S Sink Deterministic routes Randomness due to batch arrivals ( classes), ũ k, m k Processing capacity: jobs per server per time unit, c i, i = 1,... L Control Policy How should servers allocate capacity? S S S D D
6 A Controlled Markov Chain P = {p kk } routing matrix, C constituency matrix i.i.d jobs generated at sources, ũ U generic r.v. of U-fold sum {X (n)} is a controlled Markov chain, with control U(n) = f (X (n)) X k (n + 1) = Matrix form X k (n) + k K X D k (n)p k k + k K ũ U k (n) {,} k p k k U k (n), k K (queue) k K X D k (n)p k k + k K ũ U k (n) {,} k p k k, k K D (delay) X k (n) + k K D X k (n)p k k + k K {,} ũ U k (n) k p k k, k K S (sink) X (n + 1) X D (n + 1) X S (n + 1) = I P D 0 0 P DD 0 0 P DS I Elements of ũ( ) are ũ U k (n) U k k (n)m k s.t. X (n) X D (n) X S (n) P M + P D M P S M I I I I C C P I P D P S X (n) X D (n) X S (n) U (n) U (n) [ U(n) U (n) c ] + P P D P S ũ ( U (n) )
7 Concept: Control as a Linear System X (n + 1) = A X (n) + B U(n) + zero mean noise s.t. F [ X (n) U(n) ] g Our Control Methodology Ignore noise Assume state and control (X ( ), U( )) are continuous in value Find a reference trajectory Apply standard control-theoretic methods for tracking the reference trajectory Use Model Predictive Control (MPC) using a uadratic Programming (P) formulation
8 A Structured Example: The Aquisition ueue D. Denteneer, J. van Leeuwaarden, and I. Adan. The acquisition queue. ueueing Systems, 56(3):229240, Server 1 D D 3 4 S d 3 2 D d 2
9 Acquisition ueue with d = 3 D 1 (n + 1) D 2 (n + 1) D 3 (n + 1) (n + 1) S(n + 1) = Maximal Throughput D 1 (n) D 2 (n) D 3 (n) (n) S(n) + m ( 1 ) 1 δ = lim n n S(n) = m + 1 c [ U(n) U (n) ] A Reference Trajectory U r (n) = U r (n) = D r 1(n) = D r 2(n) = D r 3(n) = δ, r (n) = const, S r (n) = δ n Error Dynamics: X e (n) = X (n) X r (n), U e (n) = U(n) U r (n) Also satisfy: X e (n + 1) = A X e (n) + B U e (n) Our controller tries to regulate X e (n) on 0
10 The MPC Approach Action of Controller at Time n Look at X e (n) Plan an optimal schedule for a time horizon of N time units: Optimize the variables U e (n),..., U e (n + N 1) These yield predictions of X e (n + 1),..., X e (n + N) Practical objective (P): n+n 1 ˆX e (i + 1) ˆX e (i + 1) + U e (i) RU e (i) i=n After optimizing use first step: U(n) = U e (n) + U r (n) Round off U(n) and insure feasibility Repeat in next time step Parameters of controller: Time horizon, N. Positive definite cost matrixes,, R. Reference trajectory.
11 Precise Formulation of the P (for illustration) s.t. C S 1 U S + U S X B I min U e U e ( B B + R ) U e + 2X e 0 A B U e Ue c S 1 X S X 0 Xr + C S 1 U S + U I Ur + 0 S X S X A 0 X e 0, R are block diagonal matrixes of and R. The S matrixes select elements. The following matrixes are used for prediction: A = A A 2. A N, B = B 0 0 AB B..... A N 1 B B Observe: If U r is constant as well as X r on the -classes then control law is a function of X e 0 only
12 Numerical Illustration
13 Acquisition ueue Threshold vs. MPC Example: c = 10, d = 10, m = 3 A Simple Threshold Control Law (Van Leeuwaarden et. al. 2007) U (n) = α + (c (n)) +, α < c/(1 + m) (for stability) U (n) = c U (n) Assume no noise, optimize α: α = 2 is best n
14 MPC Appears Better than Threshold Compare α = 2 with MPC ( = I, R = I, N = 30) n Add noise (Geometrically distributed acquisitions) n
15 What about road traffic?
16 Model Modifications for Urban Traffic Control Time-varying arrivals Servers operate on multiple queues in parallel (traffic phases) Free flow in links up to intersections Route selection of driver in two ways: Fixed proportions of flow out of every intersection Centrally controlled directives yielding a traffic split Spil-backs play a major role Instead of tracking a trajectory, minimization of makes sense ( ) 2 cars in system Key point: We can do all of the above, yet maintain the linear P structure for MPC
17 Example: A More Complex Manufacturing Network
18 Example: A More Complex Manufacturing Network Use Linear Program (LP) to Find a Reference Trajectory ρ [0, 1] s.t. max 1 0 1/m /m 2 0 1/m 4 4i=1 w i r i r 1 r 2 r 3 r 4 r i 0, i = 1, 2, 3, 4. c 1m 1 c 3 c 4 c 2 c 5 (route 1) U r 1 (n) = ρr 1 /m 1, X r 5 (n) = X r 6 (n) = X r 7 (n) = X r 8 (n) = Ur 5 (n) = Ur 6 (n) = Ur 7 (n) = Ur 8 (n) = ρr 1, (route 2) U r 2 (n) = ρr 2 /m 2, (route 3) U r 3 (n) = ρr 3 /m 3, (route 4) U r 4 (n) = ρr 4 /m 4, X r 10 (n) = X r 11 (n) = X r 12 (n) = X r 9 (n) = Ur 9 (n) = ρr 4, (sinks) X r 13 (n) = ρ(r 1 + r 2 )n, X r 14 (n) = ρr 3 n, X r 15 (n) = ρr 4 n., Server 1 Server 2 Server 3 Server 4 Server S 13 S S 15 9 D 12 D 11 D 10 4
19 A More Complex Network (cont.) Parameters set such that r i > 0, i = 1, 2, 3, 4, = I, R = I, ρ = 1 N = 5, Stable n N = 4, Stable in s (not in output). N = 3 Unstable n n
20 Stability? Continuous Deterministic Case Add end point constraint: X e (N) = 0 Main Theoretical Result: If feasible solution exists then resulting system is asymptotically stable Alternative: Take N = Discrete Stochastic Case No general result Some hope of proving positive recurrence for toy examples by analyzing the solution of the P when X0 e is far from the origin
21 Conclusion Main idea: View queueing network as controlled linear system with self generated noise apply MPC appears to work well General theory: e.g. Stability properties... hard to obtain At least... Hope for asymptotic explicit stochastic analysis of some toy examples To do: Set up observers (possibly using the noise structure)
Gideon Weiss University of Haifa. Joint work with students: Anat Kopzon Yoni Nazarathy. Stanford University, MSE, February, 2009
Optimal Finite Horizon Control of Manufacturing Systems: Fluid Solution by SCLP (separated continuous LP) and Fluid Tracking using IVQs (infinite virtual queues) Stanford University, MSE, February, 29
More informationA Semiconductor Wafer
M O T I V A T I O N Semi Conductor Wafer Fabs A Semiconductor Wafer Clean Oxidation PhotoLithography Photoresist Strip Ion Implantation or metal deosition Fabrication of a single oxide layer Etching MS&E324,
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 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 informationPositive Harris Recurrence and Diffusion Scale Analysis of a Push Pull Queueing Network. Haifa Statistics Seminar May 5, 2008
Positive Harris Recurrence and Diffusion Scale Analysis of a Push Pull Queueing Network Yoni Nazarathy Gideon Weiss Haifa Statistics Seminar May 5, 2008 1 Outline 1 Preview of Results 2 Introduction Queueing
More informationControl of multi-class queueing networks with infinite virtual queues
Control of multi-class queueing networks with infinite virtual queues Erjen Lefeber (TU/e) Workshop on Optimization, Scheduling and Queues Honoring Gideon Weiss on his Retirement June 8, 2012 Where innovation
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 informationCapacity and Scheduling in Small-Cell HetNets
Capacity and Scheduling in Small-Cell HetNets Stephen Hanly Macquarie University North Ryde, NSW 2109 Joint Work with Sem Borst, Chunshan Liu and Phil Whiting Tuesday, January 13, 2015 Hanly Capacity and
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 information5 Lecture 5: Fluid Models
5 Lecture 5: Fluid Models Stability of fluid and stochastic processing networks Stability analysis of some fluid models Optimization of fluid networks. Separated continuous linear programming 5.1 Stability
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 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 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 informationScheduling: Queues & Computation
Scheduling: Queues Computation achieving baseline performance efficiently Devavrat Shah LIDS, MIT Outline Two models switched network and bandwidth sharing Scheduling: desirable performance queue-size
More informationLoad Balancing in Distributed Service System: A Survey
Load Balancing in Distributed Service System: A Survey Xingyu Zhou The Ohio State University zhou.2055@osu.edu November 21, 2016 Xingyu Zhou (OSU) Load Balancing November 21, 2016 1 / 29 Introduction and
More informationTutorial: Optimal Control of Queueing Networks
Department of Mathematics Tutorial: Optimal Control of Queueing Networks Mike Veatch Presented at INFORMS Austin November 7, 2010 1 Overview Network models MDP formulations: features, efficient formulations
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 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 informationThe shortest queue problem
The shortest queue problem Ivo Adan March 19, 2002 1/40 queue 1 join the shortest queue queue 2 Where: Poisson arrivals with rate Exponential service times with mean 1/ 2/40 queue 1 queue 2 randomly assign
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 informationTales of Time Scales. Ward Whitt AT&T Labs Research Florham Park, NJ
Tales of Time Scales Ward Whitt AT&T Labs Research Florham Park, NJ New Book Stochastic-Process Limits An Introduction to Stochastic-Process Limits and Their Application to Queues Springer 2001 I won t
More informationA fluid approach to job shop scheduling: theory, software and experimentation
A fluid approach to job shop scheduling: theory, software and experimentation Yoni Nazarathy, TU/e Eindhoven, The Department of Mechanical Engineering and EURANDOM, Gideon Weiss, The University of Haifa,
More informationOperations Research Letters. Instability of FIFO in a simple queueing system with arbitrarily low loads
Operations Research Letters 37 (2009) 312 316 Contents lists available at ScienceDirect Operations Research Letters journal homepage: www.elsevier.com/locate/orl Instability of FIFO in a simple queueing
More informationBlind Fair Routing in Large-Scale Service Systems with Heterogeneous Customers and Servers
OPERATIONS RESEARCH Vol. 6, No., January February 23, pp. 228 243 ISSN 3-364X (print) ISSN 526-5463 (online) http://dx.doi.org/.287/opre.2.29 23 INFORMS Blind Fair Routing in Large-Scale Service Systems
More informationHyperbolic Models for Large Supply Chains. Christian Ringhofer (Arizona State University) Hyperbolic Models for Large Supply Chains p.
Hyperbolic Models for Large Supply Chains Christian Ringhofer (Arizona State University) Hyperbolic Models for Large Supply Chains p. /4 Introduction Topic: Overview of conservation law (traffic - like)
More information57:022 Principles of Design II Final Exam Solutions - Spring 1997
57:022 Principles of Design II Final Exam Solutions - Spring 1997 Part: I II III IV V VI Total Possible Pts: 52 10 12 16 13 12 115 PART ONE Indicate "+" if True and "o" if False: + a. If a component's
More informationCost Analysis of a vacation machine repair model
Available online at www.sciencedirect.com Procedia - Social and Behavioral Sciences 25 (2011) 246 256 International Conference on Asia Pacific Business Innovation & Technology Management Cost Analysis
More informationA Queueing System with Queue Length Dependent Service Times, with Applications to Cell Discarding in ATM Networks
A Queueing System with Queue Length Dependent Service Times, with Applications to Cell Discarding in ATM Networks by Doo Il Choi, Charles Knessl and Charles Tier University of Illinois at Chicago 85 South
More informationHomework 1 - SOLUTION
Homework - SOLUTION Problem M/M/ Queue ) Use the fact above to express π k, k > 0, as a function of π 0. π k = ( ) k λ π 0 µ 2) Using λ < µ and the fact that all π k s sum to, compute π 0 (as a function
More informationCE351 Transportation Systems: Planning and Design
CE351 Transportation Systems: Planning and Design TOPIC: Level of Service (LOS) at Traffic Signals 1 Course Outline Introduction to Transportation Highway Users and their Performance Geometric Design Pavement
More informationConservation laws and some applications to traffic flows
Conservation laws and some applications to traffic flows Khai T. Nguyen Department of Mathematics, Penn State University ktn2@psu.edu 46th Annual John H. Barrett Memorial Lectures May 16 18, 2016 Khai
More informationMaximum pressure policies for stochastic processing networks
Maximum pressure policies for stochastic processing networks Jim Dai Joint work with Wuqin Lin at Northwestern Univ. The 2011 Lunteren Conference Jim Dai (Georgia Tech) MPPs January 18, 2011 1 / 55 Outline
More informationImproved Algorithms for Machine Allocation in Manufacturing Systems
Improved Algorithms for Machine Allocation in Manufacturing Systems Hans Frenk Martine Labbé Mario van Vliet Shuzhong Zhang October, 1992 Econometric Institute, Erasmus University Rotterdam, the Netherlands.
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 informationControl of Fork-Join Networks in Heavy-Traffic
in Heavy-Traffic Asaf Zviran Based on MSc work under the guidance of Rami Atar (Technion) and Avishai Mandelbaum (Technion) Industrial Engineering and Management Technion June 2010 Introduction Network
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 informationA PARAMETRIC DECOMPOSITION BASED APPROACH FOR MULTI-CLASS CLOSED QUEUING NETWORKS WITH SYNCHRONIZATION STATIONS
A PARAMETRIC DECOMPOSITION BASED APPROACH FOR MULTI-CLASS CLOSED QUEUING NETWORKS WITH SYNCHRONIZATION STATIONS Kumar Satyam and Ananth Krishnamurthy Department of Decision Sciences and Engineering Systems,
More informationDynamic Scheduling of Multiclass Queueing Networks. Caiwei Li
Dynamic Scheduling of Multiclass Queueing Networks A Thesis Presented to The Academic Faculty by Caiwei Li In Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy in Industrial
More informationOn the Resource/Performance Tradeoff in Large Scale Queueing Systems
On the Resource/Performance Tradeoff in Large Scale Queueing Systems David Gamarnik MIT Joint work with Patrick Eschenfeldt, John Tsitsiklis and Martin Zubeldia (MIT) High level comments High level comments
More information1 Markov decision processes
2.997 Decision-Making in Large-Scale Systems February 4 MI, Spring 2004 Handout #1 Lecture Note 1 1 Markov decision processes In this class we will study discrete-time stochastic systems. We can describe
More informationA Study on Performance Analysis of Queuing System with Multiple Heterogeneous Servers
UNIVERSITY OF OKLAHOMA GENERAL EXAM REPORT A Study on Performance Analysis of Queuing System with Multiple Heterogeneous Servers Prepared by HUSNU SANER NARMAN husnu@ou.edu based on the papers 1) F. S.
More informationExercises Stochastic Performance Modelling. Hamilton Institute, Summer 2010
Exercises Stochastic Performance Modelling Hamilton Institute, Summer Instruction Exercise Let X be a non-negative random variable with E[X ]
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 informationMATH4406 (Control Theory) Unit 1: Introduction Prepared by Yoni Nazarathy, July 21, 2012
MATH4406 (Control Theory) Unit 1: Introduction Prepared by Yoni Nazarathy, July 21, 2012 Unit Outline Introduction to the course: Course goals, assessment, etc... What is Control Theory A bit of jargon,
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 informationThe Timing Capacity of Single-Server Queues with Multiple Flows
The Timing Capacity of Single-Server Queues with Multiple Flows Xin Liu and R. Srikant Coordinated Science Laboratory University of Illinois at Urbana Champaign March 14, 2003 Timing Channel Information
More informationOn the equivalence of economic lot scheduling and switched production systems
On the equivalence of economic lot scheduling and switched production systems K.G.M. Jacobs, Dieter Armbruster,, Erjen Lefeber and J.E. Rooda January, 2 Abstract Scheduling production of several product
More informationDynamic Control of a Tandem Queueing System with Abandonments
Dynamic Control of a Tandem Queueing System with Abandonments Gabriel Zayas-Cabán 1 Jungui Xie 2 Linda V. Green 3 Mark E. Lewis 1 1 Cornell University Ithaca, NY 2 University of Science and Technology
More informationClass 11 Non-Parametric Models of a Service System; GI/GI/1, GI/GI/n: Exact & Approximate Analysis.
Service Engineering Class 11 Non-Parametric Models of a Service System; GI/GI/1, GI/GI/n: Exact & Approximate Analysis. G/G/1 Queue: Virtual Waiting Time (Unfinished Work). GI/GI/1: Lindley s Equations
More informationBRAVO for QED Queues
1 BRAVO for QED Queues Yoni Nazarathy, The University of Queensland Joint work with Daryl J. Daley, The University of Melbourne, Johan van Leeuwaarden, EURANDOM, Eindhoven University of Technology. Applied
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 informationChapter 10. Queuing Systems. D (Queuing Theory) Queuing theory is the branch of operations research concerned with waiting lines.
Chapter 10 Queuing Systems D. 10. 1. (Queuing Theory) Queuing theory is the branch of operations research concerned with waiting lines. D. 10.. (Queuing System) A ueuing system consists of 1. a user source.
More informationOn the static assignment to parallel servers
On the static assignment to parallel servers Ger Koole Vrije Universiteit Faculty of Mathematics and Computer Science De Boelelaan 1081a, 1081 HV Amsterdam The Netherlands Email: koole@cs.vu.nl, Url: www.cs.vu.nl/
More informationNATCOR: Stochastic Modelling
NATCOR: Stochastic Modelling Queueing Theory II Chris Kirkbride Management Science 2017 Overview of Today s Sessions I Introduction to Queueing Modelling II Multiclass Queueing Models III Queueing Control
More informationDesign Priciples of Traffic Signal
Design Priciples of Traffic Signal Lecture Notes in Transportation Systems Engineering Prof. Tom V. Mathew Contents 1 Overview 1 2 Definitions and notations 2 3 Phase design 3 3.1 Two phase signals.................................
More informationSOLUTIONS IEOR 3106: Second Midterm Exam, Chapters 5-6, November 8, 2012
SOLUTIONS IEOR 3106: Second Midterm Exam, Chapters 5-6, November 8, 2012 This exam is closed book. YOU NEED TO SHOW YOUR WORK. Honor Code: Students are expected to behave honorably, following the accepted
More informationDYNAMIC MODEL OF URBAN TRAFFIC AND OPTIMUM MANAGEMENT OF ITS FLOW AND CONGESTION
Dynamic Systems and Applications 26 (2017) 575-588 DYNAMIC MODEL OF URBAN TRAFFIC AND OPTIMUM MANAGEMENT OF ITS FLOW AND CONGESTION SHI AN WANG AND N. U. AHMED School of Electrical Engineering and Computer
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 informationLecture 5 Linear Quadratic Stochastic Control
EE363 Winter 2008-09 Lecture 5 Linear Quadratic Stochastic Control linear-quadratic stochastic control problem solution via dynamic programming 5 1 Linear stochastic system linear dynamical system, over
More informationQueueing Theory (Part 4)
Queueing Theory (Part 4) Nonexponential Queueing Systems and Economic Analysis Queueing Theory-1 Queueing Models with Nonexponential Distributions M/G/1 Model Poisson input process, general service time
More informationPush and Pull Systems in a Dynamic Environment
Push and Pull Systems in a Dynamic Environment ichael Zazanis Dept. of IEOR University of assachusetts Amherst, A 0003 email: zazanis@ecs.umass.edu Abstract We examine Push and Pull production control
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 informationAnalytical investigation on the minimum traffic delay at a two-phase. intersection considering the dynamical evolution process of queues
Analytical investigation on the minimum traffic delay at a two-phase intersection considering the dynamical evolution process of queues Hong-Ze Zhang 1, Rui Jiang 1,2, Mao-Bin Hu 1, Bin Jia 2 1 School
More informationDynamic resource sharing
J. Virtamo 38.34 Teletraffic Theory / Dynamic resource sharing and balanced fairness Dynamic resource sharing In previous lectures we have studied different notions of fair resource sharing. Our focus
More informationGI/M/1 and GI/M/m queuing systems
GI/M/1 and GI/M/m queuing systems Dmitri A. Moltchanov moltchan@cs.tut.fi http://www.cs.tut.fi/kurssit/tlt-2716/ OUTLINE: GI/M/1 queuing system; Methods of analysis; Imbedded Markov chain approach; Waiting
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 informationSecond main application of Chernoff: analysis of load balancing. Already saw balls in bins example. oblivious algorithms only consider self packet.
Routing Second main application of Chernoff: analysis of load balancing. Already saw balls in bins example synchronous message passing bidirectional links, one message per step queues on links permutation
More informationA TANDEM QUEUEING SYSTEM WITH APPLICATIONS TO PRICING STRATEGY. Wai-Ki Ching. Tang Li. Sin-Man Choi. Issic K.C. Leung
Manuscript submitted to AIMS Journals Volume X, Number 0X, XX 00X Website: http://aimsciences.org pp. X XX A TANDEM QUEUEING SYSTEM WITH APPLICATIONS TO PRICING STRATEGY WAI-KI CHING SIN-MAN CHOI TANG
More informationMATH4406 (Control Theory) Unit 6: The Linear Quadratic Regulator (LQR) and Model Predictive Control (MPC) Prepared by Yoni Nazarathy, Artem
MATH4406 (Control Theory) Unit 6: The Linear Quadratic Regulator (LQR) and Model Predictive Control (MPC) Prepared by Yoni Nazarathy, Artem Pulemotov, September 12, 2012 Unit Outline Goal 1: Outline linear
More informationStochastic Models of Manufacturing Systems
Stochastic Models of Manufacturing Systems Ivo Adan Systems 2/49 Continuous systems State changes continuously in time (e.g., in chemical applications) Discrete systems State is observed at fixed regular
More informationSuggested solutions for the exam in SF2863 Systems Engineering. December 19,
Suggested solutions for the exam in SF863 Systems Engineering. December 19, 011 14.00 19.00 Examiner: Per Enqvist, phone: 790 6 98 1. We can think of the support center as a Jackson network. The reception
More informationQueueing systems in a random environment with applications
Queueing systems in a random environment with applications Ruslan Krenzler, Hans Daduna Universität Hamburg OR 2013 3.-6. September 2013 Krenzler, Daduna (Uni HH) Queues in rnd. environment OR 2013 1 /
More informationMultiaccess Communication
Information Networks p. 1 Multiaccess Communication Satellite systems, radio networks (WLAN), Ethernet segment The received signal is the sum of attenuated transmitted signals from a set of other nodes,
More informationM/G/1 and Priority Queueing
M/G/1 and Priority Queueing Richard T. B. Ma School of Computing National University of Singapore CS 5229: Advanced Compute Networks Outline PASTA M/G/1 Workload and FIFO Delay Pollaczek Khinchine Formula
More informationPositive Harris Recurrence and Diffusion Scale Analysis of a Push Pull Queueing Network
Positive Harris Recurrence and Diffusion Scale Analysis of a Push Pull Queueing Network Yoni Nazarathy a,1, Gideon Weiss a,1 a Department of Statistics, The University of Haifa, Mount Carmel 31905, Israel.
More informationDynamic Power Allocation and Routing for Time Varying Wireless Networks
Dynamic Power Allocation and Routing for Time Varying Wireless Networks X 14 (t) X 12 (t) 1 3 4 k a P ak () t P a tot X 21 (t) 2 N X 2N (t) X N4 (t) µ ab () rate µ ab µ ab (p, S 3 ) µ ab µ ac () µ ab (p,
More informationSynchronized Queues with Deterministic Arrivals
Synchronized Queues with Deterministic Arrivals Dimitra Pinotsi and Michael A. Zazanis Department of Statistics Athens University of Economics and Business 76 Patission str., Athens 14 34, Greece Abstract
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 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 informationHybrid Petri net model of a traffic intersection in a urban network
Hybrid Petri net model of a traffic intersection in a urban network C. Renato Vázquez, Herman Y. Sutarto, René Boel, Manuel Silva Abstract Control in urban traffic networks constitutes an important and
More informationStability of the two queue system
Stability of the two queue system Iain M. MacPhee and Lisa J. Müller University of Durham Department of Mathematical Science Durham, DH1 3LE, UK (e-mail: i.m.macphee@durham.ac.uk, l.j.muller@durham.ac.uk)
More informationA Push Pull Network with Infinite Supply of Work
DOI 10.1007/s11134-009-9121-1 A Push Pull Network with Infinite Supply of Work Anat Kopzon Yoni Nazarathy Gideon Weiss Received: 31 January 2007 / Revised: 28 July 2008 Springer Science+Business Media,
More informationSession-Based Queueing Systems
Session-Based Queueing Systems Modelling, Simulation, and Approximation Jeroen Horters Supervisor VU: Sandjai Bhulai Executive Summary Companies often offer services that require multiple steps on the
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 informationOn Successive Lumping of Large Scale Systems
On Successive Lumping of Large Scale Systems Laurens Smit Rutgers University Ph.D. Dissertation supervised by Michael Katehakis, Rutgers University and Flora Spieksma, Leiden University April 18, 2014
More informationTHE HEAVY-TRAFFIC BOTTLENECK PHENOMENON IN OPEN QUEUEING NETWORKS. S. Suresh and W. Whitt AT&T Bell Laboratories Murray Hill, New Jersey 07974
THE HEAVY-TRAFFIC BOTTLENECK PHENOMENON IN OPEN QUEUEING NETWORKS by S. Suresh and W. Whitt AT&T Bell Laboratories Murray Hill, New Jersey 07974 ABSTRACT This note describes a simulation experiment involving
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 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 informationA MODELLING TECHNIQUE FOR PRODUCTION PLANNING
A MODELLING TECHNIQUE FOR PRODUCTION PLANNING Jean-Claude HENNET Laboratoire d Automatique et d Analyse des Systèmes du CNRS 7 avenue du colonel Roche - 31077 Toulouse Cedex Abstract: The purpose of a
More informationStochastic-Process Limits
Ward Whitt Stochastic-Process Limits An Introduction to Stochastic-Process Limits and Their Application to Queues With 68 Illustrations Springer Contents Preface vii 1 Experiencing Statistical Regularity
More informationOn the Partitioning of Servers in Queueing Systems during Rush Hour
On the Partitioning of Servers in Queueing Systems during Rush Hour This paper is motivated by two phenomena observed in many queueing systems in practice. The first is the partitioning of server capacity
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 informationSignalized Intersections
Signalized Intersections Kelly Pitera October 23, 2009 Topics to be Covered Introduction/Definitions D/D/1 Queueing Phasing and Timing Plan Level of Service (LOS) Signal Optimization Conflicting Operational
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 informationRoundabout Level of Service
Roundabout Level of Service Rahmi Akçelik Director Akcelik & Associates Pty Ltd email: rahmi.akcelik@sidrasolutions.com web: www.sidrasolutions.com 8 January 2009 Contents 1. Introduction... 1 2. Fundamental
More informationLarge Deviations for Channels with Memory
Large Deviations for Channels with Memory Santhosh Kumar Jean-Francois Chamberland Henry Pfister Electrical and Computer Engineering Texas A&M University September 30, 2011 1/ 1 Digital Landscape Delay
More informationOptimal power-delay trade-offs in fading channels: small delay asymptotics
Optimal power-delay trade-offs in fading channels: small delay asymptotics Randall A. Berry Dept. of EECS, Northwestern University 45 Sheridan Rd., Evanston IL 6008 Email: rberry@ece.northwestern.edu Abstract
More informationStrategic Dynamic Jockeying Between Two Parallel Queues
Strategic Dynamic Jockeying Between Two Parallel Queues Amin Dehghanian 1 and Jeffrey P. Kharoufeh 2 Department of Industrial Engineering University of Pittsburgh 1048 Benedum Hall 3700 O Hara Street Pittsburgh,
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 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 information