Stability using fluid limits: Illustration through an example "Push-Pull" queuing network Yoni Nazarathy* EURANDOM Contains Joint work with Gideon Weiss.

Slides:

Advertisements

Similar presentations

One-phase Solidification Problem: FEM approach via Parabolic Variational Inequalities Ali Etaati May 14 th 2008.

Advertisements

Queueing and Scheduling - Bridging the Gap Gideon Weiss University of Haifa CIRM Marseilles May, 2008 Gideon Weiss University of Haifa CIRM Marseilles.

Queueing Models and Ergodicity. 2 Purpose Simulation is often used in the analysis of queueing models. A simple but typical queueing model: Queueing models.

CWI PNA2, Reading Seminar, Presented by Yoni Nazarathy EURANDOM and the Dept. of Mechanical Engineering, TU/e Eindhoven September 17, 2009 An Assortment.

Balancing Reduces Asymptotic Variance of Outputs Yoni Nazarathy * EURANDOM, Eindhoven University of Technology, The Netherlands. Based on some joint works.

Lecture 13 – Continuous-Time Markov Chains

1 Stability Analysis of Switched Systems: A Variational Approach Michael Margaliot School of EE-Systems Tel Aviv University Joint work with Daniel Liberzon.

Simulation Where real stuff starts. ToC 1.What, transience, stationarity 2.How, discrete event, recurrence 3.Accuracy of output 4.Monte Carlo 5.Random.

048866: Packet Switch Architectures Dr. Isaac Keslassy Electrical Engineering, Technion Review.

1 ENS, June 21, 2007 Jean-Yves Le Boudec, EPFL joint work with David McDonald, U. of Ottawa and Jochen Mundinger, EPFL …or an Art ? Is Mean Field a Technology…

TCOM 501: Networking Theory & Fundamentals

Network Bandwidth Allocation (and Stability) In Three Acts.

1 DYNAMIC SCHEDULING OF A PARALLEL SERVER SYSTEM IN HEAVY TRAFFIC UNDER A COMPLETE RESOURCE POOLING CONDITION Ruth J. Williams University of California,

Scheduling for maximizing throughput EECS, UC Berkeley Presented by Antonis Dimakis

EE 685 presentation Optimization Flow Control, I: Basic Algorithm and Convergence By Steven Low and David Lapsley Asynchronous Distributed Algorithm Proof.

1 A Generic Mean Field Convergence Result for Systems of Interacting Objects From Micro to Macro Jean-Yves Le Boudec, EPFL Joint work with David McDonald,

Maximum Size Matchings & Input Queued Switches Sundar Iyer, Nick McKeown High Performance Networking Group, Stanford University,

Basic Definitions Positive Matrix: 5.Non-negative Matrix:

Finite Buffer Fluid Networks with Overflows Yoni Nazarathy, Swinburne University of Technology, Melbourne. Stijn Fleuren and Erjen Lefeber, Eindhoven University.

Chapter 5 Objectives 1. Find ordered pairs associated with two equations 2. Solve a system by graphing 3. Solve a system by the addition method 4. Solve.

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.

Asaf Cohen (joint work with Rami Atar) Department of Mathematics University of Michigan Financial Mathematics Seminar University of Michigan March 11,

Yoni Nazarathy EPPS EURANDOM November 4, 2010

September 27, Instabilities and Oscillations in Networks of Queues Matthew Andrews Bell Labs Joint work with Alex Slivkins (Cornell)

1 Stability Analysis of Linear Switched Systems: An Optimal Control Approach Michael Margaliot School of Elec. Eng. Tel Aviv University, Israel Joint work.

