AIC05 - S. Mocanu 1 NUMERICAL ALGORITHMS FOR TRANSIENT ANALYSIS OF FLUID QUEUES Stéphane Mocanu Laboratoire d’Automatique de Grenoble FRANCE.

Slides:

Advertisements

Similar presentations

M. Colledani, T. Tolio Dipartimento di Meccanica

Advertisements

Finite Difference Discretization of Hyperbolic Equations: Linear Problems Lectures 8, 9 and 10.

Stationary Probability Vector of a Higher-order Markov Chain By Zhang Shixiao Supervisors: Prof. Chi-Kwong Li and Dr. Jor-Ting Chan.

SMA 6304/MIT2.853/MIT2.854 Manufacturing Systems Lecture 19-20: Single-part-type, multiple stage systems Lecturer: Stanley B. Gershwin

Chapter 2 Solutions of Systems of Linear Equations / Matrix Inversion

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?

Lecture 17 Introduction to Eigenvalue Problems

TCOM 501: Networking Theory & Fundamentals

Solutions Markov Chains 1

Copyright © 2005 Department of Computer Science CPSC 641 Winter Markov Chains Plan: –Introduce basics of Markov models –Define terminology for Markov.

Flows and Networks (158052) Richard Boucherie Stochastische Operations Research -- TW wwwhome.math.utwente.nl/~boucherierj/onderwijs/158052/ html.

1 Part III Markov Chains & Queueing Systems 10.Discrete-Time Markov Chains 11.Stationary Distributions & Limiting Probabilities 12.State Classification.

Maximum likelihood separation of spatially autocorrelated images using a Markov model Shahram Hosseini 1, Rima Guidara 1, Yannick Deville 1 and Christian.

Continuous Time Markov Chains and Basic Queueing Theory

Eigenvalues and Eigenvectors (11/17/04) We know that every linear transformation T fixes the 0 vector (in R n, fixes the origin). But are there other subspaces.

Monte Carlo Simulation Methods - ideal gas. Calculating properties by integration.

ODE and Discrete Simulation or Mean Field Methods for Computer and Communication Systems Jean-Yves Le Boudec EPFL MLQA, Aachen, September

1 Cooperative Communications in Networks: Random coding for wireless multicast Brooke Shrader and Anthony Ephremides University of Maryland October, 2008.

CSE 3504: Probabilistic Analysis of Computer Systems Topics covered: Continuous time Markov chains (Sec )

TCOM 501: Networking Theory & Fundamentals

1 MECH 221 FLUID MECHANICS (Fall 06/07) Tutorial 6 FLUID KINETMATICS.

048866: Packet Switch Architectures Dr. Isaac Keslassy Electrical Engineering, Technion Input-Queued.

EECE Hybrid and Embedded Systems: Computation T. John Koo, Ph.D. Institute for Software Integrated Systems Department of Electrical Engineering and.

If time is continuous we cannot write down the simultaneous distribution of X(t) for all t. Rather, we pick n, t 1,...,t n and write down probabilities.

2003 Fall Queuing Theory Midterm Exam(Time limit：2 hours)

Mathematical Modeling of the Two-Part Type Machine Young Jae Jang Massachusetts Institute of Technology May 12, 2004.

Chapter 9 Differential equations

1 Markov Chains H Plan: –Introduce basics of Markov models –Define terminology for Markov chains –Discuss properties of Markov chains –Show examples of.

Causal-State Splitting Reconstruction Ziba Rostamian CS 590 – Winter 2008.

CHAPTER 7 NON-LINEAR CONDUCTION PROBLEMS

6. Markov Chain. State Space The state space is the set of values a random variable X can take. E.g.: integer 1 to 6 in a dice experiment, or the locations.

Instructor: Vincent Conitzer

Hyperbolic PDEs Numerical Methods for PDEs Spring 2007 Jim E. Jones.

1 Chapter 5 Flow Lines Types Issues in Design and Operation Models of Asynchronous Lines –Infinite or Finite Buffers Models of Synchronous (Indexing) Lines.

Grating reconstruction forward modeling part Mark van Kraaij CASA PhD-day Tuesday 13 November 2007.

Overflow Queueing Networks: Limiting Traffic Equations, Trajectories and Sojourn Times Stijn Fleuren, Yoni Nazarathy, Erjen Lefeber Open Problem Session.

IEEE ICCA 2010 – Xiamen, June 11, 2010 On Closed Form Solutions for Equilibrium Probabilities in the Closed Lu-Kumar Network under Various Buffer Priority.

Solutions Markov Chains 2 3) Given the following one-step transition matrix of a Markov chain, determine the classes of the Markov chain and whether they.

1 CHAPTER 4 TRANSIENT CONDUCTION Neglect spatial variation: Criterion for Neglecting Spatial Temperature Variation Cooling of wire by surface convection:

Markov Chains X(t) is a Markov Process if, for arbitrary times t1 < t2 < < tk < tk+1 If X(t) is discrete-valued If X(t) is continuous-valued i.e.