A bit on Queueing Theory: M/M/1, M/G/1, GI/G/1 Yoni Nazarathy * EURANDOM, Eindhoven University of Technology, The Netherlands. (As of Dec 1: Swinburne.

Yoni Nazarathy Gideon Weiss University of Haifa Yoni Nazarathy Gideon Weiss University of Haifa On the Variance of Queueing Output Processes Haifa Statistics.

Decentralised load balancing in closed and open systems A. J. Ganesh University of Bristol Joint work with S. Lilienthal, D. Manjunath, A. Proutiere and.

On the variance curve of outputs for some queues and networks Yoni Nazarathy Gideon Weiss Yoav Kerner QPA Seminar, EURANDOM January 8, 2009.

Finite Buffer Fluid Networks with Overflows Yoni Nazarathy, Swinburne University of Technology, Melbourne. Stijn Fleuren and Erjen Lefeber, Eindhoven University.

Artificial Intelligence

Lecture #9 Analysis tools for hybrid systems: Impact maps João P. Hespanha University of California at Santa Barbara Hybrid Control and Switched Systems.

Advanced Counting Techniques CSC-2259 Discrete Structures Konstantin Busch - LSU1.

Yoni Nazarathy Gideon Weiss University of Haifa Yoni Nazarathy Gideon Weiss University of Haifa The Asymptotic Variance of the Output Process of Finite.

Parameter Estimation Problems in Queueing and Related Stochastic Models Yoni Nazarathy School of Mathematics and Physics, The University of Queensland.

1 1.5 © 2016 Pearson Education, Inc. Linear Equations in Linear Algebra SOLUTION SETS OF LINEAR SYSTEMS.

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

Yoni Nazarathy Gideon Weiss University of Haifa Yoni Nazarathy Gideon Weiss University of Haifa The Asymptotic Variance of the Output Process of Finite.

1 Queueing Theory Frank Y. S. Lin Information Management Dept. National Taiwan University

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. Networks of Queues Stability Queuing networks are frequently used models The stability issue may, in general,

On the variance curve of outputs for some queues and networks Yoni Nazarathy Gideon Weiss Yoav Kerner CWI Amsterdam March 2009.

Appointment Systems - a Stochastic and Fluid Approach Michal Penn The William Davidson Faculty of Industrial Engineering and Management Technion - Israel.

On Control of Queueing Networks and The Asymptotic Variance Rate of Outputs Ph.d Summary Talk Yoni Nazarathy Supervised by Prof. Gideon Weiss Haifa Statistics.

Michael J. Neely, University of Southern California CISS, Princeton University, March 2012 Asynchronous Scheduling for.

Yoni Nazarathy Gideon Weiss University of Haifa Yoni Nazarathy Gideon Weiss University of Haifa The Asymptotic Variance Rate of the Departure Process of.

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

Yoni Nazarathy Gideon Weiss University of Haifa Yoni Nazarathy Gideon Weiss University of Haifa On the Asymptotic Variance Rate of the Output Process of.

Positive Harris Recurrence and Diffusion Scale Analysis of a Push-Pull Queueing Network Yoni Nazarathy and Gideon Weiss University of Haifa ValueTools.

ORSIS Conference, Jerusalem Mountains, Israel May 13, 2007 Yoni Nazarathy Gideon Weiss University of Haifa Yoni Nazarathy Gideon Weiss University of Haifa.

STUDENTS PROBABILITY DAY Weizmann Institute of Science March 28, 2007 Yoni Nazarathy (Supervisor: Prof. Gideon Weiss) University of Haifa Yoni Nazarathy.

EE 685 presentation Optimization Flow Control, I: Basic Algorithm and Convergence By Steven Low and David Lapsley.

AUTOMATIC CONTROL THEORY II Slovak University of Technology Faculty of Material Science and Technology in Trnava.

The Asymptotic Variance of Departures in Critically Loaded Queues Yoni Nazarathy * EURANDOM, Eindhoven University of Technology, The Netherlands. (As of.

1 ۞ An eigenvalue λ and an eigenfunction f(x) of an operator Ĥ in a space S satisfy Week 6 2. Properties of self-adjoint operators where f(x) is implied.

14 th INFORMS Applied Probability Conference, Eindhoven July 9, 2007 Yoni Nazarathy Gideon Weiss University of Haifa Yoni Nazarathy Gideon Weiss University.

LIMITS OF FUNCTIONS. CONTINUITY Definition (p. 110) If one or more of the above conditions fails to hold at C the function is said to be discontinuous.

Yoni Nazarathy Gideon Weiss University of Haifa Yoni Nazarathy Gideon Weiss University of Haifa The Asymptotic Variance of the Output Process of Finite.

On the Variance of Output Counts of Some Queueing Systems Yoni Nazarathy Gideon Weiss SE Club, TU/e April 20, 2008.

ECE-7000: Nonlinear Dynamical Systems 3. Phase Space Methods 3.1 Determinism: Uniqueness in phase space We Assume that the system is linear stochastic.

Eigenvalues, Zeros and Poles

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

Theory of Capital Markets

Linear Systems November 28, 2016.

Modern Control Systems (MCS)

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

Departure Process Variability of Queues and Queueing Networks

Queueing networks.

The Variance of Production Counts over a Long Time Horizon

Presentation transcript:

Stability using fluid limits: Illustration through an example "Push-Pull" queuing network Yoni Nazarathy* EURANDOM Contains Joint work with Gideon Weiss and Erjen Lefeber Universiteit Gent October 14, 2010 * Supported by NWO-VIDI Grant of Erjen Lefeber

K umar S eidman R ybko S toylar

Purpose of the talk Part 1: Outline research on Multi-Class Queueing Networks (with Infinite Supplies) - N., Weiss, Ongoing work with Lefeber Part 2: An overview of “the fluid limit” method for stability of queueing networks Key papers: - Rybko, Stolyar Dai Bramson/Mandelbaum/Dai/Meyn… Recommended Book: - Bramson, Stability of Queueing Networks, 2009

PART 1: MULTI-CLASS QUEUEING NETWORKS (WITH INFINITE SUPPLIES)

Continuous Time, Discrete Jobs 2 job streams, 4 steps Queues at pull operations Infinite job supply at 1 and 3 2 servers The Push-Pull Network Control choice based on No idling, FULL UTILIZATION Preemptive resume Push Pull Push Pull

“interesting” Configurations: Processing Times

Policies Policy: Pull priority (LBFS) Policy: Linear thresholds Typical Behavior: 2, ,3 Typical Behavior: Server: “don’t let opposite queue go below threshold” Push Pull Push 1,3

8 is strong Markov with state space. A Markov Process Queue Residual

Stability Results Theorem (N., Weiss): Pull-priority,, is PHR Theorem (N., Weiss): Linear thresholds,, is PHR Theorem (in progress) (Lefeber, N.):, pull-priority, is PHR if More generally, when there is a matrix such that is PHR when e.g: Theorem (Lefeber, N.):, pull-priority, if, is PHR Current work: Generalizing to servers

Heuristic Modes Graph for M=3 Pull-Priority

Heuristic Stable Fluid Trajectory of M=3 Pull-Priority Case

PART 2: THE “FLUID LIMIT METHOD” FOR STABILITY

Main Idea Establish that an “associated” deterministic system is “stable” The “framework” then implies that is “stable” Nice, since stability of is sometimes easier to establish than directly working

Stochastic Model and Fluid Model

Comments on the Fluid Model T is Lipschitz and thus has derivative almost everywhere Any Y=(Q,T) that satisfies the fluid model is called a solution In general (for arbitrary networks) a solution can be non-unique

Stability of Fluid Model Definition: A fluid model is stable, if when ever, there exists T, such that for all solutions, Definition: A fluid model is weakly stable, if when ever Main Results of “Fluid Limit Method” Stable Fluid Model Positive Harris Recurrence Weakly Stable Fluid Model Technical Conditions on Markov Process (Pettiness) Rate Stability: Association of Fluid Model To Stochastic System

Association of Fluid Model and Stochastic System

Lyapounov Proofs for Fluid Stability When, it stays at 0. When, at regular points of t,. Need: for every solution of fluid model:

19

20

QUESTIONS?