Chapter 61 Continuous Time Markov Chains Birth and Death Processes,Transition Probability Function, Kolmogorov Equations, Limiting Probabilities, Uniformization.

State N 2.6 The M/M/1/N Queueing System: The Finite Buffer Case.

Discrete Time Markov Chains

Partial Derivatives Example: Find If solution: Partial Derivatives Example: Find If solution: gradient grad(u) = gradient.

Flows and Networks (158052) Richard Boucherie Stochastische Operations Research -- TW wwwhome.math.utwente.nl/~boucherierj/onderwijs/158052/ html.

Math 445: Applied PDEs: models, problems, methods D. Gurarie.

ST3236: Stochastic Process Tutorial 6

An equation for matter waves Seem to need an equation that involves the first derivative in time, but the second derivative in space As before try solution.

Numerical Methods for Acoustic Problems with Complex Geometries Based on Cartesian Grids D.N. Vedder

Numerical Solutions to the Diffusion Equation

Discrete Time Markov Chains (A Brief Overview)

Discrete-time Markov chain (DTMC) State space distribution

Int’l Workshop on SDE TT

Convection-Dominated Problems

Advanced Statistical Computing Fall 2016

Applications of Lattice Methods

Finite M/M/1 queue Consider an M/M/1 queue with finite waiting room.

Dynamic Programming Lecture 13 (5/31/2017).

Discrete-time markov chain (continuation)

Lecture 4: Algorithmic Methods for G/M/1 and M/G/1 type models

Chapman-Kolmogorov Equations

Solutions Markov Chains 1

Linear Algebra Lecture 3.

Solutions Markov Chains 1

Differential Equations

Discrete-time markov chain (continuation)

Autonomous Cyber-Physical Systems: Probabilistic Models

Discrete-time markov chain (continuation)

CS723 - Probability and Stochastic Processes

CS723 - Probability and Stochastic Processes

Presentation transcript:

AIC05 - S. Mocanu 1 NUMERICAL ALGORITHMS FOR TRANSIENT ANALYSIS OF FLUID QUEUES Stéphane Mocanu Laboratoire d’Automatique de Grenoble FRANCE

AIC05 - S. Mocanu 2 Basic tandem model Two machines separated by a finite buffer Unreliable machines Deterministic service times Infinite arrivals an machine M 1 Infinite available places at the exit of M 2

AIC05 - S. Mocanu 3 Fluid (continuous) modem

AIC05 - S. Mocanu 4 Versions Non-blocking, Time Dependent Failures Communication systems (Mitra) Blocking, Operation Dependent Failures Production systems (Gershwin)

AIC05 - S. Mocanu 5 Operation depending failures Suppose M 1 slowed down by M 2 (U 1 >U 2, x=C) The failure rate is reduced to: A completely blocked (starved) machine cannot fail !

AIC05 - S. Mocanu 6 Internal equations Not an ordinary Markov chain Continuous transitions on the “fluid direction” Infinitesimal variation of the probability mass Discrete transitions Discrete state Continuous transition

AIC05 - S. Mocanu 7 An example: homogeneous case State = {M 1 state, M 2 state, buffer level} U U 0 0 Machines driven by two state Markov chains

AIC05 - S. Mocanu 8 Joint evolution

AIC05 - S. Mocanu 9 Evolution equations A PDE system Markov chain generator Drift matrix In the example

AIC05 - S. Mocanu 10 Boundary conditions for ODF systems Discontinuities of the probability distribution P 0 (t) P C (t)

AIC05 - S. Mocanu 11 Difficulties Boundary condition does NOT verify the PDE –Some boundary states are of 0 probability –Some transitions are modified (due to ODF) M 0 on lower boundary M C on upper boundary

AIC05 - S. Mocanu 12 Homogeneous case Example: state (0,0,C) Matrix form

AIC05 - S. Mocanu 13 Initial conditions Specify Example : machine state (1,1) (both ON), buffer empty

AIC05 - S. Mocanu 14 The problem Find an integration algorithm for –under boundary conditions b.c. –with initial conditions i.c.

AIC05 - S. Mocanu 15 The integration scheme Decompose the system in –Linear evolution –Wave evolution Apply b.c.

AIC05 - S. Mocanu 16 Recurrent solution Linear transform Wave transform

AIC05 - S. Mocanu 17 Recurrent form of the b.c.

AIC05 - S. Mocanu 18 Numerical results Initial state : (0,1) buffer half full

AIC05 - S. Mocanu 19 Numerical results Initial state : (0,1) buffer half full First starvation

AIC05 - S. Mocanu 20 Numerical results

AIC05 - S. Mocanu 21 Some limitations Needs compatible i.c. –Warning : machine state (1,1), buffer empty is NOT compatible –But : machine state (1,1), buffer =  x, it IS Some boundaries propagates bad For the instance we need explicit analysis of boundary conditions Actual numerical implementation is limited to ON/OFF machines